On lattice-based algebraic feedback shift registers synthesis for multisequences

DOI10.1007/S12095-017-0230-0MaRDI QIDQ1699261zbMATH OpenOpenAlexFDO

Authors L.-P. Wang, Daqing Wan

Publication date 19 February 2018

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-017-0230-0

zbMATH Keywords

latticesmultisequencesalgebraic feedback shift registersregister synthesis problemsuccessive minimal problem on lattices

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Simultaneous homogeneous approximation, linear forms (11J13) Recurrences (11B37) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• A lattice rational approximation algorithm for AFSRs over quadratic integer rings
• \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• Algebraic Feedback Shift Registers Based on Function Fields
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• AFSRs synthesis with the extended Euclidean rational approximation algorithm
• An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
• Register synthesis for algebraic feedback shift registers based on non-primes
• scientific article; zbMATH DE number 4072864

Cites work

• scientific article; zbMATH DE number 5764780 (Why is no real title available?)
• scientific article; zbMATH DE number 4072864 (Why is no real title available?)
• scientific article; zbMATH DE number 1030997 (Why is no real title available?)
• scientific article; zbMATH DE number 822685 (Why is no real title available?)
• scientific article; zbMATH DE number 3333393 (Why is no real title available?)
• 2-Adic shift registers
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• A lattice rational approximation algorithm for AFSRs over quadratic integer rings
• A method for solving key equation for decoding goppa codes
• A sieve algorithm for the shortest lattice vector problem
• A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
• Algebraic Shift Register Sequences
• Algebraic coding theory
• Algebraic feedback shift registers
• Algorithmic Number Theory
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• Continued Fractions and Linear Recurrences
• Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
• Factoring polynomials with rational coefficients
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• Feedback shift registers, 2-adic span, and combiners with memory
• Fraction-free computation of simultaneous Padé approximants
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Minkowski's Convex Body Theorem and Integer Programming
• On a class of arithmetic codes and a decoding algorithm (Corresp.)
• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• On the joint 2-adic complexity of binary multisequences
• Register synthesis for algebraic feedback shift registers based on non-primes
• Sampling methods for shortest vectors, closest vectors and successive minima
• Shift-register synthesis and BCH decoding
• Some sieving algorithms for lattice problems

Cited in

(14)

• scientific article; zbMATH DE number 1852144 (Why is no real title available?)
• Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• Algebraic Feedback Shift Registers Based on Function Fields
• \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• A lattice rational approximation algorithm for AFSRs over quadratic integer rings
• Algebraic feedback shift registers
• scientific article; zbMATH DE number 1740055 (Why is no real title available?)
• AFSRs synthesis with the extended Euclidean rational approximation algorithm
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
• Fast multi-sequence shift-register synthesis with the Euclidean algorithm
• Register synthesis for algebraic feedback shift registers based on non-primes
• scientific article; zbMATH DE number 4045633 (Why is no real title available?)

This page was built for publication: On lattice-based algebraic feedback shift registers synthesis for multisequences

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