On the expected value of the joint 2-adic complexity of periodic binary multisequences

Authors:
Honggang Hu;Lei Hu;Dengguo Feng
Affiliations:
State Key Laboratory of Information Security, (Institute of Software, Chinese Academy of Sciences), Beijing, China;State Key Laboratory of Information Security, (Graduate School of Chinese Academy of Sciences), Beijing, China;State Key Laboratory of Information Security, (Institute of Software, Chinese Academy of Sciences), Beijing, China
Venue:
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Year:
2006

Citing 8
Cited 0

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Cryptoanalysis Based on 2-Adic Rational Approximation

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
2-Adic Shift Registers

Fast Software Encryption, Cambridge Security Workshop
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
Extended games-Chan algorithm for the 2-adic complexity of FCSR-sequences

Theoretical Computer Science
Large period nearly de Bruijn FCSR sequences

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently people show some interest in the word-based stream ciphers. The theory of such stream ciphers requires the study of the complexity of multisequences. The 2-adic complexity is the FCSR analog of the linear complexity, and it is very useful in the study of the security of stream ciphers. The improved version of 2-adic complexity—the symmetric 2-adic complexity was presented in 2004 which is a better measure for the cryptographic strength of binary sequences. In this paper, we derive the expected value of the joint 2-adic complexity of periodic binary multisequences. A nontrivial lower bound for the expected value of the joint symmetric 2-adic complexity of periodic binary multisequences is also given.