Abstract
We define three hard problems in the theory of elliptic divisibility sequences (EDS Association, EDS Residue and EDS Discrete Log), each of which is solvable in sub-exponential time if and only if the elliptic curve discrete logarithm problem is solvable in sub-exponential time. We also relate the problem of EDS Association to the Tate pairing and the MOV, Frey-Rück and Shipsey EDS attacks on the elliptic curve discrete logarithm problem in the cases where these apply.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Information Theory IT-24, 106–110 (1978)
Shipsey, R.: Elliptic Divibility Sequences. PhD thesis, Goldsmiths, University of London (2001)
Shipsey, R., Swart, C.: Elliptic divisibility sequences and the elliptic curve discrete logarithm problem (2008), http://eprint.iacr.org/2008/444
Ward, M.: Memoir on elliptic divisibility sequences. Amer. J. Math. 70, 31–74 (1948)
Swart, C.: Elliptic curves and related sequences. PhD thesis, Royal Holloway and Bedford New College, University of London (2003)
Ayad, M.: Périodicité (mod q) des suites elliptiques et points S-entiers sur les courbes elliptiques. Ann. Inst. Fourier (Grenoble) 43, 585–618 (1993)
Silverman, J.H.: Common divisors of elliptic divisibility sequences over function fields. Manuscripta Math. 114, 431–446 (2004)
Silverman, J.H.: p-adic properties of division polynomials and elliptic divisibility sequences. Math. Ann. 332, 443–471 (2005)
Everest, G., Mclaren, G., Ward, T.: Primitive divisors of elliptic divisibility sequences. J. Number Theory 118, 71–89 (2006)
Stange, K.E.: Elliptic nets and elliptic curves (submitted) (2007), http://arxiv.org/abs/0710.1316v2
Stange, K.E.: Elliptic nets and elliptic curves. PhD thesis, Brown University (May 2008)
Everest, G., Poorten, A.v.d., Shparlinski, I., Ward, T.: Elliptic Divisibility Sequences. In: Recurrence Sequences, pp. 163–175. American Mathematical Society, Providence (2003)
Stange, K.E.: The tate pairing via elliptic nets. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 329–348. Springer, Heidelberg (2007)
Gosper, R.W., Orman., H., Schroeppel, R.: Using somos sequences for cryptography
Silverman, J.H.: The arithmetic of elliptic curves. Graduate Texts in Mathematics, vol. 106. Springer, New York (1992); Corrected reprint of the, original (1986)
Stange, K.E.: Elliptic nets, generalised Jacobians and bi-extensions (in preparation)
Frey, G., Lange, T.: Background on curves and Jacobians. In: Handbook of elliptic and hyperelliptic curve cryptography. Discrete Math. Appl. (Boca Raton), pp. 45–85. Chapman & Hall/CRC, Boca Raton (2005)
Bach, E., Shallit, J.: Algorithmic number theory, Efficient algorithms. Foundations of Computing Series, vol. 1. MIT Press, Cambridge (1996)
Duquesne, S., Frey, G.: Background on pairings. In: Handbook of elliptic and hyperelliptic curve cryptography. Discrete Math. Appl. (Boca Raton), pp. 115–124. Chapman & Hall/CRC, Boca Raton (2006)
Galbraith, S.D.: Pairings. In: Advances in elliptic curve cryptography. London Math. Soc. Lecture Note Ser., vol. 317, pp. 183–213. Cambridge Univ. Press, Cambridge (2005)
Menezes, A.J., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory 39, 1639–1646 (1993)
Frey, G., Rück, H.G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62, 865–874 (1994)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997) (With a foreword by Ronald L. Rivest)
Crandall, R., Pomerance, C.: Prime numbers. Springer, New York (2001) (A computational perspective)
K. Fong, D. Hankerson, J.López., Menezes, A.: Field inversion and point halving revisited. Technical Report, CORR 2003-18, Department of Combinatorics and Optimization, University of Waterloo, Canada (2003)
Itoh, T., Tsujii, S.: An efficient algorithm for deciding quadratic residuosity in finite fields GF(p m). Inform. Process. Lett. 30, 111–114 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lauter, K.E., Stange, K.E. (2009). The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences. In: Avanzi, R.M., Keliher, L., Sica, F. (eds) Selected Areas in Cryptography. SAC 2008. Lecture Notes in Computer Science, vol 5381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04159-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-04159-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04158-7
Online ISBN: 978-3-642-04159-4
eBook Packages: Computer ScienceComputer Science (R0)