{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:40:17Z","timestamp":1776840017829,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540629757","type":"print"},{"value":"9783540690535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_18","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"256-266","source":"Crossref","is-referenced-by-count":682,"title":["Lower Bounds for Discrete Logarithms and Related Problems"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai and E. Szemer\u00e9di. On the complexity of matrix group problems I. In 25th Annual Symposium on Foundations of Computer Science, pages 229\u2013240, 1984.","DOI":"10.1109\/SFCS.1984.715919"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"D. Boneh and R. J. Lipton. Algorithms for black-box fields and their application to cryptography. In Advances in Cryptology\u2014Crypto\u2019 96, pages 283\u2013297, 1996.","DOI":"10.1007\/3-540-68697-5_22"},{"key":"18_CR3","unstructured":"J. Buchmann, 1995. Personal communication."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In 21st Annual ACM Symposium on Theory of Computing, pages 25\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Advances in Cryptology\u2014Crypto\u2019 94, pages 271\u2013281, 1994.","DOI":"10.1007\/3-540-48658-5_26"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"U. Maurer and S. Wolf. Diffie-Hellman oracles. In Advances in Cryptology\u2014Crypto\u2019 96, pages 268\u2013282, 1996.","DOI":"10.1007\/3-540-68697-5_21"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V. I. Nechaev","year":"1994","unstructured":"V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165\u2013172, 1994. Translated from Matematicheskie Zametki, 55(2):91\u2013101, 1994.","journal-title":"Mathematical Notes"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory, 24:106\u2013110, 1978.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard. Monte Carlo methods for index computation mod p. Mathematics of Computation, 32:918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"C. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4:161\u2013174, 1991.","journal-title":"J. Cryptology"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701\u2013717, 1980.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T20:17:05Z","timestamp":1550693825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]}}}