The following pages link to (Q4413333):
Displaying 18 items.
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- Approximating \(x^ n\) efficiently (Q1327316) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- Arithmetically improved algorithmic performance (Q2266560) (← links)
- Fast elliptic curve point multiplication based on window non-adjacent form method (Q2335516) (← links)
- Cold Boot Attacks in the Discrete Logarithm Setting (Q2790059) (← links)
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864) (← links)
- (Q3107463) (← links)
- (Q3344058) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Jacobi Quartic Curves Revisited (Q3634512) (← links)
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains (Q3747718) (← links)
- (Q4249639) (← links)
- SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM (Q5220267) (← links)
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques (Q5426314) (← links)
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (Q5445456) (← links)
- Minimality and other properties of the width-𝑤 nonadjacent form (Q5713234) (← links)
- Fast exponentials (Q5950505) (← links)
