The linear recurrent sequences, specifically those of maximum periods are important in cryptography. Indeed, the problem of generating encryption 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 solve this problem. But still, they have certain weaknesses before the Berlekamp-Massey algorithm. This led Lidl and Niederreiter [4] to introduce the multiplexed sequences to prevent the Berlekamp-Massey algorithm on the linear recurrent sequences. The aim of our contribution is to introduce a classification of multiplexed sequences in order to provide a means to attack these sequences.

linear recurrent sequences, multiplexed sequences, field, class of multiplexed sequences, surjective, injective, sets, subsets, intermediate subsets, number of disjoint subsets, cardinal of the class, period maximal.