Fast correlation attacks on certain stream ciphers
Journal of Cryptology
“Chinese” & Match”, and alternative to Atkin's “match and sort” metjhod used in the sea algorithm
Mathematics of Computation
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Why Textbook ElGamal and RSA Encryption Are Insecure
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers
Proceedings of the 5th IMA Conference on Cryptography and Coding
Cryptanalysis of PKP: A New Approach
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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
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
Vectorial Approach to Fast Correlation Attacks
Designs, Codes and Cryptography
Cryptanalysis of the "Grain" family of stream ciphers
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Security Bounds for the Design of Code-Based Cryptosystems
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Recovering a code's length and synchronization from a noisy intercepted bitstream
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Multi-pass fast correlation attack on stream ciphers
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Improving the time complexity of Matsui's linear cryptanalysis
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Attacking the filter generator by finding zero inputs of the filtering function
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
A geometrical robust image data hiding scheme using FCA-based resynchronization
IH'07 Proceedings of the 9th international conference on Information hiding
Attacking the Knudsen-Preneel compression functions
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Fast correlation attacks: methods and countermeasures
FSE'11 Proceedings of the 18th international conference on Fast software encryption
How to improve rebound attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Grain-128a: a new version of Grain-128 with optional authentication
International Journal of Wireless and Mobile Computing
New guess-and-determine attack on the self-shrinking generator
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Improved fast correlation attack on the shrinking and self-shrinking generators
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Galois LFSR, embedded devices and side channel weaknesses
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
The decimated sample based improved algebraic attacks on the nonlinear filters
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
A fast correlation attack on the shrinking generator
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
The conditional correlation attack: a practical attack on bluetooth encryption
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
New generic algorithms for hard knapsacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On the triple-error-correcting cyclic codes with zero set {1, 2i + 1, 2i + 1}
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Correlation attacks on combination generators
Cryptography and Communications
A survey on fast correlation attacks
Cryptography and Communications
| Hi-index | 0.00 |
In this paper, we present some major algorithmic improvements to fast correlation attacks. In previous articles about fast correlations, algorithmics never was the main topic. Instead, the authors of these articles were usually addressing theoretical issues in order to get better attacks. This viewpoint has produced a long sequence of increasingly successful attacks against stream ciphers, which share a main common point: the need to find and evaluate parity-checks for the underlying linear feedback shift register. In the present work, we deliberately take a different point of view and we focus on the search for efficient algorithms for finding and evaluating parity-checks. We show that the simple algorithmic techniques that are usually used to perform these steps can be replaced by algorithms with better asymptotic complexity using more advanced algorithmic techniques. In practice, these new algorithms yield large improvements on the efficiency of fast correlation attacks.