computational complexity

, Volume 1, Issue 4, pp 360–394

Efficient and optimal exponentiation in finite fields

Authors

  • Joachim von zur Gathen
    • Department of Computer ScienceUniversity of Toronto
Article

DOI: 10.1007/BF01212964

Cite this article as:
von zur Gathen, J. Comput Complexity (1991) 1: 360. doi:10.1007/BF01212964

Abstract

Optimal sequential and parallel algorithms for exponentiation in a finite field containing Fq are presented, assuming thatqth powers can be computed for free.

Subject classifications

68Q4011Y1612Y05

Copyright information

© Birkhäuser Verlag 1991