Collisions for two branches of FORK-256
暂无分享,去创建一个
[1] Xiaoyun Wang,et al. Efficient Collision Search Attacks on SHA-0 , 2005, CRYPTO.
[2] Ronald L. Rivest,et al. The MD5 Message-Digest Algorithm , 1992, RFC.
[3] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.
[4] Bruce Schneier,et al. Unbalanced Feistel Networks and Block Cipher Design , 1996, FSE.
[5] Eli Biham,et al. TIGER: A Fast New Hash Function , 1996, FSE.
[6] Bart Preneel,et al. Cryptanalysis of Reduced Variants of the FORK-256 Hash Function , 2007, CT-RSA.
[7] Seokhie Hong,et al. A New Dedicated 256-Bit Hash Function: FORK-256 , 2006, FSE.
[8] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.
[9] Xiaoyun Wang,et al. How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.
[10] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..
[11] Ronald L. Rivest,et al. The MD4 Message-Digest Algorithm , 1990, RFC.
[12] Hui Chen,et al. Cryptanalysis of the Hash Functions MD4 and RIPEMD , 2005, EUROCRYPT.
[13] Jennifer Seberry,et al. HAVAL - A One-Way Hashing Algorithm with Variable Length of Output , 1992, AUSCRYPT.