On lattice-based algebraic feedback shift registers synthesis for multisequences
DOI10.1007/s12095-017-0230-0zbMath1387.14077OpenAlexW2618643689MaRDI QIDQ1699261
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
latticesmultisequencesalgebraic feedback shift registersregister synthesis problemsuccessive minimal problem on lattices
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Recurrences (11B37) Simultaneous homogeneous approximation, linear forms (11J13) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
- Sampling methods for shortest vectors, closest vectors and successive minima
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Factoring polynomials with rational coefficients
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic feedback shift registers
- Register synthesis for algebraic feedback shift registers based on non-primes
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Fraction-free computation of simultaneous padé approximants
- On the joint 2-adic complexity of binary multisequences
- A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings
- Algebraic Shift Register Sequences
- Some Sieving Algorithms for Lattice Problems
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Minkowski's Convex Body Theorem and Integer Programming
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- A method for solving key equation for decoding goppa codes
- Continued Fractions and Linear Recurrences
- On a class of arithmetic codes and a decoding algorithm (Corresp.)
- 2-Adic shift registers
- A sieve algorithm for the shortest lattice vector problem
- Algorithmic Number Theory
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On lattice-based algebraic feedback shift registers synthesis for multisequences
