Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction

DOI10.1007/s10623-017-0375-zzbMath1384.94019OpenAlexW2641752866MaRDI QIDQ1744015

Weihua Liu, Zhixiong Chen, Andrew Klapper

Publication date: 16 April 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-017-0375-z

zbMATH Keywords

multi-sequenceslattice basis reduction algorithmFCSR synthesis problem

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Unnamed Item
• Unnamed Item
• \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Factoring polynomials with rational coefficients
• Feedback shift registers, 2-adic span, and combiners with memory
• Register synthesis for algebraic feedback shift registers based on non-primes
• On the joint 2-adic complexity of binary multisequences
• Low-dimensional lattice basis reduction revisited
• Algebraic Shift Register Sequences
• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• An LLL Algorithm with Quadratic Complexity
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• Shift-register synthesis and BCH decoding