A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings

Abstract

Algebraic feedback shift registers (AFSRs) [10] are pseudo-random sequence generators that generalize linear feedback shift registers (LFSRs) and feedback with carry shift registers (FCSRs). With a general setting, AFSRs can result in sequences over an arbitrary finite field. It is well known that the sequences generated by LFSRs can be synthesized by either the Berlekamp-Massey algorithm or the extended Euclidean algorithm. There are three approaches to solving the synthesis problem for FCSRs, one based on the Euclidean algorithm [2], one based on the theory of approximation lattices [8] and Xu’s algorithm which is also used for some AFSRs [11]. Xu’s algorithm, an analog of the Berlekamp-Massey algorithm, was proposed by Xu and Klapper to solve the AFSR synthesis problem. In this paper we describe an approximation algorithm that solves the AFSR synthesis problem based on low-dimensional lattice basis reduction [14]. It works for AFSRs over quadratic integer rings $\mathbb {Z}[\sqrt{D}]$ with quadratic time complexity. Given the first $2\varphi _\pi (\mathbf {a})+c$ elements of a sequence $\mathbf {a}$, it finds the smallest AFSR that generates $\mathbf {a}$, where $\varphi _\pi (\mathbf {a})$ is the $\pi$-adic complexity of $\mathbf {a}$ and $c$ is a constant.

This material is based upon work supported by the National Science Foundation under Grant No. CNS-1420227. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.