Pages that link to "Item:Q5202278"
From MaRDI portal
The following pages link to Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278):
Displaying 27 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated (Q401474) (← links)
- Distribution results for low-weight binary representations for pairs of integers (Q596061) (← links)
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour (Q626943) (← links)
- Unbalanced digit sets and the closest choice strategy for minimal weight integer representations (Q735022) (← links)
- Fast elliptic scalar multiplication using new double-base chain and point halving (Q865543) (← links)
- The Hamming weight of the non-adjacent-form under various input statistics (Q950295) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Speeding up the computations of elliptic curves cryptoschemes (Q1356851) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- Signed bits and fast exponentiation (Q1826277) (← links)
- On the minimal Hamming weight of a multi-base representation (Q2009155) (← links)
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography (Q2152032) (← links)
- Invariant measures, matching and the frequency of 0 for signed binary expansions (Q2216022) (← links)
- Binary signed-digit integers and the Stern diatomic sequence (Q2243886) (← links)
- Symmetric digit sets for elliptic curve scalar multiplication without precomputation (Q2253194) (← links)
- Stern polynomials (Q2383531) (← links)
- Elliptic curve scalar multiplication algorithm using complementary recoding (Q2383732) (← links)
- On binary signed digit representations of integers (Q2383981) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms (Q2567414) (← links)
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems (Q2572747) (← links)
- On the construction of short addition-subtraction chains and their applications (Q2689402) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- Efficient scalar multiplication for elliptic curves over binary fields (Q3403217) (← links)
- On-line evaluation of powers using Euclid's algorithm (Q4858842) (← links)
- Matching for random systems with an application to minimal weight expansions (Q4997243) (← links)
