{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:31:03Z","timestamp":1746595863805,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130385"},{"type":"electronic","value":"9783319130392"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13039-2_13","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:36:19Z","timestamp":1414179379000},"page":"219-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions"],"prefix":"10.1007","author":[{"given":"Inna","family":"Polak","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"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. 3152, 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":"RP Brent","year":"1980","unstructured":"Brent, R.P.: An improved monte carlo factorization algorithm. BIT Numerical Mathematics 20(2), 176\u2013184 (1980)","journal-title":"BIT Numerical Mathematics"},{"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. 1462, pp. 56\u201371. Springer, Heidelberg (1998)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TIT.2009.2039037","volume":"56","author":"DM Gordon","year":"2010","unstructured":"Gordon, D.M., Miller, V.S., Ostapenko, P.: Optimal hash functions for approximate matches on the-cube. IEEE Transactions on Information Theory 56(3), 984\u2013991 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR5","unstructured":"Shamir, A., Polak, I.: Using random error correcting codes in near-collision attacks on generic hash-functions. Cryptology ePrint Archive, Report 2014\/417 (2014). http:\/\/eprint.iacr.org\/2014\/417.pdf"},{"key":"13_CR6","series-title":"The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-0-387-35568-9_18","volume-title":"Secure Information Networks","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: Preneel, B. (ed.) Secure Information Networks. IFIP, vol. 23, pp. 258\u2013272. Springer, Boston (1999)"},{"key":"13_CR7","unstructured":"Knuth, D.E.: Seminumerical algorithm (arithmetic) the art of computer programming, vol. 2 (1981)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-011-9484-2","volume":"62","author":"M Lamberger","year":"2012","unstructured":"Lamberger, M., Mendel, F., Rijmen, V., Simoens, K.: Memoryless near-collisions via coding theory. Designs, Codes and Cryptography 62(1), 1\u201318 (2012)","journal-title":"Designs, Codes and Cryptography"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-19574-7_13","volume-title":"Selected Areas in Cryptography","author":"M Lamberger","year":"2011","unstructured":"Lamberger, M., Rijmen, V.: Optimal covering codes for finding near-collisions. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 187\u2013197. Springer, Heidelberg (2011)"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2012.11.004","volume":"113","author":"M Lamberger","year":"2013","unstructured":"Lamberger, M., Teufl, E.: Memoryless near-collisions, revisited. Information Processing Letters 113(3), 60\u201366 (2013)","journal-title":"Information Processing Letters"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-43933-3_11","volume-title":"Fast Software Encryption","author":"G Leurent","year":"2014","unstructured":"Leurent, G.: Time-memory trade-offs for near-collisions. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 205\u2013218. Springer, Heidelberg (2014)"},{"key":"13_CR12","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, vol. 16. Elsevier (1977)"},{"key":"13_CR13","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. 5735, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"13_CR14","first-page":"2012","volume":"1","author":"S Nakamoto","year":"2008","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Consulted 1, 2012 (2008)","journal-title":"Consulted"},{"issue":"3","key":"13_CR15","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. Information Processing Letters 90(3), 135\u2013140 (2004)","journal-title":"Information Processing Letters"},{"key":"13_CR16","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. 3796, pp. 78\u201395. Springer, Heidelberg (2005)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/0-387-34805-0_38","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J-J Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search. new results and applications to des. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408\u2013413. Springer, Heidelberg (1990)"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0211030","volume":"11","author":"R Sedgewick","year":"1982","unstructured":"Sedgewick, R., Szymanski, T.G., Yao, A.C.: The complexity of finding cycles in periodic functions. SIAM Journal on Computing 11(2), 376\u2013390 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-03356-8_4","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M Stevens","year":"2009","unstructured":"Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D.A., de Weger, B.: Short chosen-prefix collisions for md5 and the creation of a rogue CA certificate. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 55\u201369. Springer, Heidelberg (2009)"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Van Oorschot","year":"1999","unstructured":"Van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. Journal of Cryptology 12(1), 1\u201328 (1999)","journal-title":"Journal of Cryptology"},{"key":"13_CR21","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. 3494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"issue":"3","key":"13_CR22","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 3(3), 187\u2013191 (1979)","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- INDOCRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13039-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:28:47Z","timestamp":1675348127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13039-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130385","9783319130392"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13039-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}