Efficient exponentiation in finite fields (extended abstract)

Authors:
Joachim von zur Gathen
Affiliations:
-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 2

Complexity classes

Algorithms and theory of computation handbook
On the complexity of powering in finite fields

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal sequential and parallel algorithms for exponentiation in a finite field extension are presented, assuming that a normal basis over the ground field is given.