On shortest linear recurrences
Journal of Symbolic Computation
Shift Register Sequences
Finding an internal state of RC4 stream cipher
Information Sciences: an International Journal
Fast S-box security mechanism research based on the polymorphic cipher
Information Sciences: an International Journal
WG: A family of stream ciphers with designed randomness properties
Information Sciences: an International Journal
On the linear complexity of some new q-ary sequences
Information Sciences: an International Journal
Special distribution of the shortest linear recurring sequences in Z/(p) field
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
A generalized Euclidean algorithm for multisequence shift-register synthesis
IEEE Transactions on Information Theory
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
Observability of permutations, and stream ciphers
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Multi-continued fraction algorithm and generalized B--M algorithm over Fq
Finite Fields and Their Applications
| Hi-index | 0.07 |
The distribution of the shortest linear recurrence (SLR) sequences in the Z/(p) field and over the Z/(p^e) ring is studied. It is found that the length of the shortest linear recurrent (SLRL) is always equal to n/2, if n is even and n/2+1 if n is odd in the Z/(p) field, respectively. On the other hand, over the Z/(p^e) ring, the number of sequences with length n can also be calculated. The recurring distribution regulation of the shortest linear recurring sequences is also found. To solve the problem of calculating the SLRL, a new simple representation of the Berlekamp-Massey algorithm is developed as well.