{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:41:05Z","timestamp":1694634065163},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1109\/tit.2008.2008129","type":"journal-article","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T16:07:06Z","timestamp":1231171626000},"page":"33-45","source":"Crossref","is-referenced-by-count":3,"title":["Provably Good Codes for Hash Function Design"],"prefix":"10.1109","volume":"55","author":[{"given":"Charanjit S.","family":"Jutla","sequence":"first","affiliation":[]},{"given":"Anindya C.","family":"Patthak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","volume":"4047","author":"mendel","year":"2006","journal-title":"Fast Software Encryption (Lecture Notes in Computer Science)"},{"key":"ref32","first-page":"123","article-title":"analysis of simplified variants of sha-256","volume":"p 74 of lni","author":"matusiewicz","year":"2005","journal-title":"Western European Workshop on Research in Cryptology WEWoRC"},{"key":"ref31","author":"zierler","year":"1958","journal-title":"On a Variation of the First-Order Reed-Muller Codes"},{"key":"ref30","author":"rivest","year":"1992","journal-title":"RFC1321 The md5 message-digest algorithm"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"ref34","volume":"3796","author":"pramstaller","year":"2005","journal-title":"Cryptography and Coding Proc 10th IMA Int Conf (Lecture Notes in Computer Ecience)"},{"key":"ref10","volume":"2643","author":"lally","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"ref11","first-page":"33","article-title":"new lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes","volume":"28","author":"chepyzhov","year":"1992","journal-title":"Probl Inf Transm"},{"key":"ref12","volume":"3152","author":"biham","year":"2004","journal-title":"CRYPTO 96 Lecture Notes in Computer Science"},{"key":"ref13","article-title":"new results on sha-0 and sha-1 (short talk)","author":"biham","year":"2004","journal-title":"CRYPTO'04 Rump Session"},{"key":"ref14","first-page":"164","article-title":"finding good differential patterns for attacks on sha-1","author":"matusiewicz","year":"2005","journal-title":"Proc Int Workshop on Coding and Cryptography"},{"key":"ref15","volume":"3621","author":"wang","year":"2005","journal-title":"CRYPTO 96 Lecture Notes in Computer Science"},{"key":"ref16","volume":"3621","author":"wang","year":"2005","journal-title":"CRYPTO 96 Lecture Notes in Computer Science"},{"key":"ref17","article-title":"rfc1321: the md5 message-digest algorithm","author":"rivest","year":"1992","journal-title":"Internet Activities Board"},{"key":"ref18","article-title":"collisions for hash functions md4, md5, haval-128 and ripemd (short talk)","author":"wang","year":"2004","journal-title":"CRYPTO'04 Rump Session"},{"key":"ref19","article-title":"new collision search for sha-1 (short talk)","author":"wang","year":"2005","journal-title":"CRYPTO'05 Rump Session"},{"key":"ref28","volume":"4356","author":"jutla","year":"2006","journal-title":"Selected Areas in Cryptography (Lecture Notes in Computer Science)"},{"key":"ref4","volume":"1462","author":"chabaud","year":"1998","journal-title":"CRYPTO 96 Lecture Notes in Computer Science"},{"key":"ref27","author":"jutla","year":"2005","journal-title":"?Is SHA-1 conceptually sound? ?"},{"key":"ref3","year":"2002","journal-title":"Secure Hash Standard"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053974"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054127"},{"key":"ref5","volume":"3376","author":"rijmen","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850142"},{"key":"ref2","year":"1995","journal-title":"Secure Hash Standard"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"ref1","year":"1993","journal-title":"Secure Hash Standard"},{"key":"ref20","author":"wang","year":"1997","journal-title":"The Improved Collision Attack on SHA-0 (In Chinese)"},{"key":"ref22","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref21","author":"wang","year":"1997","journal-title":"The Collision Attack on SHA-0"},{"key":"ref24","author":"peterson","year":"1972","journal-title":"Error Correcting Codes"},{"key":"ref23","author":"van lint","year":"1998","journal-title":"Introduction to Coding Theory"},{"key":"ref26","author":"jutla","year":"2005","journal-title":"?A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code ?"},{"key":"ref25","article-title":"a simple and provably good code for sha message expansion","author":"jutla","year":"2005","journal-title":"NIST Cryptographic Hash Workshop"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4729739\/04729745.pdf?arnumber=4729745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:47:25Z","timestamp":1638200845000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4729745\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":35,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2008129","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}