{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:21:52Z","timestamp":1725578512058},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195730"},{"type":"electronic","value":"9783642195747"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19574-7_13","type":"book-chapter","created":{"date-parts":[[2011,3,3]],"date-time":"2011-03-03T23:04:06Z","timestamp":1299193446000},"page":"187-197","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Covering Codes for Finding Near-Collisions"],"prefix":"10.1007","author":[{"given":"Mario","family":"Lamberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Rijmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-28628-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E. Biham","year":"2004","unstructured":"Biham, E., Chen, R.: Near-Collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 290\u2013305. Springer, Heidelberg (2004)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R.P. Brent","year":"1980","unstructured":"Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT\u00a020(2), 176\u2013184 (1980)","journal-title":"BIT"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/BFb0055720","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"F. Chabaud","year":"1998","unstructured":"Chabaud, F., Joux, A.: Differential Collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 56\u201371. Springer, Heidelberg (1998)"},{"key":"13_CR4","series-title":"North-Holland Mathematical Library","volume-title":"Covering codes","author":"G. Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. North-Holland Mathematical Library, vol.\u00a054. North-Holland Publishing Co., Amsterdam (1997)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-77360-3_4","volume-title":"Selected Areas in Cryptography","author":"C. Canni\u00e8re De","year":"2007","unstructured":"De Canni\u00e8re, C., Mendel, F., Rechberger, C.: Collisions for 70-Step SHA-1: On the Full Cost of Collision Search. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 56\u201373. Springer, Heidelberg (2007)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11935230_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"C. De Canni\u00e8re","year":"2006","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Finding SHA-1 Characteristics: General Results and Applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 1\u201320. Springer, Heidelberg (2006)"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s001459900047","volume":"11","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. J. Cryptology\u00a011(4), 253\u2013271 (1998)","journal-title":"J. Cryptology"},{"key":"13_CR8","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An introduction to probability theory and its applications, 3rd edn., vol.\u00a0I. John Wiley & Sons Inc., New York (1968)","edition":"3"},{"unstructured":"K\u00e9ri, G.: Tables for bounds on covering codes, \n                    \n                      http:\/\/www.sztaki.hu\/~keri\/codes\/\n                    \n                    \n                   (accessed May 17, 2010)","key":"13_CR9"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TIT.2009.2039037","volume":"56","author":"D. Gordon","year":"2010","unstructured":"Gordon, D., Miller, V., Ostapenko, P.: Optimal hash functions for approximate matches on the n-cube. IEEE Trans. Inform. Theory\u00a056(3), 984\u2013991 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. IEEE Trans. Inform. Theory\u00a031(3), 385\u2013401 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR12","series-title":"Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming. Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing, vol.\u00a02. Addison-Wesley Publishing Co., Reading (1997)"},{"unstructured":"Lamberger, M., Mendel, F., Rijmen, V., Simoens, K.: Memoryless Near-Collisions via Coding Theory (December 2009), \n                    \n                      http:\/\/asiacrypt2009.cipher.risk.tsukuba.ac.jp\/rump\/slides\/13_NC-talk.pdf\n                    \n                    \n                  , (short talk) presented at the ASIACRYPT 2009 rump session","key":"13_CR13"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-04474-8_8","volume-title":"Information Security","author":"F. Mendel","year":"2009","unstructured":"Mendel, F., Schl\u00e4ffer, M.: On Free-Start Collisions and Collisions for TIB3. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol.\u00a05735, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"unstructured":"National Institute of Standards and Technology (NIST). Cryptographic Hash Project (2007), \n                    \n                      http:\/\/www.nist.gov\/hash-competition","key":"13_CR16"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ipl.2004.01.016","volume":"90","author":"G. Nivasch","year":"2004","unstructured":"Nivasch, G.: Cycle detection using a stack. Inf. Process. Lett.\u00a090(3), 135\u2013140 (2004)","journal-title":"Inf. Process. Lett."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11586821_7","volume-title":"Cryptography and Coding","author":"N. Pramstaller","year":"2005","unstructured":"Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting Coding Theory for Collision Attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 78\u201395. Springer, Heidelberg (2005)"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/18.335936","volume":"40","author":"R. Struik","year":"1994","unstructured":"Struik, R.: An improvement of the Van Wee bound for binary linear covering codes. IEEE Transactions on Information Theory\u00a040(4), 1280\u20131284 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"13_CR20","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. J. Cryptology\u00a012(1), 1\u201328 (1999)","journal-title":"J. Cryptology"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1109\/18.2632","volume":"34","author":"G.J.M. Wee van","year":"1988","unstructured":"van Wee, G.J.M.: Improved sphere bounds on the covering radius of codes. IEEE Transactions on Information Theory\u00a034(2), 237\u2013245 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"issue":"3","key":"13_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/0161-117991854025","volume":"3","author":"G. Yuval","year":"1979","unstructured":"Yuval, G.: How to swindle Rabin? Cryptologia\u00a03(3), 187\u2013191 (1979)","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19574-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T05:45:26Z","timestamp":1558417526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19574-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195730","9783642195747"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19574-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}