| Popis: |
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. The theory of linear recurrence sequences(LRS) over finite field has great importance in cryptography, electric engineering and pseudo-random number generators. Linear recurring sequences and polynomials over finite field Fq are closely related. The least period of recurring sequences are discussed with the reducibility of corresponding characteristic polynomials. Few examples are constructed to find the least period of linear recurring sequences having reducible or irreducible characteristic polynomials. |
