Linear Recurrent Sequences over finite Field and Applications in Cryptography
The linear recurrent sequences, specifically those of maximum periods are important in eryptography.
Indeed, the problem of generating eneryption keys, confidentiality and the authentication of the sender of a secret message or not, is among those being tackled by the key cryptography. The linear recurrent sequences of maximum periods could be very good candidates to suive this problem. But still, they have certain weaknesses before the Berlekamp-Massey algorithm. This led Lidl and Niederreiter  to introduce the multiplexed sequences to prevent the Berlekamp-Massey algorithm on the linear rocouent sequences.
The aim of our contribution is to introduce a classification of multiplexed sequences in order to provide a means to attack these sequences.
Auteur(s) : O. DIANKHA and C. B. DEME
Pages : 193–209.
Année de publication : 20011
Revue : JP. Journal of Algebra, , Number Theory & Applications
N° de volume : 22, Number 2
Type : Article
Mise en ligne par : DIANKHA Oumar