Analysis and design of stream ciphers
Analysis and design of stream ciphers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
An efficient algorithm to generate binary sequences for cryptographic purposes
Theoretical Computer Science
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Shift Register Sequences
Discrete Mathematics
On the Linear Complexity of Nonlinear Filtered PN-sequences
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Strategic attack on the shrinking generator
Theoretical Computer Science
Nonlinear complexity of binary sequences and connections with lempel-ziv compression
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the linearity of cryptographic sequence generators
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Generalized self-shrinking generator
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, a procedure of decomposition of nonlinearly filtered sequences in primary characteristic sequences has been introduced. Such a procedure allows one to analyze structural properties of the filtered sequences e.g. period and linear complexity, which are essential features for their possible application in cryptography. As a consequence of the previous decomposition, a simple constructive method that enlarges the number of known filtered sequences with guaranteed cryptographic parameters has been developed. The procedure here introduced does not impose any constraint on the characteristics of the nonlinear filter.