Finite field for scientists and engineers
Finite field for scientists and engineers
Fast correlation attacks on stream ciphers
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A faster cryptanalysis of the self-shrinking generator
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
A Probabilistic Correlation Attack on the Shrinking Generator
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Improved Cryptanalysis of the Self-Shrinking Generator
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Correlation Analysis of the Shrinking Generator
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Edit Distance Correlation Attack on the Alternating Step Generator
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
BDD-Based Cryptanalysis of Keystream Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Alternating step generators controlled by De Bruijn sequences
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Predicting the shrinking generator with fixed connections
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Modified clock-controlled alternating step generators
Computer Communications
Side channel attacks on irregularly decimated generators
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
How to strengthen pseudo-random generators by using compression
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Hi-index | 0.00 |
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 using only one LFSR and some selection logic. We present various attacks on the BSG based on the fact that the output sequence can be uniquely defined by the differential of the input sequence. By knowing only a small part of the output sequence we can reconstruct the key with complexity O(L320.5 L). This complexity can be significantly reduced in a data/time tradeoff manner to achieve a complexity of O(L320.27 L) if we have O(20.27 L) of keystream. We also propose a distinguishing attack that can be very efficient if the feedback polynomial is not carefully chosen.