Analysis and design of stream ciphers
Analysis and design of stream ciphers
Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Designs, Codes and Cryptography
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
CRYPTO '96 Proceedings of the 16th 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
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
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
A method for convergence analysis of iterative probabilistic decoding
IEEE Transactions on Information Theory
When stream cipher analysis meets public-key cryptography
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On extended algebraic immunity
Designs, Codes and Cryptography
The decimated sample based improved algebraic attacks on the nonlinear filters
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
| Hi-index | 0.00 |
This paper points out: (i) a possibility for malicious selection of the LFSRs feedback polynomials in order to install a trapdoor for the cryptanalysis; and (ii) a weakness of the construction of the resilient functions over GF(q) proposed at CRYPTO'96. Two corresponding methods for cryptanalysis are proposed. It is shown that although certain keystream generators over GF(q) are resistant against correlation and linear complexity based attacks, they are vulnerable by some novel attacks. The efficiency of these attacks depends on characteristics of the employed LFSRs and resilient functions. The developed attacks imply that LFSRs with certain characteristic polynomials and certain resilient functions are inappropriate as the building components for nonlinear combination generators and related schemes. They imply certain design criteria for employment of LFSRs and resilient functions over GF(q) in the nonlinear combination keystream generators and related schemes.