AUTHORS: Antoniya Tasheva, Zhaneta Savova-Tasheva, Boyan Petrov, Kamen Stoykov

Download as PDF

ABSTRACT: This paper focuses on a method for construction both Galois and Fibonacci p-ary LFSRs. Theorems for the transformations of the primitive polynomial generating the extended Galois field GF(p L ) that need to be done in order to receive the values of the multiplier coefficients of the register’s feedback polynomial are proven. An algorithm for the transformation is proposed.

KEYWORDS: pLFSR, primitive polynomial, feedback polynomial, feedback multipliers, Galois LFSR, Fibonacci LFSR

REFERENCES:

[1] Arnault, François, Thierry Berger, Marine Minier, and Benjamin Pousse. 'Revisiting LFSRs for cryptographic applications.' Information Theory, IEEE Transactions on Volume 57, Number 12, 2011, pp. 8095-8113.

[2] Gong, Guang. 'Sequence analysis.' Lecture Notes for CO739x, 1999, ps. 137.

[3] M. Goresky, A. Klapper, Fibonacci and Galois Representations of Feedback-With-Carry Shift Registers, IEEE Trans. on Inform. Theory, vol. 48, pp. 2826−2836, November 2002.

[4] Goresky, Mark, and Andrew Klapper. Algebraic Shift Register Sequences. Cambridge University Press. 2012, ps. 514.

[5] Klein, Andreas. Stream Ciphers. SpringerVerlag London. 2013, ps. 399.

[6] Lidl, Rudolf. Introduction to finite fields and their applications. Cambridge university press, 1994, ps. 415.

[7] W. Li and X. Yang, 'A Parallel and Reconfigurable United Architecture for Fibonacci and Galois LFSR,' 2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics, Hangzhou, 2015, pp. 203-206.

[8] G. Mrugalski, J. Rajski and J. Tyszer, Ring generators - new devices for embedded test applications, IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, vol. 23, no. 9, pp. 1306-1320, Sept. 2004.