On CCZ-equivalence of addition mod 2n
暂无分享,去创建一个
[1] Rainer A. Rueppel,et al. Correlation Immunity and the Summation Generator , 1985, CRYPTO.
[2] Shiho Moriai,et al. Efficient Algorithms for Computing Differential Properties of Addition , 2001, FSE.
[3] Palash Sarkar. On Approximating Addition by Exclusive OR , 2009, IACR Cryptol. ePrint Arch..
[4] Eli Biham,et al. Differential Cryptanalysis of Feal and N-Hash , 1991, EUROCRYPT.
[5] Gaëtan Leurent,et al. Practical Near-Collisions on the Compression Function of BMW , 2011, FSE.
[6] Claude Carlet,et al. Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..
[7] Didier Alquié. Approximating Addition by XOR: how to go all the way , 2010, IACR Cryptol. ePrint Arch..
[8] Kaisa Nyberg,et al. Improved Linear Distinguishers for SNOW 2.0 , 2006, FSE.
[9] Johan Wallén. Linear Approximations of Addition Modulo 2n , 2003, FSE.
[10] Willi Meier,et al. Cryptographic Significance of the Carry for Ciphers Based on Integer Addition , 1990, CRYPTO.
[11] John M. Holte. Carries, Combinatorics, and an Amazing Matrix , 1997 .
[12] Bart Preneel,et al. Solving Systems of Differential Equations of Addition , 2005, ACISP.