Lattice basis reduction algorithms and multi-dimensional continued fractions

DOI10.1016/J.FFA.2008.05.008zbMath1179.11050OpenAlexW1970028131MaRDI QIDQ958608

Li-Ping Wang

Publication date: 5 December 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2008.05.008

zbMATH Keywords

continued fractionsMultisequencesshift-register synthesislattice basis reduction algorithm

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Number-theoretic algorithms; complexity (11Y16) Continued fractions and generalizations (11J70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
• Enumeration results on the joint linear complexity of multisequences
• Analysis and design of stream ciphers
• Construction and estimation of bases in function fields
• The Jacobi-Perron algorithm its theory and application
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• Multi-Continued Fraction Algorithms and Their Applications to Sequences
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• Fast Hashing and Stream Encryption with Panama

This page was built for publication: Lattice basis reduction algorithms and multi-dimensional continued fractions