{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T02:28:13Z","timestamp":1687487293331},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,13]],"date-time":"2011-02-13T00:00:00Z","timestamp":1297555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10623-011-9484-2","type":"journal-article","created":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T02:46:17Z","timestamp":1297478777000},"page":"1-18","source":"Crossref","is-referenced-by-count":6,"title":["Memoryless near-collisions via coding theory"],"prefix":"10.1007","volume":"62","author":[{"given":"Mario","family":"Lamberger","sequence":"first","affiliation":[]},{"given":"Florian","family":"Mendel","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Rijmen","sequence":"additional","affiliation":[]},{"given":"Koen","family":"Simoens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,13]]},"reference":[{"issue":"9","key":"9484_CR1","doi-asserted-by":"crossref","first-page":"2568","DOI":"10.1109\/TIT.2002.800480","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg A., Forney G.D. Jr.: Random codes: minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9), 2568\u20132573 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9484_CR2","doi-asserted-by":"crossref","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 20(2), 176\u2013184 (1980)","journal-title":"BIT"},{"key":"9484_CR3","first-page":"264","volume-title":"CRYPTO, Lecture Notes in Computer Science, vol. 4622","author":"R. Canetti","year":"2007","unstructured":"Canetti R., Rivest R.L., Sudan M., Trevisan L., Vadhan S.P., Wee H.: Amplifying collision resistance: a complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 4622, pp. 264\u2013283. Springer, Heidelberg (2007)"},{"key":"9484_CR4","volume-title":"Covering codes, vol. 54 of North-Holland Mathematical Library","author":"G. Cohen","year":"1997","unstructured":"Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering codes, vol. 54 of North-Holland Mathematical Library. North-Holland Publishing Co., Amsterdam (1997)"},{"key":"9484_CR5","unstructured":"Cohen H., Frey G., Avanzi R., Doche C., Lange T., Nguyen K., Vercauteren F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall\/CRC, Boca Raton, FL (2006)."},{"key":"9484_CR6","first-page":"416","volume-title":"CRYPTO, Lecture Notes in Computer Science, vol. 435","author":"I. Damg\u00e5rd","year":"1989","unstructured":"Damg\u00e5rd I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 435, pp. 416\u2013427. Springer, Heidelberg (1989)"},{"key":"9484_CR7","first-page":"293","volume-title":"EUROCRYPT, Lecture Notes in Computer Science, vol. 765","author":"B. den Boer","year":"1993","unstructured":"den Boer B., Bosselaers A.: Collisions for the compression function of MD5. In: Goos, G., Hartmanis, J. (eds) EUROCRYPT, Lecture Notes in Computer Science, vol. 765, pp. 293\u2013304. Springer, Heidelberg (1993)"},{"issue":"3","key":"9484_CR8","doi-asserted-by":"crossref","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 56(3), 984\u2013991 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"9484_CR9","doi-asserted-by":"crossref","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 31(3), 385\u2013401 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9484_CR10","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1214\/aoms\/1177705677","volume":"31","author":"B. Harris","year":"1960","unstructured":"Harris B.: Probability distributions related to random mappings. Ann. Math. Stat. 31, 1045\u20131062 (1960)","journal-title":"Ann. Math. Stat."},{"key":"9484_CR11","unstructured":"K\u00e9ri G.: Tables for bounds on covering codes. http:\/\/www.sztaki.hu\/~keri\/codes\/ . Accessed 17 May 2010."},{"key":"9484_CR12","unstructured":"Knuth D.E.: The art of computer programming. Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing, vol. 2, third edn. Addison-Wesley Publishing Co., Reading, MA, (1997)."},{"issue":"10A","key":"9484_CR13","first-page":"5658","volume":"27","author":"S.M. Matyas","year":"1985","unstructured":"Matyas S.M., Meyer C.H., Oseas J.: Generating strong one-way functions with crypographic algorithm. IBM Tech. Discl. Bull. 27(10A), 5658\u20135659 (1985)","journal-title":"IBM Tech. Discl. Bull."},{"key":"9484_CR14","unstructured":"Mendel F., Schl\u00e4ffer M.: On free-start collisions and collisions for TIB3. In: Samarati P., Yung M., Martinelli F., Ardagna C.A. (ed) ISC, Lecture Notes in Computer Science, vol. 5735, pp. 95\u2013106. Springer, Heidelberg (2009)."},{"key":"9484_CR15","doi-asserted-by":"crossref","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)"},{"key":"9484_CR16","unstructured":"Merkle R.C.: One way hash functions and DES. In: Brassard G. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 435, pp. 428\u2013446. Springer, Heidelberg (1989)."},{"key":"9484_CR17","unstructured":"Montes M., Penazzi D.: The TIB3 Hash. Submission to NIST (2008)."},{"key":"9484_CR18","unstructured":"National Institute of Standards and Technology (NIST): FIPS-180-2: Secure Hash Standard. http:\/\/www.itl.nist.gov\/fipspubs\/ (2002)."},{"key":"9484_CR19","unstructured":"National Institute of Standards and Technology (NIST): Cryptographic Hash Project. http:\/\/www.nist.gov\/hash-competition (2007)."},{"issue":"3","key":"9484_CR20","doi-asserted-by":"crossref","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. 90(3), 135\u2013140 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9484_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032749","volume-title":"Introduction to the theory of error-correcting codes. Wiley-Interscience Series in Discrete Mathematics and Optimization, third edn","author":"V. Pless","year":"1998","unstructured":"Pless V.: Introduction to the theory of error-correcting codes. Wiley-Interscience Series in Discrete Mathematics and Optimization, third edn. Wiley, New York (1998)"},{"issue":"143","key":"9484_CR22","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comp."},{"key":"9484_CR23","unstructured":"Quisquater J.-J., Delescaille J.-P.: How easy is collision search. new results and applications to DES. In: Brassard G. (ed.) CRYPTO Lecture Notes in Computer Science, vol. 435, pp. 408\u2013413. Springer, Heidelberg (1989)."},{"key":"9484_CR24","doi-asserted-by":"crossref","unstructured":"Rivest R.: RFC1321\u2014The MD5 Message-Digest Algorithm (1992).","DOI":"10.17487\/rfc1321"},{"issue":"4","key":"9484_CR25","doi-asserted-by":"crossref","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 Trans. Inform. Theory 40(4), 1280\u20131284 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9484_CR26","unstructured":"van Oorschot P.C., Wiener M.J.: Improving implementable meet-in-the-middle attacks by orders of magnitude. In: Koblitz N. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 1109, pp. 229\u2013236. Springer, Heidelberg (1996)."},{"issue":"1","key":"9484_CR27","doi-asserted-by":"crossref","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. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"issue":"2","key":"9484_CR28","doi-asserted-by":"crossref","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 Trans. Inform. Theory 34(2), 237\u2013245 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9484_CR29","first-page":"19","volume-title":"EUROCRYPT, Lecture Notes in Computer Science, vol. 3494","author":"X. Wang","year":"2005","unstructured":"Wang X., Yu H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT, Lecture Notes in Computer Science, vol. 3494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"9484_CR30","first-page":"17","volume-title":"CRYPTO, Lecture Notes in Computer Science, vol. 3621","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, Lecture Notes in Computer Science, vol. 3621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"issue":"3","key":"9484_CR31","doi-asserted-by":"crossref","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9484-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9484-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9484-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T14:22:36Z","timestamp":1560003756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9484-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,13]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9484"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9484-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,13]]}}}