{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T19:03:41Z","timestamp":1778785421258,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":28,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_246","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:50:46Z","timestamp":1319709046000},"page":"397-400","source":"Crossref","is-referenced-by-count":14,"title":["Elliptic Curve Discrete Logarithm Problem"],"prefix":"10.1007","author":[{"given":"Darrel","family":"Hankerson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"246_CR1_246","series-title":"Lecture Notes in Computer Science","first-page":"28","volume-title":"Algorithmic Number Theory\u2014ANTS-I","author":"L Adleman","year":"1994","unstructured":"Adleman L, DeMarrais J, Huang M (1994) A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. Algorithmic Number Theory\u2014ANTS-I, Lecture Notes in Computer Science, vol 877. Springer, Berlin, pp 28\u201340"},{"key":"246_CR2_246","unstructured":"Diem C (in press), On the discrete logarithm problem in class groups of curves. Mathematics of Computation, to appear"},{"key":"246_CR3_246","volume-title":"On the discrete logarithm problem in elliptic curves","author":"C Diem","year":"2009","unstructured":"Diem C (2009) On the discrete logarithm problem in elliptic curves. Preprint"},{"key":"246_CR4_246","first-page":"128","volume-title":"Applications of arithmetical geometry to cryptographic constructions","author":"G Frey","year":"2001","unstructured":"Frey G (2001) Applications of arithmetical geometry to cryptographic constructions. Proceedings of the Fifth International Conference on Finite Fields and Applications, Springer, Berlin, pp 128\u2013161"},{"key":"246_CR5_246","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey G, R\u00fcck H (1994) A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math Comput 62:865\u2013874","journal-title":"Math Comput"},{"key":"246_CR6_246","first-page":"1699","volume":"69","author":"R Gallant","year":"2000","unstructured":"Gallant R, Lambert R, Vanstone S (2000) Improving the parallelized Pollard lambda search on anomalous binary curves. Math Comput 69:1699\u20131705","journal-title":"Math Comput"},{"key":"246_CR7_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in cryptology\u2014EUROCRYPT 2000","author":"P Gaudry","year":"2000","unstructured":"Gaudry P (2000) An algorithm for solving the discrete log problem in hyperelliptic curves. Advances in cryptology\u2014EUROCRYPT 2000, Lecture Notes in Computer Science, vol 1807. Springer, Berlin, pp 19\u201334"},{"issue":"12","key":"246_CR8_246","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P Gaudry","year":"2009","unstructured":"Gaudry P (2009), Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. J Symbol Computation 44(12):1690\u20131702","journal-title":"J Symbol Computation"},{"key":"246_CR9_246","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P Gaudry","year":"2002","unstructured":"Gaudry P, Hess F, Smart N (2002) Constructive and destructive facets of Weil descent on elliptic curves. J Cryptol 15:19\u201346","journal-title":"J Cryptol"},{"key":"246_CR10_246","first-page":"167","volume":"7","author":"F Hess","year":"2004","unstructured":"Hess F (2004) Generalising the GHS attack on the elliptic curve discrete logarithm problem. LMS J Comput Math 7:167\u2013192","journal-title":"LMS J Comput Math"},{"key":"246_CR11_246","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1008312401197","volume":"20","author":"M Jacobson","year":"2000","unstructured":"Jacobson M, Koblitz N, Silverman J, Stein A, Teske E (2000) Analysis of the xedni calculus attack. Design Codes Cryptogr 20:41\u201364","journal-title":"Design Codes Cryptogr"},{"key":"246_CR12_246","first-page":"231","volume":"16","author":"M Jacobson","year":"2001","unstructured":"Jacobson M, Menezes A, Stein A (2001) Solving elliptic curve discrete logarithm problems using Weil descent. J Ramanujan Math Soc 16:231\u2013260","journal-title":"J Ramanujan Math Soc"},{"key":"246_CR13_246","first-page":"127","volume":"5","author":"M Maurer","year":"2002","unstructured":"Maurer M, Menezes A, Teske E (2002) Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree. LMS J Comput Math 5:127\u2013174","journal-title":"LMS J Comput Math"},{"key":"246_CR14_246","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A Menezes","year":"1993","unstructured":"Menezes A, Okamoto T, Vanstone S (1993) Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans Inf Theory 39:1639\u20131646","journal-title":"IEEE Trans Inf Theory"},{"key":"246_CR15_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45353-9_23","volume-title":"Topics in cryptology\u2014CT-RSA 2001","author":"A Menezes","year":"2001","unstructured":"Menezes A, Qu M (2001) Analysis of the Weil descent attack of Gaudry, Hess and Smart. Topics in cryptology\u2014CT-RSA 2001, Lecture Notes in Computer Science, vol 2020. Springer, Berlin, pp 308\u2013318"},{"key":"246_CR16_246","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00200-005-0186-8","volume":"16","author":"A Menezes","year":"2006","unstructured":"Menezes A, Teske E (2006) Cryptographic implications of Hess\u2019 generalized GHS attack. Appl Algebr Eng Comm Comput 16:439\u2013460","journal-title":"Appl Algebr Eng Comm Comput"},{"key":"246_CR17_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-24660-2_28","volume-title":"Topics in cryptology\u2013CT-RSA 2004","author":"A Menezes","year":"2004","unstructured":"Menezes A, Teske E, Weng A (2004) Weak fields for ECC. Topics in cryptology\u2013CT-RSA 2004, Lecture Notes in Computer Science, vol 2964. Springer, Berlin, pp 366\u2013386"},{"key":"246_CR18_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in cryptology\u2014CRYPTO \u201985","author":"V Miller","year":"1986","unstructured":"Miller V (1986) Use of elliptic curves in cryptography. Advances in cryptology\u2014CRYPTO \u201985, Lecture Notes in Computer Science, vol 218. Springer, Berlin, pp 417\u2013426"},{"key":"246_CR19_246","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig S, Hellman M (1978) An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans Inf Theory 24, 106\u2013110","journal-title":"IEEE Trans Inf Theory"},{"key":"246_CR20_246","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard J (1978) Monte Carlo methods for index computation (mod p). Math Comput 32:918\u2013924","journal-title":"Math Comput"},{"key":"246_CR21_246","first-page":"81","volume":"47","author":"T Satoh","year":"1998","unstructured":"Satoh T, Araki K (1998) Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Comment Math Universitat Sancti Pauli 47:81\u201392","journal-title":"Comment Math Universitat Sancti Pauli"},{"key":"246_CR22_246","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"67","author":"I Semaev","year":"1998","unstructured":"Semaev I (1998) Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Math Comput 67:353\u2013356","journal-title":"Math Comput"},{"key":"246_CR23_246","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008319518035","volume":"20","author":"J Silverman","year":"2000","unstructured":"Silverman J (2000) The xedni calculus and the elliptic curve discrete logarithm problem. Design Codes Cryptogr 20:5\u201340","journal-title":"Design Codes Cryptogr"},{"key":"246_CR24_246","series-title":"Lecture Notes in Computer Science","first-page":"110","volume-title":"Advances in cryptology\u2014ASIACRYPT \u201998","author":"J Silverman","year":"1998","unstructured":"Silverman J, Suzuki J (1998) Elliptic curve discrete logarithms and the index calculus. Advances in cryptology\u2014ASIACRYPT \u201998, Lecture Notes in Computer Science, vol 1514. Springer, Berlin, pp 110\u2013125"},{"key":"246_CR25_246","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001459900052","volume":"12","author":"N Smart","year":"1999","unstructured":"Smart N (1999) The discrete logarithm problem on elliptic curves of trace one. J Cryptol 12:193\u2013196","journal-title":"J Cryptol"},{"key":"246_CR26_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054891","volume-title":"Algorithmic number theory\u2014ANTS-III","author":"E Teske","year":"1998","unstructured":"Teske E (1998) Speeding up Pollard\u2019s rho method for computing discrete logarithms. Algorithmic number theory\u2014ANTS-III, Lecture Notes in Computer Science, vol 1423. Springer, Berlin, pp 541\u2013554"},{"key":"246_CR27_246","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P van Oorschot","year":"1998","unstructured":"van Oorschot P, Wiener W (1998) Parallel collision search with cryptanalytic applications. J Cryptol 12:1\u201328","journal-title":"J Cryptol"},{"key":"246_CR28_246","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48892-8_15","volume-title":"Selected Areas in Cryptography\u2014SAC \u201998","author":"M Wiener","year":"1999","unstructured":"Wiener M, Zuccherato R (1999) Faster attacks on elliptic curve cryptosystems. Selected Areas in Cryptography\u2014SAC \u201998, Lecture Notes in Computer Science 1556:190\u2013200, Springer, Berlin"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:24:43Z","timestamp":1778261083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_246","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}