On the linear complexity of FCSR sequences

DOI10.1007/S11766-003-0057-7MaRDI QIDQ1430963zbMATH OpenOpenAlexFDO

Authors Hong Xu, Wenfeng Qi

Publication date 27 May 2004

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-003-0057-7

zbMATH Keywords

feedback with carry shift registerlinear complexitylinear recurring sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Linearity properties of binary FCSR sequences
• On the k-error linear complexity of -sequences
• A lower bound on the linear span of an FCSR
• On FCSR Memory Sequences
• Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point

Cites work

• 2-Adic shift registers
• A lower bound on the linear span of an FCSR
• Analysis and design of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• Fourier transforms and the 2-adic span of periodic binary sequences
• scientific article; zbMATH DE number 1676648 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)

Cited in

(7)

• Distribution properties of half- -sequence
• Element distribution of decimations and k-error linear complexity of l-sequences
• On FCSR Memory Sequences
• Clock-Controlled FCSR Sequence with Large Linear Complexity
• A lower bound on the linear span of an FCSR
• On the k-error linear complexity of -sequences
• Linearity properties of binary FCSR sequences

This page was built for publication: On the linear complexity of FCSR sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1430963)