Abstract

PERALTA, Francisco I; DUCHEN, Gonzalo I  and  VAZQUEZ, Rubén. Linear Complexity and the Berlekamp-Massey Algorithm in the Construction of Pseudorandom Sequence Generators. Inf. tecnol. [online]. 2006, vol.17, n.3, pp.167-178. ISSN 0718-0764.  http://dx.doi.org/10.4067/S0718-07642006000300023.

This article presents a study on the construction of pseudorandom sequence generators. It is shown that by combining a hardware description language and the result of the Berlekamp-Massey algorithm, the function of a linear feedback shift register can be produced and implemented in a reprogrammable chip. It also shows the design of the Multispeed Generator using combinations of the generated function, and its simulation using tools provided by ALTERA^TM. Initially, we explain the use of primitive polynomials in the construction of linear feedback shift registers, and show the weakness of using only one in the generation of pseudorandom sequences. The latter justifies the use of registers on stream ciphers.

Keywords : Berlekamp-Massey; sequence generators; multispeed generator; shift registers.