Constructing finite field extensions with large order elements

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1123-1124

  Cheng, Qi ^a  

^a University of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

FACTORIZATION; FINITE FIELD EXTENSIONS;

COMPUTATION THEORY;

EID: 1842434436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Agrawal, N. Kayal, and N. Saxena. Primes is in P. http://www.cse.iitk. ac.in/news/primality.pdf, 2002.
2. D. J. Bernstein. Proving primality in essentially quartic random time. http://cr.yp.to/papers/quartic.pdf, 2003.
3. Pedro Berrizbeitia. Sharpening "primes is in p" for a large family of numbers. http://lanl.arxiv.org/abs/math.NT/0211334, 2002.
4. Qi Cheng. Primality proving via one round in ECPP and one iteration in AKS. In Dan Boneh, editor, Proc. of the 23rd Annual International Cryptology Conference, volume 2729 of Lecture Notes in Computer Science, Santa Barbara, 2003. Springer-Verlag.
5. Shuhong Gao. Elements of provable high orders in finite fields. Proc. American Mathematical Society, 127:1615-1623, 1999.
6. J. von zur Gathen and Igor Shparlinski. Gauss periods in finite fields. In Proc. 5th Conference of Finite Fields and their Applications, pages 162-177. Springer-Verlag, 1999.