Skip to main content
Springer Nature Link
Log in

The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1423))

Included in the following conference series:

  • 199 Accesses

Abstract

In this paper we show that solving the discrete logarithm problem for non-supersingular elliptic curves over finite fields of even characteristic is polynomial-time equivalent to solving a discrete logarithm type of problem in the infrastructure of a certain function field. We give an explicit correspondence between the two structures and show how to compute the equivalence.

This work was performed while the author was a student at Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.A. Adams and M.J. Razar, Multiples of points on elliptic curves and continued fractions, Proc. London Math. Soc. 41 (1980), pp. 481–498.

    MATH  MathSciNet  Google Scholar 

  2. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (1976), pp. 644–654.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory 31 (1985), pp. 469–472.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), pp. 203–209.

    Article  MATH  MathSciNet  Google Scholar 

  5. A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer, Boston, 1993.

    Google Scholar 

  6. V. Miller, Uses of elliptic curves in cryptography, Advances in Cryptology — CRYPTO '85, Lecture Notes in Computer Science 218 (1986), Springer-Verlag, pp. 417–426.

    Google Scholar 

  7. V. Müller, A. Stein and C. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, preprint.

    Google Scholar 

  8. V. Müller, S.A. Vanstone and R. J. Zuccherato, Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2, to appear in Designs, Codes and Cryptography.

    Google Scholar 

  9. S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inform. Theory 24 (1978), pp. 918–924.

    Article  MathSciNet  Google Scholar 

  10. R. Scheidler, Cryptography in real quadratic congruence function fields, Proceedings of Pragocrypt 1996, CTU Publishing House, Prague, Czech Republic (1996).

    Google Scholar 

  11. R. Scheidler, J.A. Buchmann and H.C. Williams, A key exchange protocol using real quadratic fields, J. Cryptology 7 (1994) pp. 171–199.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Scheidler, A. Stein and H.C. Williams, Key-exchange in real quadratic congruence function fields, Des. Codes Cryptogr. 7 (1996), pp. 153–174.

    MATH  MathSciNet  Google Scholar 

  13. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985), pp. 483–494.

    Article  MATH  MathSciNet  Google Scholar 

  14. D. Shanks, The infrastructure of a real quadratic field and its applications, Proc. 1972 Number Theory Conf., Boulder, Colorado, 1972, pp. 217–224.

    Google Scholar 

  15. A. Stein, Equivalences between elliptic curves and real quadratic congruence function fields, Proceedings of Pragocrypt 1996, CTU Publishing House, Prague, Czech Republic (1996).

    Google Scholar 

  16. A. Stein and H.C. Williams, Baby step-giant step in real quadratic function fields, preprint.

    Google Scholar 

  17. B. Weiss and H.G. Zimmer, Artin's Theorie der quadratischen Kongruenzfunkionenkörper und ihre Anwendung auf die Berechnung der Einheiten-und Klassengrupen, Mitt. Math. Ges. Hamburg XII (1991), pp. 261–286.

    Google Scholar 

  18. R.J. Zuccherato, The continued fraction algorithm and regulator for quadratic function fields of characteristic 2, Journal of Algebra 190 (1997), pp. 563–587.

    Article  MATH  MathSciNet  Google Scholar 

  19. R.J. Zuccherato, New Applications of Elliptic Curves and Function Fields in Cryptography, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Canada (1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Entrust Technologies, 750 Heron Road, K1V 1A7, Ottawa, Ontario, Canada

    Robert J. Zuccherato

Authors
  1. Robert J. Zuccherato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joe P. Buhler

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuccherato, R.J. (1998). The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2. In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054897

Download citation

  • DOI: https://doi.org/10.1007/BFb0054897

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64657-0

  • Online ISBN: 978-3-540-69113-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics