A secure and efficient cryptographic hash function based on NewFORK-256
暂无分享,去创建一个
[1] Dengguo Feng,et al. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..
[2] Bruce Schneier,et al. Second Preimages on n-bit Hash Functions for Much Less than 2n Work , 2005, IACR Cryptol. ePrint Arch..
[3] Murali Krishna Reddy Danda. Design and analysis of hash functions , 2007 .
[4] Bart Preneel,et al. The NIST SHA-3 Competition: A Perspective on the Final Year , 2011, AFRICACRYPT.
[5] Seokhie Hong,et al. A New Dedicated 256-Bit Hash Function: FORK-256 , 2006, FSE.
[6] Hans Dobbertin,et al. Cryptanalysis of MD4 , 1996, Journal of Cryptology.
[7] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.
[8] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.
[9] Seokhie Hong,et al. New FORK-256 , 2007, IACR Cryptol. ePrint Arch..
[10] Ronald L. Rivest,et al. The MD4 Message-Digest Algorithm , 1990, RFC.
[11] Josef Pieprzyk,et al. Weaknesses of the FORK-256 compression function , 2006, IACR Cryptol. ePrint Arch..
[12] Markku-Juhani O. Saarinen. A Meet-in-the-Middle Collision Attack Against the New FORK-256 , 2007, IACR Cryptol. ePrint Arch..
[13] Bart Preneel,et al. The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition , 2010, CT-RSA.
[14] Bart Preneel,et al. RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.
[15] Bart Preneel,et al. Cryptanalysis of Reduced Variants of the FORK-256 Hash Function , 2007, CT-RSA.
[16] Andrew W. Appel,et al. Formal aspects of mobile code security , 1999 .
[17] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[18] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.