Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (4) , 711-717
- https://doi.org/10.1137/0219049
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- Arithmetic operations inGF(2 m )Journal of Cryptology, 1993
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- Very Fast Parallel Polynomial ArithmeticSIAM Journal on Computing, 1989
- The parallel complexity of exponentiating polynomials over finite fieldsJournal of the ACM, 1988
- Fast Exponentiation in GF(2n)Published by Springer Nature ,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