Skip to main content
SpringerLink
Log in
Book cover

Codes, Curves, and Signals pp 63–75Cite as

Curves, Codes and Cryptography

  • Chapter

  • 305 Accesses

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 485))

Abstract

The use of curves in algebraic geometries to construct codes [13, 14, 15], and asymptotically good codes [30, 11, 12, 39], has been a dramatic development in coding theory of the past two decades. These constructions represent a natural, although not obvious, extension of the notions of Reed-Solomon (RS), Bose-Chaudhuri-Hocquenghem (BCH) and Goppa codes. Moving coding theory into such a rich and elegant setting has proven to be productive and enlightening, with many new and interesting directions being pursued.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.M. Barg, S.L. Katsman and M.A. Tsfasman, Algebraic geometric codes from curves of small genus, Probl. Inform. Transmission, vol. 23, pp. 34–38, 1987.

    MathSciNet  MATH  Google Scholar 

  2. D. Le Brigand, Decoding of codes on hyperelliptic curves, in Lect. Notes Computer Science, vol. 514, Berlin: Springer-Verlag, pp. 126–134, 1990.

    Google Scholar 

  3. M.A. de Boer, Almost MDS codes, Designs, Codes and Cryptography, vol. 9, pp. 143–155, 1996.

    MATH  Google Scholar 

  4. D. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Computation, vol. 48, pp. 95–101, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  5. H. Cohen, A Course in Computational Algebraic Number Theory, Berlin: Springer 1993.

    MATH  Google Scholar 

  6. Y. Driencourt, Some properties of elliptic codes over a field of characteristic 2, in Lect. Notes Computer Science, vol. 229, Berlin: Springer-Verlag 1985.

    Google Scholar 

  7. Y. Driencourt and J.F. Michon, Elliptic codes over fields of characteristic 2, J. Pure Appl. Algebra, vol.45, pp. 15–39, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  8. Y. Driencourt and J.F. Michon, Remarques sur les codes géométriques, Comptes Rendus, vol.301, pp. 15–17, 1985.

    MathSciNet  MATH  Google Scholar 

  9. A. Faldum and W. Willems, Codes of small defect, Designs, Codes, and Cryptography, vol. 10, pp. 341–350, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  10. W. Fulton, Algebraic Curves: An Introduction to Algebraic Geometry, Reading, MA: Addison-Wesley 1969.

    Google Scholar 

  11. A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlăduţ bound, Inventiones Math., vol. 121, pp. 211–222, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  12. H. Stichtenoth —, On the asymptotic behavior of some towers of function fields over finite fields, J. Number Theory, vol.61, pp. 248–273, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  13. V.D. Goppa, Codes on algebraic curves, Soviet Math. Dokl., vol. 24, pp. 170–172, 1981.

    MATH  Google Scholar 

  14. —, Codes associated with divisors, Probl. Inform. Transmission, vol.13, pp. 22–27, 1977.

    MathSciNet  Google Scholar 

  15. —, Algebraico-geometric codes, Math. USSR Izvestiya, vol.21, pp. 75–91, 1983.

    Article  Google Scholar 

  16. IEEE P1363 Standard for RSA, Diffie-Hellman, and Related Public-Key Cryptography: Elliptic Curve Systems, February 6, 1997.

    Google Scholar 

  17. G.L. Katsman and M.A. Tsfasman, Spectra of algebraic geometry codes, Probl. Inform. Transmission, vol. 23, pp. 262–275, 1987.

    MATH  Google Scholar 

  18. N. Koblitz, A Course in Number Theory and Cryptography, Berlin: Springer 1994.

    Book  MATH  Google Scholar 

  19. —, Elliptic curve cryptosystems, Math. Computation, vol.48, pp. 203–209, 1987

    Article  MathSciNet  MATH  Google Scholar 

  20. —, Constructing elliptic curve cryptosystems in characteristic 2, in Lect. Notes Computer Science, vol.537, pp. 156–167, Berlin: Springer-Verlag 1991.

    Google Scholar 

  21. —, Elliptic and hyperelliptic cryptosystems, unpublished manuscript, 1997.

    Google Scholar 

  22. G.-J. Lay and H.G. Zimmer, Constructing elliptic curves with given group order over large finite fields, in Algorithmic Number Theory: Part I, Lect. Notes Computer Science, vol. 877, pp. 250–263, Berlin: Springer-Verlag 1994.

    Chapter  Google Scholar 

  23. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977.

    MATH  Google Scholar 

  24. A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Dordrecht: Kluwer 1993.

    Google Scholar 

  25. A.J. Menezes, Y.-H. Wu, and R.J. Zuccherato, An elementary introduction to hyperelliptic curves, unpublished manuscript, 1997.

    Google Scholar 

  26. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, Boca Raton, FL: CRC Press 1996.

    Book  Google Scholar 

  27. V. Miller, Uses of elliptic curves in cryptography, in Advances in Cryptology: Crypto′85, Lect. Notes Computer Science, vol. 218, pp. 417–426, Berlin: Springer-Verlag 1985.

    Google Scholar 

  28. C. Moreno, Algebraic Curves over Finite Fields, Cambridge, UK: Cambridge University Press 1993.

    Google Scholar 

  29. A.M. Odlyzko, The future of integer factorization, in Cryptobytes, RSA Inc., 1993.

    Google Scholar 

  30. R. Pellikaan, H. Stichtenoth, and F. Torres, Weierstrass semigroups in an asymptotically good tower of function fields, unpublished manuscript.

    Google Scholar 

  31. J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Math. Computation, vol. 55, pp. 745–763, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  32. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Computation, vol. 44, pp. 483–494, 1988.

    MathSciNet  Google Scholar 

  33. —, Counting points on elliptic curves over finite fields, J. Théorie des Nombres, vol. 7, pp. 219–254, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  34. J.-P. Serre, Nombres des points des courbes algébriques sur Fq, Séminaire de Théorie des Nombres de Bordeaux, vol. 22, 1982/83.

    Google Scholar 

  35. —, Sur le nombre des points rationnels d’une courbe algébrique sur un corps fini, Comptes Rendus, vol. 296, pp. 397–402, 1983.

    MATH  Google Scholar 

  36. J. Silverman, The Arithmetic of Elliptic Curves, Berlin: Springer-Verlag 1986.

    MATH  Google Scholar 

  37. H. Stichtenoth, Algebraic Function Fields and Codes, Berlin: Springer-Verlag 1991.

    Google Scholar 

  38. M.A. Tsfasman and S.G. Vlăduţ, Algebraic-Geometric Codes, Dordrecht: Kluwer Academic 1991.

    Book  MATH  Google Scholar 

  39. M.A. Tspasman, S.G. Vlăduts, and T. Zink, Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound, Math. Nachrichten, vol. 109, pp. 21–28, 1982.

    Article  Google Scholar 

  40. G. van der Geer, Codes and elliptic curves, in Effective Methods in Algebraic Geometry, T. Mora and C. Traverso (Editors), pp. 160–168, Basel: Birkhäuser 1991.

    Google Scholar 

  41. J.H. van Lint and G. van der Geer, Introduction to Coding Theory and Algebraic Geometry, Basel: Birkhäuser 1988.

    Book  MATH  Google Scholar 

  42. W.C. Waterhouse, Abelian varieties over finite fields, Ann. Sci. E.N.S., vol. 2, pp. 521–560, 1969.

    MathSciNet  MATH  Google Scholar 

  43. A. Weil, Variétés Abéliennes et Courbes Algébriques, Paris: Hermann 1948.

    MATH  Google Scholar 

  44. T. Yaghoobian and I.F. Blake, Codes from hyperelliptic curves, in Proc. 30-th Allerton Conf. Comm., Control, and Computing, Monticello, IL., October 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hewlett-Packard Laboratories, 1501 Page Mill Road Palo Alto, CA, 94304, USA

    Ian F. Blake

Authors
  1. Ian F. Blake
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, USA

    Alexander Vardy

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Blake, I.F. (1998). Curves, Codes and Cryptography. In: Vardy, A. (eds) Codes, Curves, and Signals. The Springer International Series in Engineering and Computer Science, vol 485. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5121-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5121-8_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7330-8

  • Online ISBN: 978-1-4615-5121-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation