Low-weight Pseudo Collision Attack on Shabal and Preimage Attack on Reduced Shabal-512
暂无分享,去创建一个
[1] Shiho Moriai,et al. Efficient Algorithms for Computing Differential Properties of Addition , 2001, FSE.
[2] Jean-Philippe Aumasson. On the pseudorandomness of Shabal ’ s keyed permutation , 2009 .
[3] Xiaoyun Wang,et al. How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.
[4] Willi Meier,et al. More on Shabal ’ s permutation , 2009 .
[5] Philip Hawkes,et al. Guess-and-Determine Attacks on SNOW , 2002, Selected Areas in Cryptography.
[6] Van Assche,et al. A rotational distinguisher on Shabal ’ s keyed permutation and its impact on the security proofs , 2010 .
[7] Christophe Clavier,et al. Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers , 2009, IACR Cryptol. ePrint Arch..
[8] Bart Preneel,et al. Practical Collisions for EnRUPT , 2010, Journal of Cryptology.
[9] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.
[10] Antoine Joux,et al. Collisions of SHA-0 and Reduced SHA-1 , 2005, EUROCRYPT.
[11] Ivica Nikolic,et al. Meet-in-the-Middle Attacks on SHA-3 Candidates , 2009, FSE.