Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$

TL;DRAbstract

A normal basis representation of $\operatorname{GF}(2^{n})$ allows squaring to be accomplished by a cyclic shift. Algorithms for multiplication in $\operatorname{GF}(2^{n})$ using a normal basis have been studied by several researchers. In this paper, algorithms for performing exponentiation in $\operatorname{GF}(2^{n})$ using a normal basis, and how they can be speeded up by using parallelization, are investigated.

Chat with Paper

AI Agents for this Paper