{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:25Z","timestamp":1767339925713},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611868"},{"type":"electronic","value":"9783540683391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_27","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"307-320","source":"Crossref","is-referenced-by-count":55,"title":["Foiling Birthday Attacks in Length-Doubling Transformations"],"prefix":"10.1007","author":[{"given":"William","family":"Aiello","sequence":"first","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"27_CR1","unstructured":"M. Bellare, R. Canetti, and H. Krawcyk, \u201cKeying MD5 \u2014 Message Authentication via Iterated Pseudorandomness,\u201d manuscript."},{"key":"27_CR2","unstructured":"M. Bellare, J. Kilian, and P. Rogaway, \u201cThe Security of Cipher Block Chaining,\u201d Advances in Cryptology-Crypto\u2019 94, Springer Verlag (1994)."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer Verlag (1993).","DOI":"10.1007\/978-1-4613-9314-6"},{"key":"27_CR4","unstructured":"E. Biham and A. Shamir, \u201cDifferential Cryptanalysis of Snefru, Khafre, REDOC II, LOKI, Lucifer,\u201d Advances in Cryptology Crypto\u2019 91, Springer Verlag (1992)."},{"key":"27_CR5","unstructured":"E. Biham and A. Shamir, \u201cDifferential Cryptanalysis of Feal and N-hash\u201d, Advances in Cryptology Eurocrypt\u2019 91, Springer Verlag (1991)."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u201cHow to Generate Cryptographically Strong Sequences of Pseudorandom Bits,\u201d SIAM Journal on Computing, 13 pp. 850\u2013864 (1984).","journal-title":"SIAM Journal on Computing"},{"key":"27_CR7","unstructured":"D. Coppersmith, \u201cAnother Birthday Attack,\u201d Advances in Cryptology-Crypto\u2019 85, Springer Verlag (1986)."},{"key":"27_CR8","unstructured":"I. Damgard, \u201cA Design Principle for Hash Functions,\u201d Advances in Cryptology-Crypto\u2019 89, Springer Verlag (1989)."},{"key":"27_CR9","unstructured":"D. Davies and W. Price, Security for Computer Networks (2e), John Wiley (1989)."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"H. Dobbertin, \u201cCryptanalysis of MD4,\u201d To appear at the Fast Software Encryption Workshop, February, 1996.","DOI":"10.1007\/3-540-60865-6_43"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, \u201cHow To Construct Random Functions,\u201d JACM, 33,4, pp. 792\u2013807 (1986).","journal-title":"JACM"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, \u201cPseudorandom Generation From One-Way Functions,\u201d Proc. ACM Symp. on Theory of Computing, (1989); \u201cPseudorandom Generators Under Uniform Assumptions,\u201d Proc. of the ACM Symp. on Theory of Computing (1990)","DOI":"10.1145\/73007.73009"},{"key":"27_CR13","unstructured":"S. Langford and M. Hellman, \u201cDifferential-Linear Cryptanalysis,\u201d Advances in Cryptology-Crypto\u2019 94, Springer Verlag (1994)."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"L. Levin, \u201cOne-Way Functions and Pseudo-Random Generators,\u201d Proc. of the ACM Symp. on Theory of Computing (1985).","DOI":"10.1145\/22145.22185"},{"key":"27_CR15","unstructured":"M. Luby, Pseudorandomness And Its Cryptographic Applications, Princeton Univ. Press, to appear."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, \u201cHow to Construct Pseudorandom Permutations from Pseudorandom Functions,\u201d SIAM Journal on Computing, 17, 373\u2013386 (1988).","journal-title":"SIAM Journal on Computing"},{"key":"27_CR17","unstructured":"U. Maurer, \u201cA Simplified and Generalized Treatment of Luby-Rackoff Pseudo-Random Permutation Generators,\u201d Advances in Cryptology-Eurocrypt\u2019 92, Springer Verlag (1992)."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"M. Matsui, \u201cThe First Experimental Cryptanalysis of the Data Encryption Standard,\u201d Advances in Cryptology-Crypto\u2019 94, Springer Verlag (1994).","DOI":"10.1007\/3-540-48658-5_1"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF00203968","volume":"3","author":"R. Merkle","year":"1990","unstructured":"R. Merkle, \u201cA Fast in Software One-Way Hash Function,\u201d Journal of Cryptology, 3,1, pp. 43\u201358 (1990).","journal-title":"Journal of Cryptology"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"R. Merkle, \u201cOne-Way Hash Functions and DES,\u201d Advances in Cryptology-Crypto\u2019 89, Springer Verlag (1989).","DOI":"10.1007\/0-387-34805-0_40"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"P. van Oorschot and M. Wiener, \u201cParallel Collision Search with Application to Hash Functions and Discrete Logarithms,\u201d Proc. of the 2nd ACM Conf. on Computer and Communications Security, (1994).","DOI":"10.1145\/191177.191231"},{"key":"27_CR22","unstructured":"B. Prencel, Analysis and Design of Cryptographic Hash Functions, Ph.D Thesis, Katholieke Universiteit Leuven (1993)."},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"B. Preneel, and P. van Oorschot, \u201cMDx-MAC and Building Fast MACs from Hash Functions,\u201d Advances in Cryptology-Crypto\u2019 95, Springer Verlag (1995).","DOI":"10.1007\/3-540-44750-4_1"},{"key":"27_CR24","unstructured":"V. Shoup, personal communication (1995)."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"A. Wyner, \u201cThe Wire-Tap Channel,\u201d Bell System Technical Journal, 54 (1975).","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cTheory and Applications of Trapdoor Functions,\u201d Proc. of the IEEE Symp. on Foundations of Computer Science, (1982).","DOI":"10.1109\/SFCS.1982.45"},{"key":"27_CR27","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai, \u201cOn the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses,\u201d Advances in Cryptology-Crypto\u2019 89 (1989)."}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T12:54:42Z","timestamp":1587819282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}