How Many Bits have to be Changed to Decrease the Linear Complexity?
Designs, Codes and Cryptography
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
Interpolation of functions related to the integer factoring problem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Polynomial representations of the Lucas logarithm
Finite Fields and Their Applications
| Hi-index | 754.84 |
Let p be a prime, r a positive integer, q=pr, and d a divisor of p(q-1). We derive lower bounds on the linear complexity over the residue class ring Zd of a (q-periodic) sequence representing the residues modulo d of the discrete logarithm in Fq . Moreover, we investigate a sequence over Fq representing the values of a certain polynomial over Fq introduced by Mullen and White (1986) which can be identified with the discrete logarithm in Fq via p-adic expansions and representations of the elements of Fq with respect to some fixed basis