On primitivity tests for polynomials

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 53-

  Rieke, A ^a   Sadeghi, A R ^b   Poguntke, W ^c  

^a UNIVERSITY OF HAGEN   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c Mäkische Fachhochschule   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; EXPONENTIATIONS; POLYNOMIALS OVER FINITE FIELDS; PRIMITIVE POLYNOMIALS;

ALGORITHMS; COMPUTER PROGRAMMING; INFORMATION THEORY;

POLYNOMIALS;

EID: 78650280860     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708634     Document Type: Conference Paper

References (3)

1. Rudolf Lidl and Harald Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, revised edition, 1994.
2. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Van-stone, Handbook of Applied Cryptography, CRC Press, Boca Raton, 1997.
3. Chae Hoon Lim and Pil Joong Lee, "More flexible exponentiation with precomputation", in Advances in Cryptology-CRYPTO '94, pp. 95-107. Springer, Berlin, 1994.