Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
Author:
- D. R. StinsonDSD. R. Stinson
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (4) , 711-717
Abstract
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.
Keywords
This publication has 9 references indexed in Scilit:
- Inversion in finite fields using logarithmic depthJournal of Symbolic Computation, 1990
- Very Fast Parallel Polynomial ArithmeticSIAM Journal on Computing, 1989
- The parallel complexity of exponentiating polynomials over finite fieldsJournal of the ACM, 1988
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1988
- Fast Exponentiation in GF(2n)1988
- Logarithmic Depth Circuits for Algebraic FunctionsSIAM Journal on Computing, 1986
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976