{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:18:17Z","timestamp":1725491897678},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744610"},{"type":"electronic","value":"9783540744627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74462-7_26","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T02:37:28Z","timestamp":1189651048000},"page":"376-393","source":"Crossref","is-referenced-by-count":2,"title":["Provably Good Codes for Hash Function Design"],"prefix":"10.1007","author":[{"given":"Charanjit S.","family":"Jutla","sequence":"first","affiliation":[]},{"given":"Anindya C.","family":"Patthak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2004)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E. Biham","year":"2004","unstructured":"Biham, E., Chen, R.: New results on SHA-0 and SHA-1. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, Springer, Heidelberg (2004)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1998)"},{"key":"26_CR4","unstructured":"Chepyzhov, V.V.: New lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes. Problems of information Transmission\u00a028(1) (1992)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Transaction on Information Theory\u00a049(1) (2003)","DOI":"10.1109\/TIT.2002.806118"},{"key":"26_CR6","unstructured":"Jutla, C.S., Patthak, A.C.: A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. Cryptology ePrint Archive, Report 2005\/266 (2005), http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"IT-14","author":"T. Kasami","year":"1968","unstructured":"Kasami, T., Lin, S., Peterson, W.W.: New Generalization of the Reed-Muller Codes Part I: Primitive Codes. IEEE Transactions on Information Theory\u00a0IT-14(2), 189\u2013199 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44828-4_26","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"K. Lally","year":"2003","unstructured":"Lally, K.: Quasicyclic codes of index \u2113 over ${\\mathbb F}_q$ Viewed as ${\\mathbb F}_q[x]$ -submodules of ${\\mathbb F}_{q^l}[x]\/\\langle{x^m-1}\\rangle$ . In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. LNCS, vol.\u00a02643, Springer, Heidelberg (2003)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Ling, S., Sol\u00e9, P.: Structure of quasi-clcyic codes III: Generator theory. In: IEEE Transaction on Information Theory (2005)","DOI":"10.1109\/TIT.2005.850142"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Matusiewicz, K., Pieprzyk, J.: Finding good differential patterns for attacks on SHA-1. In: International Workshop on Coding and Cryptography (2005)","DOI":"10.1007\/11779360_14"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"V. Rijmen","year":"2005","unstructured":"Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, Springer, Heidelberg (2005)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Rivest, R.: RFC1321: The MD5 message-digest algorithm. In: Internet Activities Board (1992)","DOI":"10.17487\/rfc1321"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Townsend, R.L., Weldon, E.J.: Self-orthogonal quasi-cyclic codes. IEEE Transaction on Information Theory (1967)","DOI":"10.1109\/TIT.1967.1053974"},{"key":"26_CR14","unstructured":"United States Department of Commerce, National Institute of Standards and Technology, Federal Information Processing Standard Publication #180. Secure Hash Standard (1993)"},{"key":"26_CR15","unstructured":"United States Department of Commerce, National Institute of Standards and Technology, Federal Information Processing Standard Publication #180-1 (addendum to [14]). Secure Hash Standard (1995)"},{"key":"26_CR16","unstructured":"United States Department of Commerce, National Institute of Standards and Technology, Federal Information Processing Standard Publication #180-2. Secure Hash Standard (August 2002)"},{"key":"26_CR17","volume-title":"Introduction to Coding Theory","author":"J.H. Lint van","year":"1998","unstructured":"van Lint, J.H.: Introduction to Coding Theory. Springer, Heidelberg (1998)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Transaction on Information Theory\u00a043(6) (1997)","DOI":"10.1109\/18.641542"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yao, A., Yao, F.: New collision search for SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks in SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"26_CR22","unstructured":"Wang, X.Y.: The collision attack on SHA-0. In Chinese (1997)"},{"key":"26_CR23","unstructured":"Wang, X.Y.: The Improved collision attack on SHA-0. In Chinese (1997), http:\/\/www.infosec.edu.cn\/"},{"key":"26_CR24","unstructured":"Zierler, N.: On a variation of the first-order reed-muller codes. In: M.I.T. Lincoln Lab., Group Report, 34-80, Lexington, Mass (October 1958)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74462-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:30:40Z","timestamp":1619505040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74462-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744610","9783540744627"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74462-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}