Pages that link to "Item:Q685709"
From MaRDI portal
The following pages link to Efficient and optimal exponentiation in finite fields (Q685709):
Displaying 17 items.
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm (Q512336) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Applying quick exponentiation for block upper triangular matrices (Q865509) (← links)
- Processor-efficient exponentiation in finite fields (Q1186580) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Message encoding and retrieval for spread and cyclic orbit codes (Q1696050) (← links)
- A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices (Q2250225) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Circuit complexity of powering in fields of odd characteristic (Q3187179) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- (Q4502775) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- On Orders of Optimal Normal Basis Generators (Q4846174) (← links)
- An Algorithm for Computing Optimal Exponent Pairs (Q5184976) (← links)
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm (Q5270844) (← links)
- Efficient Primitives from Exponentiation in ℤ p (Q5757721) (← links)