Coding Theory, Cryptography and Related Areas - J. Buchmann - Librairie Eyrolles
Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Coding Theory, Cryptography and Related Areas
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Coding Theory, Cryptography and Related Areas

Coding Theory, Cryptography and Related Areas

J. Buchmann

260 pages, parution le 20/01/2000

Résumé

This book contains 23 contributions presented at the "International Conference on Coding Theory, Cryptography and Related Areas (ICCC)", held in Guanajuato, Mexico, in April 1998.

It comprises a series of research papers on various aspects of coding theory (geometric-algebraic, decoding, exponential sums, etc.) and cryptography (discrete logarithm problem, public key cryptosystems, primitives, etc.), as well as in other research areas, such as codes over finite rings and some aspects of function fields and algebraic geometry over finite fields.

The book contains new results on the subject, never published in any other form. It will be useful to students, researchers, professionals, and tutors interested in this area of research.

Sommaire

  • Modifications of the Rao-Nam Cryptosystem
  • Efficient Reduction on the Jacobian Variety of Picard Curves
  • Continued Fractions in Hyperelliptic Function Fields
  • Discrete Logarithms: Recent Progress
  • One-weight Z4-linear Codes
  • Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y2 = xP - x + 1 Over a Finite Field of Odd Characteristic
  • On Weierstrass Semigroups and One-point Algebraic Geometry Codes
  • On the Undetected Error Probability of m-out-of-n Codes on the Binary Symmetric Channel
  • Skew Pyramids of Function Fields Are Asymptotically Bad
  • A Public Key Cryptosystem Based on Sparse Polynomials
  • Higher Weights of Grassmann Codes
  • Toric Surfaces and Error-correcting Codes
  • Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets
  • Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of n Inputs
  • Zeta Functions of Curves over Finite Fields with Many Rational Points
  • Codes on Drinfeld Modular Curves
  • Elliptic Curves, Pythagorean Triples and Applications
  • Exponential Sums and Stationary Phase (I)
  • Exponential Sums in Several Variables over Finite Fields
  • Decoding Reed-Solomon Codes Beyond Half the Minimum Distance
  • Reed-Muller Type Codes on the Veronese Variety over Finite Fields
  • Cryptography Primitives Based on a Cellular Automaton
  • Factoring the Semigroup Determinant of a Finite Commutative Chain Ring
Voir tout
Replier

Caractéristiques techniques

  PAPIER
Éditeur(s) Springer
Auteur(s) J. Buchmann
Parution 20/01/2000
Nb. de pages 260
Format 15,5 x 23,5
Couverture Broché
Poids 358g
Intérieur Noir et Blanc
EAN13 9783540662488

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription