Pages that link to "Item:Q3474890"

The following pages link to Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ (Q3474890):

Displaying 11 items.

• Efficient and optimal exponentiation in finite fields (Q685709) (← links)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276) (← links)
• Processor-efficient exponentiation in finite fields (Q1186580) (← links)
• Arithmetic operations in \(GF(2^ m)\) (Q1207693) (← links)
• Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube (Q1325982) (← links)
• Algorithms for exponentiation in finite fields (Q1581128) (← links)
• Constructing normal bases in finite fields (Q2639102) (← links)
• Algorithm for squaring in GF(2m) in standard basis (Q3203112) (← links)
• (Q3809261) (← links)
• Computing special powers in finite fields (Q4813594) (← links)
• On Orders of Optimal Normal Basis Generators (Q4846174) (← links)