{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:45:24Z","timestamp":1753875924584,"version":"3.41.2"},"reference-count":21,"publisher":"Oxford University Press (OUP)","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["Q20F020063"],"award-info":[{"award-number":["Q20F020063"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Science and Technology on Communication Security Laboratory","award":["6142103190105"],"award-info":[{"award-number":["6142103190105"]}]},{"name":"Key Research Project of Zhejiang Province","award":["2017C01062"],"award-info":[{"award-number":["2017C01062"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072181"],"award-info":[{"award-number":["62072181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Cryptography Development Fund","award":["MMJJ20180201"],"award-info":[{"award-number":["MMJJ20180201"]}]},{"name":"International Science and Technology Cooperation Projects","award":["61961146004"],"award-info":[{"award-number":["61961146004"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Counter-cryptanalysis uses cryptanalytic techniques to detect cryptanalytic attacks. It was introduced by Stevens with a collision detection algorithm that detects whether a message is one of a colliding message pair constructed using a collision attack. Later, Stevens and Shumow improved the collision detection against SHA-1 by using unavoidable conditions. However, there are no results improving collision detection against MD5 due to its weak diffusion properties. In this paper, an improved collision detection algorithm against MD5 is proposed by using the 14-bit sufficient condition combinations. This leads to the dividing the 223 classes into four sets. Each element, belonging to the first two sets, holds the same sufficient condition combination. Our new algorithm can classify 126 classes efficiently. The runtime is 28.6% of the previous collision detection method.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab109","type":"journal-article","created":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T11:08:37Z","timestamp":1626260917000},"source":"Crossref","is-referenced-by-count":2,"title":["Improved Collision Detection Of MD5 Using Sufficient Condition Combination"],"prefix":"10.1093","author":[{"given":"Yanzhao","family":"Shen","sequence":"first","affiliation":[{"name":"School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Ting","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Cyberspace, Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Gaoli","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China"},{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China"}]},{"given":"Xinfeng","family":"Dong","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China"}]}],"member":"286","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"2021080413501267300_ref1","first-page":"416","volume-title":"Proceedings of the conference on the Theory and Applications of Cryptology","author":"Damg\u00e5rd","year":"1989"},{"key":"2021080413501267300_ref2","first-page":"428","volume-title":"Proceedings of the conference on the Theory and Applications of Cryptology","author":"Merkle","year":"1989"},{"volume-title":"Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD","author":"Wang","key":"2021080413501267300_ref3"},{"key":"2021080413501267300_ref4","first-page":"19","volume-title":"Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Wang","year":"2005"},{"key":"2021080413501267300_ref5","first-page":"1","volume-title":"Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Stevens","year":"2007"},{"key":"2021080413501267300_ref6","first-page":"55","volume-title":"Proceedings of the 29th Annual Cryptology Conference","author":"Stevens","year":"2009"},{"volume-title":"sKyWIper (a.k.a. Flame a.k.a. Flamer): A complex malware for targeted attacks","author":"Bencs\u00e1th","key":"2021080413501267300_ref7"},{"volume-title":"The Flame: Questions and Answers","author":"Lab","key":"2021080413501267300_ref8"},{"volume-title":"Israel developed Flame computer virus to slow Iranian nuclear efforts","author":"Nakashima","key":"2021080413501267300_ref9"},{"key":"2021080413501267300_ref10","first-page":"129","volume-title":"Proceedings of the 33rd Annual Cryptology Conference","author":"Stevens","year":"2013"},{"key":"2021080413501267300_ref11","first-page":"586","volume-title":"Proceedings of the 33rd International Conference on the Theory and Application of Cryptology and Information Security","author":"Fillinger","year":"2015"},{"volume-title":"Attacks on hash functions and applications","year":"2012","author":"Stevens","key":"2021080413501267300_ref12"},{"key":"2021080413501267300_ref13","first-page":"881","volume-title":"Proceedings of the 26th USENIX Security Symposium","author":"Stevens","year":"2017"},{"volume-title":"Oracle to Java devs: Stop signing JAR files with MD5","author":"InfoWorld","key":"2021080413501267300_ref14"},{"year":"1992","author":"RFC Editor.","key":"2021080413501267300_ref15"},{"key":"2021080413501267300_ref16","first-page":"293","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques","author":"Boer","year":"1993"},{"volume-title":"Construct MD5 collisions using just a single block of message","author":"Xie","key":"2021080413501267300_ref17"},{"volume-title":"A new collision differential for MD5 with its full differential path","author":"Xie","key":"2021080413501267300_ref18"},{"volume-title":"Could the 1-MSB input difference be the fastest collision attack for MD5?","author":"Xie","key":"2021080413501267300_ref19"},{"key":"2021080413501267300_ref20","first-page":"78","volume-title":"Proceedings of the 9th International Conference on Cryptology in India","author":"V\u00e1bek","year":"2008"},{"volume-title":"How to find weak input differences for MD5 collision attacks","author":"Xie","key":"2021080413501267300_ref21"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxab109\/39556793\/bxab109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxab109\/39556793\/bxab109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T13:51:10Z","timestamp":1628085070000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/advance-article\/doi\/10.1093\/comjnl\/bxab109\/6334047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab109","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"article-number":"bxab109"}}