{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:46:31Z","timestamp":1770504391593,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540669678","type":"print"},{"value":"9783540465881","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/978-3-540-46588-1_30","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T21:55:48Z","timestamp":1294350948000},"page":"446-465","source":"Crossref","is-referenced-by-count":89,"title":["Selecting Cryptographic Key Sizes"],"prefix":"10.1007","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[]},{"given":"Eric R.","family":"Verheul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Biham, E.: A fast new DES implementation in software"},{"key":"30_CR2","unstructured":"Blaze, M., Diffie, W., Rivest, R.L., Schneier, B., Shimomura, T., Thompson, E., Wiener, M.: Minimal key lengths for symmetric ciphers to provide adequate commercial security (January 1996), http:\/\/www.bsa.org\/policy\/encryption\/cryptographers_c.html"},{"key":"30_CR3","unstructured":"Bosselaers, A.: Even faster hashing on the Pentium, Katholieke Universiteit Leuven, May 13 (1997) (manuscript)"},{"key":"30_CR4","unstructured":"Brazier, J.R.T.: Possible NSA decryption capabilities, http:\/\/jya.com\/nsastudy.htm"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Murphy, B., Montgomery, P.L., te Riele, H.J.J., et al.: Factorization of a 512-bit RSA modulus (October 1999) (manuscript)","DOI":"10.1007\/3-540-45539-6_1"},{"key":"30_CR6","unstructured":"http:\/\/www.counterpane.com\/speed.html"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-39568-7_14","volume-title":"Advances in Cryptology","author":"M. Davio","year":"1985","unstructured":"Davio, M., Desmedt, Y., Goubert, J., Hoornaert, F., Quisquater, J.J.: Efficient hardware and software implementations of the DES. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 144\u2013146. Springer, Heidelberg (1985)"},{"key":"30_CR8","unstructured":"Diffie, W.: BNR Inc. report (1980)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W. Diffie","year":"1977","unstructured":"Diffie, W., Hellman, E.: Exhaustive cryptanalysis of the NBS Data Encryption Standard. Computer\u00a010, 74\u201384 (1977)","journal-title":"Computer"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-48285-7_3","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"B. Dixon","year":"1994","unstructured":"Dixon, B., Lenstra, A.K.: Factoring integers using SIMD sieves. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 28\u201339. Springer, Heidelberg (1994)"},{"key":"30_CR11","unstructured":"Electronic Frontier Foundation, Cracking DES. O\u2019Reilly, Sebastopol (July 1998)"},{"key":"30_CR12","unstructured":"Gallant, R.: Personal communication (August 1999)"},{"key":"30_CR13","unstructured":"Kocher, P.C.: Breaking DES, RSA Laboratories. Cryptobytes\u00a05(2) (1999); Also at www.rsa.com\/rsalabs\/pubs\/cryptobytes"},{"key":"30_CR14","unstructured":"Kocher, P.C.: Personal communication (September 1999)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting Cryptographic Key Sizes (September 1999) (submitted for publication), available at http:\/\/www.cryptosavvy.nl","DOI":"10.1007\/978-3-540-46588-1_30"},{"key":"30_CR16","unstructured":"Menezes, A.J.: Personal communication (September 1999)"},{"key":"30_CR17","unstructured":"Montgomery, P.L.: Letter to the editor of IEEE Computer (August 1999)"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes\u00a055(2), 155\u2013172 (1994); Translated from Matematicheskie Zametki 55(2), 91-101 (1994) This result dates back from 1968","journal-title":"Mathematical Notes"},{"key":"#cr-split#-30_CR19.1","unstructured":"Tiniest circuits hold prospect of explosive computer speeds, The New York Times, July 16 (1999)"},{"key":"#cr-split#-30_CR19.2","unstructured":"Chip designers look for life after silicon, The New York Times, July 19 (1999)"},{"issue":"2","key":"30_CR20","first-page":"5","volume":"1","author":"A.M. Odlyzko","year":"1995","unstructured":"Odlyzko, A.M.: The future of integer factorization. RSA Laboratories Cryptobyte\u00a01(2), 5\u201312 (1995), www.research.att.com\/~amo\/doc\/crypto.html or www.rsa.com\/rsalabs\/pubs\/cryptobytes","journal-title":"RSA Laboratories Cryptobyte"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computing: discrete logarithms and factoring. In: Proceedings of the IEEE 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"30_CR23","unstructured":"Silverman, R.D.: Rump session presentation at Crypto 1997 (1997)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Silverman, R.D.: Exposing the Mythical MIPS Year. IEEE Computer, 22\u201326 (August 1999)","DOI":"10.1109\/2.781630"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. Journal of Cryptology\u00a012, 1\u201328 (1999)","journal-title":"Journal of Cryptology"},{"key":"30_CR26","unstructured":"Wiener, M.J.: Efficient DES key search, Bell-Northern Research, August 20 (1993) (manuscript)"},{"key":"30_CR27","unstructured":"Wiener, M.J.: Performance Comparison of Public-Key Cryptosystems. RSA Laboratories Cryptobytes 4(1), 1\u20135 (1998), also at http:\/\/www.rsa.com\/rsalabs\/pubs\/cryptobytes"},{"key":"30_CR28","unstructured":"Wiener, M.J.: Personal communication (1999)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46588-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T13:36:33Z","timestamp":1740836193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46588-1_30"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540669678","9783540465881"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46588-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}