{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:12:03Z","timestamp":1791321123364,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540792628","type":"print"},{"value":"9783540792635","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79263-5_2","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T08:18:54Z","timestamp":1207297134000},"page":"19-35","source":"Crossref","is-referenced-by-count":10,"title":["Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ga\u00ebtan","family":"Leurent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/3-540-69053-0_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Micciancio, D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 163\u2013192. Springer, Heidelberg (1997)"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"C.L. Chen","year":"1969","unstructured":"Chen, C.L., Peterson, W.W., W Jr., E.J.: Some Results on Quasi-Cyclic Codes. Information and Control\u00a015(5), 407\u2013423 (1969)","journal-title":"Information and Control"},{"key":"2_CR4","unstructured":"Coron, J.S., Joux, A.: Cryptanalysis of a Provably Secure Cryptographic Hash Function. Cryptology ePrint Archive, Report 2004\/013 (2004) http:\/\/eprint.iacr.org\/"},{"key":"2_CR5","unstructured":"Finiasz, M., Gaborit, P., Sendrier, N.: Improved Fast Syndrome Based Cryptographic Hash Functions. In: Rijmen, V. (ed.) ECRYPT Hash Workshop 2007 (2007)"},{"key":"2_CR6","first-page":"239","volume":"49","author":"J. Goldman","year":"1970","unstructured":"Goldman, J., Rota, G.C.: On the foundations of combinatorial theory. IV: Finite vector spaces and Eulerian generating functions. Stud. Appl. Math.\u00a049, 239\u2013258 (1970)","journal-title":"IV: Finite vector spaces and Eulerian generating functions. Stud. Appl. Math."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Saarinen, M.J.O.: Linearization Attacks Against Syndrome Based Hashes. Cryptology ePrint Archive, Report 2007\/295 (2007) http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-77026-8_1"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013303. Springer, 2442 (2002)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","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 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","first-page":"19","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.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79263-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T16:39:12Z","timestamp":1588523952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79263-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540792628","9783540792635"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79263-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}