Some Observations on Parallel Algorithms for Fast Exponentiation in \operatorname{GF}(2ⁿ)
From MaRDI portal
Publication:3474890
Recommendations
- scientific article; zbMATH DE number 4078798
- Some remarks on parallel exponentiation (extended abstract)
- On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
- A parallel architecture for computing multiplication in \(\text{GF}(2^m)\)
- Fast Parallel GF(2^m) Polynomial Multiplication for All Degrees
- Parallel algorithms for modular multi-exponentiation
- On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)
- Efficient parallel exponentiation in using normal basis representations
- Fast parallel modular exponentiation
Cited in
(13)- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Processor-efficient exponentiation in finite fields
- Arithmetic operations in \(GF(2^ m)\)
- Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube
- Algorithms for exponentiation in finite fields
- Constructing normal bases in finite fields
- Algorithm for squaring in GF(2m) in standard basis
- Some remarks on parallel exponentiation (extended abstract)
- scientific article; zbMATH DE number 4078798 (Why is no real title available?)
- Efficient parallel exponentiation in using normal basis representations
- Computing special powers in finite fields
- On Orders of Optimal Normal Basis Generators
- Efficient and optimal exponentiation in finite fields
This page was built for publication: Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474890)
