AFSRs synthesis with the extended Euclidean rational approximation algorithm

DOI10.3934/AMC.2017008zbMath1357.94057OpenAlexW2588221777MaRDI QIDQ514533

Weihua Liu, Andrew Klapper

Publication date: 9 March 2017

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2017008

zbMATH Keywords

sequencesstream ciphersrational approximationextended Euclidean algorithmAFSR synthesis

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Low-dimensional lattice basis reduction revisited
• A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings
• Algebraic Shift Register Sequences
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• Shift-register synthesis and BCH decoding
• Fast Software Encryption

This page was built for publication: AFSRs synthesis with the extended Euclidean rational approximation algorithm