The following pages link to On the Evaluation of Powers (Q4091445):
Displayed 22 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm (Q396590) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Efficient computation of addition chains (Q1340674) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- Faster cofactorization with ECM using mixed representations (Q2055704) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography (Q2152032) (← links)
- Symbolic treatment of geometric degeneracies (Q2638833) (← links)
- A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation (Q2889996) (← links)
- Shorter addition chain for smooth integers using decomposition method (Q3101616) (← links)
- Parallel computation of the multi-exponentiation for cryptosystems (Q3123350) (← links)
- Random Order m-ary Exponentiation (Q3634511) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- On-line evaluation of powers using Euclid's algorithm (Q4858842) (← links)
- О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых в (Q4959009) (← links)
- Some active attacks on fast server-aided secret computation protocols for modular exponentiation (Q5235424) (← links)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769) (← links)
- Constructing elliptic curves over finite fields with prescribed torsion (Q5389449) (← links)
- On the computation complexity of the systems of finite abelian group elements (Q6154999) (← links)