On lattice-based algebraic feedback shift registers synthesis for multisequences
DOI10.1007/S12095-017-0230-0zbMATH Open1387.14077OpenAlexW2618643689MaRDI QIDQ1699261FDOQ1699261
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
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
latticesmultisequencesalgebraic feedback shift registersregister synthesis problemsuccessive minimal problem on lattices
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)
Cites Work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A sieve algorithm for the shortest lattice vector problem
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Algebraic coding theory
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Minkowski's Convex Body Theorem and Integer Programming
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic Shift Register Sequences
- 2-Adic shift registers
- Shift-register synthesis and BCH decoding
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- A method for solving key equation for decoding goppa codes
- Register synthesis for algebraic feedback shift registers based on non-primes
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
- On a class of arithmetic codes and a decoding algorithm (Corresp.)
- Sampling methods for shortest vectors, closest vectors and successive minima
- On the joint 2-adic complexity of binary multisequences
- Some sieving algorithms for lattice problems
- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
- Continued Fractions and Linear Recurrences
- Algebraic feedback shift registers
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Algorithmic Number Theory
- Fraction-free computation of simultaneous Padé approximants
Cited In (14)
- Title not available (Why is that?)
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- Title not available (Why is that?)
- Algebraic feedback shift registers
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
- Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers
- Register synthesis for algebraic feedback shift registers based on non-primes
- Algebraic Feedback Shift Registers Based on Function Fields
- Title not available (Why is that?)
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- AFSRs synthesis with the extended Euclidean rational approximation algorithm
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)
