Lower bounds on the linear complexity of the discrete logarithm in finite fields

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 2807-2811

  Meidl, W ^a   Winterhof, A ^a  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

Cyclotomic generator; Discrete logarithm; Finite fields; Linear complexity; Mullen White polynomial

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIALS; THEOREM PROVING;

CYCLOTOMIC GENERATORS;

NUMBER THEORY;

EID: 0035504014     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959261     Document Type: Article

References (15)

1. On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping
2. On cyclotomic generator of order r
3. On the linear complexity of Legendre sequences
4. Arithmetic properties of binomial coefficients. I. Binomial coefficients modulo prime powers
5. Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik
6. Linear complexity of the discrete logarithm
7. Sur les congruences des nombres euleriennes et des coefficients difféntiels des functions trigonométriques, suivant on-module premier
8. A generalization of a congruential property of Lucas
9. A polynomial representation for logarithms in GF(q)
10. Differentialrechnung bei Charakteristik p