Algorithms for Exponentiation in Finite Fields

Shuhong Gao, Joachim Von Zur Gathen, Daniel Panario, Victor Shoup

Research output: Contribution to journalArticle

Abstract

Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integersn , multiplication in a normal basis of Fqn over Fq can be computed with O(n logn loglog n), division with O(n log2n loglog n) operations in Fq, and exponentiation of an arbitrary element in Fqn withO (n2loglog n) operations in Fq. We also prove that using a polynomial basis exponentiation in F 2 n can be done with the same number of operations in F 2 for all n. The previous best estimates were O(n2) for multiplication in a normal basis, andO (n2log n loglog n) for exponentiation in a polynomial basis.

Original languageEnglish (US)
Pages (from-to)879-889
Number of pages11
JournalJournal of Symbolic Computation
Volume29
Issue number6
DOIs
StatePublished - Jun 2000

Fingerprint

Normal Basis
Exponentiation
Galois field
Polynomials
Polynomial Basis
Multiplication
Gauss
Division
Arbitrary
Estimate

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics

Cite this

Algorithms for Exponentiation in Finite Fields. / Gao, Shuhong; Von Zur Gathen, Joachim; Panario, Daniel; Shoup, Victor.

In: Journal of Symbolic Computation, Vol. 29, No. 6, 06.2000, p. 879-889.

Research output: Contribution to journalArticle

Gao, Shuhong ; Von Zur Gathen, Joachim ; Panario, Daniel ; Shoup, Victor. / Algorithms for Exponentiation in Finite Fields. In: Journal of Symbolic Computation. 2000 ; Vol. 29, No. 6. pp. 879-889.
@article{2bf0f8450acf40dcb8e94ffa13bc5565,
title = "Algorithms for Exponentiation in Finite Fields",
abstract = "Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integersn , multiplication in a normal basis of Fqn over Fq can be computed with O(n logn loglog n), division with O(n log2n loglog n) operations in Fq, and exponentiation of an arbitrary element in Fqn withO (n2loglog n) operations in Fq. We also prove that using a polynomial basis exponentiation in F 2 n can be done with the same number of operations in F 2 for all n. The previous best estimates were O(n2) for multiplication in a normal basis, andO (n2log n loglog n) for exponentiation in a polynomial basis.",
author = "Shuhong Gao and {Von Zur Gathen}, Joachim and Daniel Panario and Victor Shoup",
year = "2000",
month = "6",
doi = "10.1006/jsco.1999.0309",
language = "English (US)",
volume = "29",
pages = "879--889",
journal = "Journal of Symbolic Computation",
issn = "0747-7171",
publisher = "Academic Press Inc.",
number = "6",

}

TY - JOUR

T1 - Algorithms for Exponentiation in Finite Fields

AU - Gao, Shuhong

AU - Von Zur Gathen, Joachim

AU - Panario, Daniel

AU - Shoup, Victor

PY - 2000/6

Y1 - 2000/6

N2 - Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integersn , multiplication in a normal basis of Fqn over Fq can be computed with O(n logn loglog n), division with O(n log2n loglog n) operations in Fq, and exponentiation of an arbitrary element in Fqn withO (n2loglog n) operations in Fq. We also prove that using a polynomial basis exponentiation in F 2 n can be done with the same number of operations in F 2 for all n. The previous best estimates were O(n2) for multiplication in a normal basis, andO (n2log n loglog n) for exponentiation in a polynomial basis.

AB - Gauss periods yield (self-dual) normal bases in finite fields, and these normal bases can be used to implement arithmetic efficiently. It is shown that for a small prime power q and infinitely many integersn , multiplication in a normal basis of Fqn over Fq can be computed with O(n logn loglog n), division with O(n log2n loglog n) operations in Fq, and exponentiation of an arbitrary element in Fqn withO (n2loglog n) operations in Fq. We also prove that using a polynomial basis exponentiation in F 2 n can be done with the same number of operations in F 2 for all n. The previous best estimates were O(n2) for multiplication in a normal basis, andO (n2log n loglog n) for exponentiation in a polynomial basis.

UR - http://www.scopus.com/inward/record.url?scp=0000185837&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000185837&partnerID=8YFLogxK

U2 - 10.1006/jsco.1999.0309

DO - 10.1006/jsco.1999.0309

M3 - Article

VL - 29

SP - 879

EP - 889

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

SN - 0747-7171

IS - 6

ER -