A Synoptic of Software Implementation for Shift Registers Based on 16th Degree Primitive Polynomials

Mirella Amelia Mioc

Abstract


Almost all of the major applications in the specific Fields of Communication used a well-known device called Linear Feedback Shift Register. Usually LFSR functions in a Galois Field GF(2n), meaning that all the operations are done with arithmetic modulo n degree Irreducible  and especially  Primitive Polynomials. Storing data in Galois Fields allows effective and manageable manipulation, mainly in computer cryptographic applications. The analysis of functioning for Primitive Polynomials of 16th degree shows that almost all the obtained results are in the same time distribution.

Keywords


Cryptosystem, Irreducible polynomials, Pseudo-Random Sequence, Primitive Polynomials, Shift Registers

Full Text:

PDF


(C) 2010-2017 EduSoft