Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Using Strassen's algorithm to accelerate the solution of linear systems
The Journal of Supercomputing
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Relationships between Bent Functions and Complementary Plateaued Functions
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Fast Correlation Attacks Based on Turbo Code Techniques
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
Improved fast correlation attacks using parity-check equations of weight 4 and 5
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
IEEE Transactions on Information Theory
Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison
IEEE Transactions on Information Theory
Results on the immunity of Boolean functions against probabilistic algebraic attacks
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Reducing the number of homogeneous linear equations in finding annihilators
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
| Hi-index | 0.06 |
This paper investigates a probabilistic algebraic attack on LFSR-based stream ciphers. We consider two scenarios (S3a and S3b) proposed by Meier et al. at Eurocrypt 2004. In order to derive the probability in this new algebraic attack, we quantify the distance between a Boolean function and a function with annihilator of a certain degree. We show that in some cases the approximations can improve the algebraic attacks. Moreover, this distance leads to other theoretical results such as the weights of the subfunctions and the distance to normal functions; it also provides information on the Walsh spectrum of the function.