On the construction of finite field elements of large order

  • Cheng Q
  • 3


    Mendeley users who have this article in their library.
  • 11


    Citations of this article.


In numerous applications involving finite fields, we often need high-order elements. Ideally we should be able to obtain a primitive element for any finite field in reasonable time. However, if the prime factorization of the group order is unknown, we do not know how to achieve the goal. We thus turn our attentions to a less ambitious problem: constructing an element of provably high order. In this paper, we survey various algorithms that find an element of high order for general or special finite fields. © 2005 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Algorithm
  • Group order

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Qi Cheng

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free