{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:38:20Z","timestamp":1725457100877},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607595"},{"type":"electronic","value":"9783540493631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0032355","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:40:51Z","timestamp":1134283251000},"page":"156-164","source":"Crossref","is-referenced-by-count":1,"title":["Multiple encryption with minimum key"],"prefix":"10.1007","author":[{"given":"Ivan B.","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars Ramkilde","family":"Knudsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing, pages 856\u2013864, 1984.","DOI":"10.1137\/0213053"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/214438.214442","volume":"3","author":"S. Even","year":"1985","unstructured":"S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. on Computer Systems, 3:108\u2013116, 1985.","journal-title":"ACM Trans. on Computer Systems"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Matsui. Linear cryptanalysis method for DES cipher. In T. Helleseth, editor, Advances in Cryptology \u2014 Proc. Eurocrypt'93, LNCS 765, pages 386\u2013397. Springer Verlag, 1993.","DOI":"10.1007\/3-540-48285-7_33"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Y. G. Desmedt, editor, Advances in Cryptology \u2014 Proc. Crypto'94, LNCS 839, pages 1\u201311. Springer Verlag, 1994.","DOI":"10.1007\/3-540-48658-5_1"},{"issue":"1","key":"13_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02620231","volume":"6","author":"U. Maurer","year":"1993","unstructured":"U. Maurer and J.L. Massey. Cascade ciphers: The importance of being first. Journal of Cryptology, 6(1):55\u201361, 1993.","journal-title":"Journal of Cryptology"},{"issue":"7","key":"13_CR6","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/358699.358718","volume":"24","author":"R. Merkle","year":"1981","unstructured":"R. Merkle and M. Hellman. On the security of multiple encryption. Communications of the ACM, 24(7):465\u2013467, 1981.","journal-title":"Communications of the ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"J.-J. Quisquater and J.-P. Delescaille. How easy is collision search. New results and applications to DES. In G. Brassard, editor, Advances in Cryptology \u2014 Proc. Crypto'89, LNCS 435, pages 408\u2013413. Springer Verlag, 1990.","DOI":"10.1007\/0-387-34805-0_38"},{"issue":"7","key":"13_CR8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MSPEC.1979.6368160","volume":"16","author":"W. Tuchman","year":"1979","unstructured":"W. Tuchman. Hellman presents no shortcut solutions to DES. IEEE Spectrum, 16(7):40\u201341, July 1979.","journal-title":"IEEE Spectrum"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"P.C. van Oorschot and M.J. Wiener. A known-plaintext attack on two-key triple encryption. In I.B. Damg\u00e5rd, editor, Advances in Cryptology \u2014 Proc. Eurocrypt'90, LNCS 473, pages 318\u2013325. Springer Verlag, 1990.","DOI":"10.1007\/3-540-46877-3_29"},{"key":"13_CR10","volume-title":"Technical Report TR-244","author":"M.J. Wiener","year":"1994","unstructured":"M.J. Wiener. Efficient DES key search. Technical Report TR-244, School of Computer Science, Carleton University, Ottawa, Canada, May 1994. Presented at the Rump Session of Crypto'93."}],"container-title":["Lecture Notes in Computer Science","Cryptography: Policy and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:48:11Z","timestamp":1586612891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607595","9783540493631"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0032355","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}