{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:27:57Z","timestamp":1774538877906,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_29","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"332-343","source":"Crossref","is-referenced-by-count":73,"title":["On Diffie-Hellman Key Agreement with Short Exponents"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"van Oorschot","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Wiener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"29_CR1","unstructured":"A. Aziz, \u201cSimple Key Management for Internet Protocols (SKIP)\u201d, Internet Draft (work in progress), draft-ietf-ipsec-skip-04.txt, November 1995."},{"key":"29_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-48329-2_16","volume-title":"Crypto\u201993","author":"A. Bosselaers","year":"1994","unstructured":"A. Bosselaers, R. Govaerts, J. Vandewalle, \u201cComparison of three modular reduction functions\u201d, Crypto\u201993, Springer-Verlag LNCS 773, pp.175\u2013176."},{"key":"29_CR3","unstructured":"W. Diffie, M. Hellman, \u201cNew directions in cryptography\u201d, IEEE IT-22 (1976) pp.644\u2013654."},{"key":"29_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/3-540-39799-X_29","volume-title":"Crypto\u201985","author":"J. Hastad","year":"1986","unstructured":"J. Hastad, \u201cOn using RSA with low exponent in a public-key network\u201d, Crypto\u201985. Springer-Verlag LNCS 218, pp.403\u2013408."},{"key":"29_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/3-540-47555-9_38","volume-title":"Eurocrypt\u201992","author":"R. Heiman","year":"1993","unstructured":"R. Heiman, \u201cA note on discrete logarithms with special structure\u201d, Eurocrypt\u201992, Springer-Verlag LNCS 658, pp.454\u2013457."},{"key":"29_CR6","unstructured":"P. Karn, W.A. Simpson, \u201cThe Photuris session key management protocol\u201d. Internet Draft (work in progress), draft-ietf-ipsec-photuris-06.txt, October 1995."},{"key":"29_CR7","unstructured":"D.E. Knuth, The Art of Computer Programming, vol.2: Seminumerical Algorithms, 2nd edition, Addison-Wesley, 1981."},{"key":"29_CR8","unstructured":"D.E. Knuth, The Art of Computer Programming, vol.3: Sorting and Searching, Addison-Wesley, 1973."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00123958","volume":"1","author":"B.A. LaMacchia","year":"1991","unstructured":"B.A. LaMacchia, A.M. Odlyzko, \u201cComputation of discrete logarithms in prime fields\u201d, Designs, Codes and Cryptography, vol.1 no.1 (May 1991), pp.47\u201362.","journal-title":"Designs, Codes and Cryptography"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/psapm\/042\/1095551","volume":"42","author":"K.S. McCurley","year":"1990","unstructured":"K.S. McCurley, \u201cThe discrete logarithm problem\u201d, pp.49\u201374 in: Cryptology and Computational Number Theory \u2014 Proc. Symp. Applied Math., vol. 42 (1990). AMS.","journal-title":"Cryptology and Computational Number Theory \u2014 Proc. Symp. Applied Math."},{"key":"29_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-46885-4_35","volume-title":"Eurocrypt\u201989","author":"A.K. Lenstra","year":"1990","unstructured":"A.K. Lenstra, M.S. Manasse, \u201cFactoring by electronic mail\u201d, Eurocrypt\u201989. Springer-Verlag LNCS 434, pp.355\u2013371."},{"key":"29_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Crypto\u201994","author":"U.M. Maurer","year":"1994","unstructured":"U.M. Maurer, \u201cTowards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms\u201d. Crypto\u201994, Springer-Verlag LNCS 839. pp.271\u2013281."},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"U.M. Maurer","year":"1995","unstructured":"U.M. Maurer, \u201cFast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters\u201d, J. Cryptology, vol.8 no.3 (1995), 123\u2013156.","journal-title":"J. Cryptology"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"S.C. Pohlig, M.E. Hellman, \u201cAn improved algorithm for computing logarithms over GF(p) and its cryptographic significance\u201d, IEEE Trans. Information Theory, vol. IT-24, no.1 (Jan. 1978), pp.106\u2013110.","journal-title":"IEEE Trans. Information Theory"},{"issue":"143","key":"29_CR15","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"J.M. Pollard, \u201cMonte Carlo methods for index computation (mod p)\u201d, Math. Comp., vol.32 no.143 (July 1978) pp.918\u2013924.","journal-title":"Math. Comp."},{"issue":"2","key":"29_CR16","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, L. Adleman, \u201cA method for obtaining digital signatures and public key cryptosystems\u201d, C.ACM, vol.21 no.2 (Feb. 1978), pp.120\u2013126.","journal-title":"C.ACM"},{"issue":"7","key":"29_CR17","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/0140-3664(94)90100-7","volume":"17","author":"R. Rueppel","year":"1994","unstructured":"R. Rueppel, P.C. van Oorschot, \u201cModern key agreement techniques\u201d, Computer Communications, vol.17 no.7 (July 1994), pp.458\u2013465.","journal-title":"Computer Communications"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr, \u201cEfficient signature generation by smart cards\u201d, J. Cryptology vol.4 (1991), pp.161\u2013174.","journal-title":"J. Cryptology"},{"key":"29_CR19","volume-title":"Digital Signature Standard","author":"U.S. Department of Commerce \/ N.I.S.T.","year":"1994","unstructured":"U.S. Department of Commerce \/ N.I.S.T., Digital Signature Standard, FIPS 186, National Technical Information Service, Springfield, Virginia, May 1994."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"P.C. van Oorschot, M.J. Wiener, \u201cParallel collision search with application to hash functions and discrete logarithms\u201d, Proc. 2nd ACM Conference on Computer and Communications Security (Nov. 1994), Fairfax, VA, pp.210\u2013218.","DOI":"10.1145\/191177.191231"},{"issue":"3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M.J. Wiener","year":"1990","unstructured":"M.J. Wiener, \u201cCryptanalysis of short RSA secret exponents\u201d, IEEE Trans. on Info. Theory, vol.36 no.3 (May 1990), pp.553\u2013558.","journal-title":"IEEE Trans. on Info. Theory"},{"key":"29_CR22","series-title":"Lect Notes Comput Sci","first-page":"639","volume-title":"Crypto\u201990","author":"Y. Yacobi","year":"1991","unstructured":"Y. Yacobi, \u201cDiscrete-log with compressible exponents\u201d, Crypto\u201990, Springer-Verlag LNCS 537, pp.639\u2013643."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T16:48:43Z","timestamp":1550681323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}