Sciweavers

SODA
2004
ACM
88views Algorithms» more  SODA 2004»
14 years 10 months ago
Constructing finite field extensions with large order elements
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
Qi Cheng