Pages that link to "Item:Q4209277"
From MaRDI portal
The following pages link to A Survey of Fast Exponentiation Methods (Q4209277):
Displaying 27 items.
- Exponent Recoding and Regular Exponentiation Algorithms (Q3637149) (← links)
- (Q3809261) (← links)
- Fast exponentiation by folding the signed-digit exponent in half (Q4462117) (← links)
- Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two (Q4600710) (← links)
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY (Q4649509) (← links)
- Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques (Q4652740) (← links)
- Finding the Eigenvalue in Elkies' Algorithm (Q4736655) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- Evaluating the Cache Side Channel Attacks Against ECDSA (Q5040404) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form (Q5069746) (← links)
- A Number System with Base −32 (Q5082415) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
- EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS (Q5220293) (← links)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769) (← links)
- Enhanced Digital Signature Using RNS Digit Exponent Representation (Q5267801) (← links)
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques (Q5426314) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic (Q5448548) (← links)
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations (Q5452254) (← links)
- Minimality and other properties of the width-𝑤 nonadjacent form (Q5713234) (← links)
- Fast exponentials (Q5950505) (← links)
- Arithmetic Expression Construction. (Q6065408) (← links)
- Half-aggregation of Schnorr signatures with tight reductions (Q6109444) (← links)
- Balanced non-adjacent forms (Q6157562) (← links)
- A fast and SPA secure scalar multiplication for elliptic curve cryptography (Q6550487) (← links)
- Proof of necessary work: succinct state verification with fairness guarantees (Q6573988) (← links)