Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A New Version of the Stream Cipher SNOW
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Efficient Algorithms for Computing Differential Properties of Addition
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Cryptanalysis of Stream Ciphers with Linear Masking
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient VLSI Implementation of Modulo (2^n=B11) Addition and Multiplication
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Algebraic Description and Simultaneous Linear Approximations of Addition in Snow 2.0.
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Differential cryptanalysis mod 232 with applications to MD5
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
On a conjecture about binary strings distribution
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Fast computation of large distributions and its cryptographic applications
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Improved linear distinguishers for SNOW 2.0
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Hi-index | 0.00 |
Addition modulo 231 - 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC's resistance against linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 231 - 1. In this paper we discuss linear approximations of the addition of k inputs modulo 2n -1 for n ≥ 2. As a result, an explicit expression of the correlations of linear approximations of the addition modulo 2n -1 is given when k = 2, and an iterative expression when k 2. For a class of special linear approximations with all masks being equal to 1, we further discuss the limit of their correlations when n goes to infinity. It is shown that when k is even, the limit is equal to zero, and when k is odd, the limit is bounded by a constant depending on k.