{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T07:35:33Z","timestamp":1777534533258,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434009","type":"print"},{"value":"9783540459958","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_15","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"118-130","source":"Crossref","is-referenced-by-count":5,"title":["The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Theodoulos","family":"Garefalakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"L.M. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proc. 20th IEEE Found. Comp. Sci. Symp., pages 55\u201360, 1979.","DOI":"10.1109\/SFCS.1979.2"},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","first-page":"108","volume-title":"The function field sieve","author":"L.M. Adleman","year":"1997","unstructured":"L.M. Adleman. The function field sieve. In ANTS: 1st International Algorithmic Number Theory Symposium (ANTS), volume 877 of LNCS, pages 108\u2013121, Berlin, Germany, 1994. Springer."},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume-title":"A subexponential algorithm for discrete logarithms over all finite fields","author":"L.M. Adleman","year":"1994","unstructured":"L.M. Adleman and J. DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. In Douglas R. Stinson, editor, Proc. CRYPTO 93, pages 147\u2013158. Springer, 1994. Lecture Notes in Computer Science No. 773."},{"key":"15_CR4","first-page":"5","volume":"151","author":"L.M. Adleman","year":"1999","unstructured":"L.M. Adleman and M.D. Huang. Function field sieve method for discrete logarithms over finite fields. INFCTRL: Information and Computation (formerly Information and Control), 151:5\u201316, 1999.","journal-title":"INFCTRL: Information and Computation (formerly Information and Control)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"I. Blake, G. Seroussi, and N. Smart. Elliptic curves in Cryptography, volume 265 of London Mathematical Society, Lecture Note Series. Cambridge University Press, 1999.","DOI":"10.1017\/CBO9781107360211"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/0605029","volume":"5","author":"I. F. Blake","year":"1985","unstructured":"I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone. Computing logarithms in finite fields of caracteristic two. SIAM J. Alg. Disc. Methods, 5:276\u2013285, 1985.","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"IT-30","author":"D. Coppersmith","year":"1984","unstructured":"D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inform. Theory, IT-30:587\u2013594, 1984.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, 22:472\u2013492, 1976.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G. Frey","year":"1999","unstructured":"G. Frey, M. M\u00fcller, and H.G. R\u00fcck. The tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inform. Theory, 45(5):1717\u20131719, 1999.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"206","key":"15_CR10","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"G. Frey and H.G. R\u00fcck. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 62(206):865\u2013874, 1994.","journal-title":"Mathematics of Computation"},{"issue":"235","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1090\/S0025-5718-01-01298-4","volume":"70","author":"T. Garefalakis","year":"2001","unstructured":"T. Garefalakis and D. Panario. The index calculus method using non-smooth polynomials. Mathematics of Computation, 70(235):1253\u20131264, 2001.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D.M. Gordon","year":"1993","unstructured":"D.M. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Disc. Math., 6(1):124\u2013138, February 1993.","journal-title":"SIAM J. Disc. Math."},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-48910-X_14","volume-title":"Advances in Cryptology: EUROCRYPT\u2019 99","author":"R. Harasawa","year":"1999","unstructured":"R. Harasawa, J. Shikata, J. Suzuki, and H. Imai. Comparing the MOV and FR reductions in elliptic curve cryptography. In Advances in Cryptology: EUROCRYPT\u2019 99, volume 1592of Lecture Notes in Computer Science, pages 190\u2013205. Springer, 1999."},{"issue":"177","key":"15_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203\u2013209, 1987.","journal-title":"Mathematics of Computation"},{"key":"15_CR15","first-page":"49","volume":"42","author":"K. S. McCurley","year":"1990","unstructured":"K. S. McCurley. The discrete logarithm problem. Proc. of Symp. in Applied Math., 42:49\u201374, 1990.","journal-title":"The discrete logarithm problem"},{"issue":"5","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"A. Menezes, E. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39, 1993.","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Uses of elliptic curves in cryptography","author":"V. S. Miller","year":"1986","unstructured":"V. S. Miller. Uses of elliptic curves in cryptography. In Hugh C. Williams, editor, Advances in cryptology-CRYPTO\u2019 85: proceedings, volume 218 of Lecture Notes in Computer Science, pages 417\u2013426. Springer-Verlag, 1986."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/B978-0-12-386870-1.50014-9","volume-title":"Discrete Algorithms and Complexity","author":"Carl Pomerance","year":"1987","unstructured":"C. Pomerance. Fast, rigorous factorization and discrete logarithm algorithms. In Discrete Algorithms And Complexity, Proc. of the Japan-US Joint Seminar, Academic Press, pages 119\u2013143, 1986."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"J. H. Silverman. The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4757-1920-8"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:18Z","timestamp":1556440218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}