{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:57Z","timestamp":1775794857956,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540289388","type":"print"},{"value":"9783540320661","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554868_6","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:49:02Z","timestamp":1127832542000},"page":"64-83","source":"Crossref","is-referenced-by-count":61,"title":["A Family of Fast Syndrome Based Cryptographic Hash Functions"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Augot","sequence":"first","affiliation":[]},{"given":"Matthieu","family":"Finiasz","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Sendrier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. Cryptology ePrint Archive (2003), \n                    \n                      http:\/\/eprint.iacr.org\/2003\/230\/"},{"key":"6_CR2","first-page":"649","volume-title":"Handbook of Coding theory, ch.\u00a07","author":"A. Barg","year":"1998","unstructured":"Barg, A.: Complexity issues in coding theory. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding theory, ch.\u00a07, vol.\u00a0I, pp. 649\u2013754. North-Holland, Amsterdam (1998)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3) (May 1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"6_CR4","unstructured":"Coron, J.-S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive (2004), \n                    \n                      http:\/\/eprint.iacr.org\/2004\/013\/"},{"key":"6_CR5","unstructured":"Dai, W.: Crypto++ library, \n                    \n                      http:\/\/www.eskimo.com\/~weidai\/"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","volume":"42","author":"Y. Gurevich","year":"1991","unstructured":"Gurevich, Y.: Average case completeness. Journal of Computer and System Sciences\u00a042(3), 346\u2013398 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BFb0053424","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"A. Joux","year":"1995","unstructured":"Joux, A., Granboulan, L.: A practical attack against knapsack based hash functions. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 58\u201366. Springer, Heidelberg (1995)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L. Levin","year":"1986","unstructured":"Levin, L.: Average case complete problems. SIAM Journal on Computing\u00a015(1), 285\u2013286 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR10","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, January 1978, pp. 114\u2013116 (1978)"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"6_CR13","unstructured":"National Insitute of Standards and Technology. FIPS Publication 180: Secure Hash Standard (1993)"},{"issue":"2","key":"6_CR14","first-page":"157","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type crytosystems and algebraic coding theory. Prob. Contr. Inform. Theory\u00a015(2), 157\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theory"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-48969-X_8","volume-title":"Lectures on Data Security","author":"B. Preneel","year":"1999","unstructured":"Preneel, B.: The state of cryptographic hash functions. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol.\u00a01561, pp. 158\u2013182. Springer, Heidelberg (1999)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-38424-3_22","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"R.L. Rivest","year":"1991","unstructured":"Rivest, R.L.: The MD4 message digest algorithm. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 303\u2013311. Springer, Heidelberg (1991)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-25937-4_24","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 371\u2013388. Springer, Heidelberg (2004)"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-1-4757-3585-7_10","volume-title":"Information, Coding and Mathematics","author":"N. Sendrier","year":"2002","unstructured":"Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H. (eds.) Information, Coding and Mathematics, pp. 141\u2013163. Kluwer, Dordrecht (2002); Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday"},{"key":"6_CR19","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\u2013304. Springer, Heidelberg (2002)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11426639_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions md4 and ripemd. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","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. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 Mycrypt 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554868_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:07Z","timestamp":1619507227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554868_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289388","9783540320661"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11554868_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}