{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:32Z","timestamp":1778215772357,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_26","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"271-281","source":"Crossref","is-referenced-by-count":85,"title":["Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms"],"prefix":"10.1007","author":[{"given":"Ueli M.","family":"Maurer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"L.M. Adleman and M.A. Huang, Primality testing and abelian varieties over finite fields, Lecture Notes in Mathematics, vol. 1512, Springer Verlag, 1992.","DOI":"10.1007\/BFb0090185"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J. Buchmann","year":"1988","unstructured":"J. Buchmann and H.C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology, vol. 1, no. 2, pp. 107\u2013118, 1988.","journal-title":"Journal of Cryptology"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E.R. Canfield","year":"1983","unstructured":"E.R. Canfield, P. Erd\u00f6s and C. Pomerance, On a problem of Oppenheim concerning \u201cFactorisatio Numerorum\u201d, J. Number Theory, vol. 17, pp. 1\u201328, 1983.","journal-title":"J. Number Theory"},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","first-page":"530","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"B. Boer den","year":"1989","unstructured":"B. den Boer, Diffie-Hellman is as strong as discrete log for certain primes, Advances in Cryptology \u2014 CRYPTO\u2019 88, Lecture Notes in Computer Science, vol. 403, pp. 530\u2013539, Berlin: Springer-Verlag, 1989."},{"issue":"6","key":"26_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El-Gamal","year":"1985","unstructured":"T. El-Gamal, A public key cryptosystem and a signature scheme based on the discrete logarithm, IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and J. Kilian, Almost all primes can be quickly certified, Proc. of the 18th Annual ACM Symposium on the Theory of Computing, pp. 316\u2013329, 1986.","DOI":"10.1145\/12130.12162"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"H.W. Lenstra, Jr., Factoring integers with elliptic curves, Annals of Mathematics, vol. 126, pp. 649\u2013673, 1987.","journal-title":"Annals of Mathematics"},{"key":"26_CR9","unstructured":"J.L. Massey, Advanced Technology Seminars Short Course Notes, Zurich, 1993, pp 6.66\u20136.68."},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/3-540-46416-6_43","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 91","author":"U.M. Maurer","year":"1991","unstructured":"U.M. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology \u2014 EUROCRYPT\u2019 91, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 547, pp. 498\u2013507, 1991."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"K.S. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology, vol. 1, no. 2, pp. 95\u2013105.","DOI":"10.1007\/BF02351718"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"K.S. McCurley, The discrete logarithm problem, in Cryptology and computational number theory, C. Pomerance (ed.), Proc. of Symp. in Applied Math., vol. 42, pp. 49\u201374, American Mathematical Society, 1990.","DOI":"10.1090\/psapm\/042\/1095551"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"A. Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"issue":"6","key":"26_CR14","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/TIT.1986.1057236","volume":"32","author":"R. Peralta","year":"1986","unstructured":"R. Peralta, A simple and fast probabilistic algorithm for computing square roots modulo a prime number, IEEE Trans. on Information Theory, vol. 32, no. 6, pp. 846\u2013847, 1986.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"S.C. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, vol. 24, no. 1, pp. 106\u2013110, 1978.","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"J.M. Pollard, Theorems on factorization and primality testing, Proceedings of the Cambridge Philosophical Society, vol. 76, pp. 521\u2013528, 1974.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21, no. 2, pp. 120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.2307\/2008268","volume":"49","author":"H. R\u00fcck","year":"1987","unstructured":"H. R\u00fcck, A note on elliptic curves over finite fields, Math. Comp., vol. 49, pp. 301\u2013304, 1987.","journal-title":"Math. Comp."},{"key":"26_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"C.P. Schnorr","year":"1990","unstructured":"C.P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology \u2014 CRYPTO\u2019 89, Lecture Notes in Computer Science, vol. 435, pp. 239\u2013252, Berlin: Springer-Verlag, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:12Z","timestamp":1605647772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_26","relation":{},"subject":[]}}