Fast correlation attacks on stream ciphers
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Windmill generators: A generalization and an observation of how many there are
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Parallel generation of recurring sequences
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Shift Register Sequences
Fast Software Encryption, Cambridge Security Workshop
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
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A new simple technique to attack filter generators and related ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
IEEE Transactions on Information Theory
A matrix approach for FCSR automata
Cryptography and Communications
Hi-index | 0.00 |
We present a generalization of a class of characteristic polynomials used for linear feedback shift registers (LFSRs). In previous works, several restrictions have been demonstrated for the windmill polynomials. Most notably, no irreducible windmill polynomial was found for a degree d = 3 mod 8. We show how to modify the original definition to overcome those restrictions. We also assess the security of our extended windmill generator considering the case of a filtered LFSR. This paper concerns LFSRs but it can be extended to any kind of shift registers including feedback with carry shift registers (FCSRs) and non-linear feedback shift registers (NLFSRs). We also establish the number of extended windmill polynomials for v = 4, 8, 16, 32 and 64 vanes up to the degree 160.