computational complexity

, Volume 1, Issue 4, pp 360-394

First online:

Efficient and optimal exponentiation in finite fields

  • Joachim von zur GathenAffiliated withDepartment of Computer Science, University of Toronto

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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

Subject classifications

68Q40 11Y16 12Y05