Clock-controlled FCSR sequence with large linear complexity

Authors:
Zhen Pan;Wei Su;Xiaohu Tang
Affiliations:
Key Laboratory of Information Coding and Transmission, Southwest Jiaotong, University, Chengdu, Sichuan, P.R. of China;Key Laboratory of Information Coding and Transmission, Southwest Jiaotong, University, Chengdu, Sichuan, P.R. of China;Key Laboratory of Information Coding and Transmission, Southwest Jiaotong, University, Chengdu, Sichuan, P.R. of China
Venue:
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Year:
2010

Citing 8
Cited 0

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
Products of linear recurring sequences with maximum complexity

IEEE Transactions on Information Theory
2-Adic Shift Registers

Fast Software Encryption, Cambridge Security Workshop
Breaking the F-FCSR-H Stream Cipher in Real Time

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A New Approach for FCSRs

Selected Areas in Cryptography
F-FCSR: design of a new class of stream ciphers

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
A lower bound on the linear span of an FCSR

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the stop-and-go clock-controlled generator based on FCSR. The output sequence is proven to have large linear complexity. Further, the experimental results show that most of the output sequences also have almost optimal 2-adic complexity.