Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Resynchronization weaknesses in synchronous stream ciphers
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
Efficient Software Implementation for Finite Field Multiplication in Normal Basis
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Fast Normal Basis Multiplication Using General Purpose Processors
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
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Extending the resynchronization attack
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
A new simple technique to attack filter generators and related ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
IEEE Transactions on Information Theory
Cryptanalysis of the stream cipher BEAN
Proceedings of the 4th international conference on Security of information and networks
Efficient computation of algebraic immunity for algebraic and fast algebraic attacks
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On the nonlinearity of maximum-length NFSR feedbacks
Cryptography and Communications
| Hi-index | 0.00 |
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various cryptanalytic attacks. In this paper, we present a unified framework for the security of a design against these attacks based on the properties of the LFSR(s) and the Boolean function used. It is explained why building nonlinear filters seems more practical than building nonlinear combiners. We also investigate concrete building blocks that offer a good trade-off in their resistance against these various attacks, and can at the same time be used to build a low-cost synchronous stream cipher for hardware applications.