Skip to main content
SpringerLink
Log in

Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2002)

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

Included in the following conference series:

Abstract

We prove lower bounds on the degree of polynomials interpolating the discrete logarithm in the group of points on an elliptic curve over a finite field and the XTR discrete logarithm, respectively.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bach and J. O. Shallit, Algorithmic number theory, Vol.1: Efficient algorithms. Cambridge: MIT Press 1996.

    MATH  Google Scholar 

  2. J. Buchmann and D. Weber, Discrete logarithms: recent progress. Coding theory, cryptography and related areas (Guanajuato, 1998), 42–56, Springer, Berlin, 2000.

    Google Scholar 

  3. D. Coppersmith and I.E. Shparlinski, On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping, J. Cryptology 13 (2000), 339–360.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. K. Lenstra and E. R. Verheul, The XTR public key system, Advances in cryptology—CRYPTO 2000 (Santa Barbara, CA), 1–19, Lecture Notes in Comput. Sci., 1880, Springer, Berlin, 2000.

    Chapter  Google Scholar 

  5. K. S. McCurley, The discrete logarithm problem. Cryptology and computational number theory (Boulder, CO, 1989), 49–74, Proc. Sympos. Appl. Math., 42, Amer. Math. Soc., Providence, RI, 1990.

    Google Scholar 

  6. A. J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton, FL, 1997.

    Google Scholar 

  7. A. M. Odlyzko, Discrete logarithms and smooth polynomials. Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993), 269–278, Contemp. Math., 168, Amer. Math. Soc., Providence, RI, 1994.

    Google Scholar 

  8. I. E. Shparlinski, Number theoretic methods in cryptography. Complexity lower bounds. Progress in Computer Science and Applied Logic, 17. Birkhäuser Verlag, Basel, 1999.

    Google Scholar 

  9. A. Winterhof, Polynomial interpolation of the discrete logarithm, Des. Codes Cryptogr. 25 (2002), 63–72.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair for Information Security, Ruhr-University Bochum, Universitätsstr. 150, 44780, Bochum, Germany

    Tanja Lange

  2. Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, A-1010, Wien, Austria

    Arne Winterhof

Authors
  1. Tanja Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, T., Winterhof, A. (2002). Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation