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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ajtai, M.: The shortest vector problem in \( L^2\) is NP-hard for randomized reductions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 10–19. ACM (1998)
Arnault, F., Berger, T.P., Necer, A.: Feedback with carry shift registers synthesis with the Euclidean algorithm. IEEE Trans. Inf. Theor. 50(5), 910–917 (2004)
Dwork, C.: Lattices and their application to cryptography. Stanford University, Lecture Notes (1998)
de Weger, B.M.M.: Approximation lattices of \(p\)-adic numbers. J. Number Theor. 24(1), 70–88 (1986)
Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112–131. Springer, Heidelberg (1997)
Goresky, M., Klapper, A.: Feedback registers based on ramified extensions of the 2-adic numbers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 215–222. Springer, Heidelberg (1995)
Goresky, M., Klapper, A.: Algebraic Shift Register Sequences. Cambridge University Press, Cambridge (2012)
Klapper, A., Goresky, M.: Cryptanalysis based on 2-adic rational approximation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 262–273. Springer, Heidelberg (1995)
Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Crypt. 10(2), 111–147 (1997)
Klapper, A., Xu, J.: Algebraic feedback shift registers. Theor. Comput. Sci. 226(1), 61–92 (1999)
Klapper, A., Xu, J.: Register synthesis for algebraic feedback shift registers based on non-primes. Des. Codes Crypt. 31(3), 227–250 (2004)
Mahler, K.: On a geometrical representation of \(p\)-adic numbers. Ann. Math. 41(1), 8–56 (1940)
Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. Inf. Theor. 15(1), 122–127 (1969)
Nguyen, P.Q., Stehlé, D.: Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms (TALG) 5(4), 46 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, W., Klapper, A. (2014). A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings. In: Schmidt, KU., Winterhof, A. (eds) Sequences and Their Applications - SETA 2014. SETA 2014. Lecture Notes in Computer Science(), vol 8865. Springer, Cham. https://doi.org/10.1007/978-3-319-12325-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-12325-7_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12324-0
Online ISBN: 978-3-319-12325-7
eBook Packages: Computer ScienceComputer Science (R0)