Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
WG: A family of stream ciphers with designed randomness properties
Information Sciences: an International Journal
Cube Attacks on Tweakable Black Box Polynomials
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications 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
Binary pseudorandom sequences of period 2n-1 with ideal autocorrelation
IEEE Transactions on Information Theory
Cryptographic properties of the Welch-Gong transformation sequence generators
IEEE Transactions on Information Theory
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
IEEE Transactions on Information Theory
New cyclic difference sets with Singer parameters
Finite Fields and Their Applications
Fast Discrete Fourier Spectra Attacks on Stream Ciphers
IEEE Transactions on Information Theory
Cryptanalysis of WG-7: a lightweight stream cipher
Cryptography and Communications
The weakness of integrity protection for LTE
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Resilience to distinguishing attacks on WG-7 cipher and their generalizations
Cryptography and Communications
Hi-index | 0.00 |
A general structure of the Welch-Gong (WG) stream cipher family is based on filtering an m-sequence of degree l over a finite field $\ensuremath{{\mathbb{F}}}_{2^m}$ where the filtering function is a WG transformation from $\ensuremath{{\mathbb{F}}}_{2^m}$ to $\ensuremath{{\mathbb{F}}}_{2}$. For a fixed m and l, the linear span of the filtering sequence can be enhanced by increasing the algebraic degree of the WG transformations. This can be accomplished by the composition of a WG transformation with a monomial permutation, which is called the decimation of a WG transformation. In this paper, we first present the new exponent set of WG transformations, and show the existence of exponents derived from the new exponent set for which a decimated WG transformation achieves the maximum algebraic degree. As a result, the linear span of keystreams produced by a decimated WG cipher can be maximized and calculated theoretically. We then give a description of a decimated WG stream cipher which is built upon an LFSR and a decimated WG transformation over an extension field. The randomness properties of keystreams produced by a decimated WG cipher are derived based on the new exponent set. We also discuss the selection criteria for choosing the optimal parameters for the WG cipher family in order to achieve the maximum level of security. Finally, we present the optimal parameters for the WG transformations over $\ensuremath{{\mathbb{F}}}_{2^m}, 7\leq m \leq 16$ based on the proposed criteria.