Skip to main content
Springer Nature Link
Log in

On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography

  • Conference paper
Coding and Cryptography (WCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3969))

Included in the following conference series:

Abstract

We study two topics on degrees of polynomials which interpolate cryptographic functions. The one is concerned with elliptic curve discrete logarithm (ECDL) on curves with an endomorphism of degree 2 or 3. For such curves, we obtain a better lower bound of degrees for polynomial interpolation of ECDL. The other deals with degrees of polynomial interpolations of embeddings of a subgroup of the multiplicative group of a finite field to an elliptic curve.

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.

Similar content being viewed by others

References

  1. Cassels, J.W.S.: A note on the division values of \(\wp (u)\). Proc. Cambridge Philos. Soc. 45, 167–172 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kiltz, E., Winterhof, A.: On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping. Bull. Austral. Math. Soc. 69, 305–315 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lange, T., Winterhof, A.: Polynomial interpolation of the elliptic curve and XTR discrete logarithm. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 137–143. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Lange, T., Winterhof, A.: Interpolation of the discrete logarithm in F q by boolean functions and by polynomial in several variables modulo a divisor of q − 1. Discrete Appl. Math. 128, 193–206 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lange, T., Winterhof, A.: Interpolation of the elliptic curve Diffie-Hellman mapping. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 51–60. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Satoh, T.: Generalized division polynomials. Math. Scand. 94, 161–184 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Silverman, J.H.: The arithmetic of elliptic curves. GTM, 106. Springer, Heidelberg (1985)

    Google Scholar 

  8. Stark, H.M.: Class-numbers of complex quadratic fields, Modular functions of one variable, I. In: Proc. Internat. Summer School, Univ. Antwerp, Antwerp, 1972. Lect. Notes in Math, vol. 320, pp. 153–174. Springer, Berlin (1973)

    Google Scholar 

  9. Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 195–210. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge UP, Cambridge (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Tokyo Institute of Technology, Tokyo, 152-8551, Japan

    Takakazu Satoh

Authors
  1. Takakazu Satoh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Informatics, University of Bergen, N-5020, Bergen, Norway

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Satoh, T. (2006). On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_13

Download citation

  • DOI: https://doi.org/10.1007/11779360_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35481-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics