{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:39:07Z","timestamp":1769297947133,"version":"3.49.0"},"publisher-location":"New York, NY","reference-count":5,"publisher":"Springer New York","isbn-type":[{"value":"9780387971964","type":"print"},{"value":"9780387347998","type":"electronic"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/0-387-34799-2_38","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:17:36Z","timestamp":1186348656000},"page":"530-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Diffie-Hellman is as Strong as Discrete Log for Certain Primes"],"prefix":"10.1007","author":[{"given":"Bert","family":"den Boer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W. and M.E. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory, IT-22, pp. 644\u2013654, Nov. 1976.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"38_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology: Proc. Eurocrypt\u2019 84","author":"A.M. Odlyzko","year":"1985","unstructured":"Odlyzko, A.M., Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proc. Eurocrypt\u2019 84, Lecture Notes in Computer Science 209, Springer, Berlin etc., pp. 224\u2013314, 1985"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C. and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inf. Theory, IT-24, pp. 106\u2013110, Jan 1978.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M., Theorems on Factorization and Primality testing, Proc. Cambr. Philos. Soc., 76, pp 521\u2013528, 1974","journal-title":"Proc. Cambr. Philos. Soc."},{"key":"38_CR5","volume-title":"Primality Testing and Factorisation","author":"H. Riesel","year":"1985","unstructured":"Riesel, H., Primality Testing and Factorisation, Birkhauser, Boston, 1985"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T10:25:11Z","timestamp":1576146311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}