Fast correlation attacks on certain stream ciphers
Journal of Cryptology
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Proceedings of the Third International Workshop on Fast Software Encryption
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
On a fast correlation attack on certain stream ciphers
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Improved fast correlation attacks on stream ciphers via convolutional codes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q)
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Correlation Attacks: An Algorithmic Point of View
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
A New Ultrafast Stream Cipher Design: COS Ciphers
Proceedings of the 8th IMA International Conference on Cryptography and Coding
New Stream Cipher Designs
Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Grain-128a: a new version of Grain-128 with optional authentication
International Journal of Wireless and Mobile Computing
A new simple technique to attack filter generators and related ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Improved fast correlation attack on the shrinking and self-shrinking generators
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
A new distinguisher for clock controlled stream ciphers
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Efficient representation and software implementation of resilient maiorana-mcfarland s-boxes
WISA'04 Proceedings of the 5th international conference on Information Security Applications
The conditional correlation attack: a practical attack on bluetooth encryption
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On immunity profile of boolean functions
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Correlation attacks on combination generators
Cryptography and Communications
A survey on fast correlation attacks
Cryptography and Communications
| Hi-index | 0.00 |
A new simple algorithm for fast correlation attacks on stream ciphers is presented. The advantages of the new approach are at least two. Firstly, the new algorithm significantly reduces the memory requirements compared with some recent proposals [2,3]. This allows more powerful attacks than previously. Secondly, the simplicity of the algorithm allows us to derive theoretical results. We determine the relation between the number of observed symbols, the correlation probability, and the allowed computational complexity, required for a successful attack. Hence, we can get theoretical estimates on the required computational complexity in cases when simulation is not possible.