A family of fast syndrome based cryptographic hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3715 LNCS, Issue , 2005, Pages 64-83

  Augot, Daniel ^a   Finiasz, Matthieu ^a,b   Sendrier, Nicolas ^a  

^a INRIA ROCQUENCOURT   (France)

^b EPFL   (Switzerland)

Author keywords

Cryptographic hash functions; NP completeness; Provable security; Syndrome decoding; Wagner's generalized birthday problem

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CODES (SYMBOLS); COMPUTER SCIENCE; DATA PRIVACY; ERROR CORRECTION; FUNCTIONS; SECURITY OF DATA;

CRYPTOGRAPHIC HASH FUNCTIONS; NP-COMPLETENESS; PROVABLE SECURITY; SYNDROME DECODING; WAGNER'S GENERALIZED BIRTHDAY PROBLEM;

CRYPTOGRAPHY;

EID: 33646171290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_6     Document Type: Conference Paper

References (21)

1. D. Augot, M. Finiasz, and N. Sendrier. A fast provably secure cryptographic hash function. Cryptology ePrint Archive, 2003. http://eprint.iacr.org/2003/230/.
2. A. Barg. Complexity issues in coding theory. In V. S. Pless and W. C. Huffman, editors, Handbook of Coding theory, volume I, chapter 7, pages 649-754. North-Holland, 1998.
3. E. R. Berlekamp, R. J. McEliece, and H. C. van Tilborg. On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory, 24(3), May 1978.
4. J.-S. Coron and A. Joux. Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive, 2004. http://eprint.iacr.org/2004/ 013/.
5. Wei Dai. Crypto++ library. http://www.eskimo.com/~weidai/.
6. I.E. Damgård. A design principle for hash functions. In Gilles Brassard, editor, CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 416-426. Springer-Verlag, 1989.
7. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42(3):346-398, 1991.
8. A. Joux and L. Granboulan. A practical attack against knapsack based hash functions. In Alfredo De Santis, editor, Advances in Cryptology - Eurocrypt '94, volume 950 of Lecture Notes in Computer Science, pages 58-66. Springer-Verlag, 1994.
9. L. Levin, Average case complete problems. SIAM Journal on Computing, 15(1):285-286, 1986.
10. R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, pages 114-116, January 1978.
11. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
12. R. C. Merkle. One way hash functions and DES. In Gilles Brassard, editor, Advances in Cryptology - Crypto '89, volume 435 of Lecture Notes in Computer Science, pages 428-446. Springer-Verlag, 1990.
13. National Insitute of Standards and Technology. FIPS Publication 180: Secure Hash Standard, 1993.
14. H. Niederreiter. Knapsack-type crytosystems and algebraic coding theory. Prob. Contr. Inform. Theory, 15(2):157-166, 1986.
15. Bart Preneel. The state of cryptographic hash functions. In Ivan Damgaård, editor, Lectures on Data Security: Modern Cryptology in Theory and Practice, volume 1561 of Lecture Notes in Computer Science, pages 158-182. Springer-Verlag, 1999.
16. R. L. Rivest. The MD4 message digest algorithm. In A.J. Menezes and S.A. Vanstone, editors, Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 303-311. Springer-Verlag, 1991.
17. P. Rogaway and T. Shrimpton. Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In Bimal Roy and Willi Meier, editors, Fast Software Encryption 2004, volume 3017 of Lecture Notes in Computer Science, pages 371-388, 2004.
18. N. Sendrier. On the security of the McEliece public-key cryptosystem. In M. Blaum, P.G. Farrell, and H. van Tilborg, editors, Information, Coding and Mathematics, pages 141-163. Kluwer, 2002. Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday.
19. D. Wagner. A generalized birthday problem. In M. Yung, editor, CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 288-304. Springer-Verlag, 2002.
20. Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu. Cryptanalysis of the hash functions md4 and ripemd. In Ronald Cramer, editor, Advances in Cryptology - Eurocrypt 2005, volume 3494 of Lecture Notes in Computer Science, pages 1-18, Aarhus, Denmark, May 2005. Springer-Verlag.
21. Xiaoyun Wang and Hongbo Yu. How to break md5 and other hash functions. In Ronald Cramer, editor, Advances in Cryptology - Eurocrypt 2005, volume 3494 of Lecture Notes in Computer Science, pages 19-35, Aarhus, Denmark, May 2005. Springer-Verlag.