A Survey of Fast Exponentiation Methods
From MaRDI portal
Cited in
(85)- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- On \(\tau\)-adic representations of integers
- Random small Hamming weight products with applications to cryptography
- A fast parallel modular exponentiation algorithm
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- On Bellman's and Knuth's problems and their generalizations
- Signed bits and fast exponentiation
- Analysis of width-w non-adjacent forms to imaginary quadratic bases
- Analysis of the variable length nonzero window method for exponentiation
- Probabilistic inductive constraint logic
- A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices
- Efficient big integer multiplication and squaring algorithms for cryptographic applications
- A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
- Stern polynomials
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
- Lifted discriminative learning of probabilistic logic programs
- On a generalization of addition chains: addition-multiplication chains
- Trading inversions for multiplications in elliptic curve cryptography
- Secure evolvable hardware for public-key cryptosystems
- How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
- A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- On the construction of short addition-subtraction chains and their applications
- Just a Little Bit More
- Accelerating oblivious transfer with batch multi-exponentiation
- A duality in space usage between left-to-right and right-to-left exponentiation
- On fast calculation of addition chains for isogeny-based cryptography
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Binary addition chain on EREW PRAM
- scientific article; zbMATH DE number 5991592 (Why is no real title available?)
- IGCC for PAPR reduction in OFDM systems over the nonlinearity of SSPA and wireless fading channels
- Modular exponentiation via the explicit Chinese remainder theorem
- Fast Point Decompression for Standard Elliptic Curves
- Fast Point Multiplication on Elliptic Curves without Precomputation
- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
- Exponent Recoding and Regular Exponentiation Algorithms
- scientific article; zbMATH DE number 4078798 (Why is no real title available?)
- Optimality of the width-w non-adjacent form: general characterisation and the case of imaginary quadratic bases
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 1024029 (Why is no real title available?)
- scientific article; zbMATH DE number 1057744 (Why is no real title available?)
- scientific article; zbMATH DE number 1950620 (Why is no real title available?)
- Fast exponentiation by folding the signed-digit exponent in half
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- A note on asynchronous multi-exponentiation algorithm using binary representation
- Non-minimality of the width-\(w\) non-adjacent form in conjunction with trace one \(\tau\)-adic digit expansions and Koblitz curves in characteristic two
- Power circuits, exponential algebra, and time complexity
- Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
- Finding the Eigenvalue in Elkies' Algorithm
- Computing special powers in finite fields
- Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
- Evaluating the cache side channel attacks against ECDSA
- A tale of three signatures: practical attack of ECDSA with wNAF
- Speeding up the elliptic curve scalar multiplication using non adjacent form
- A number system with base \(- \frac{3}{2}\)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- Efficient generation of shortest addition-multiplication chains
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
- Enhanced digital signature using RNS digit exponent representation
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
- The double-base number system and its application to elliptic curve cryptography
- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Minimality and other properties of the width-𝑤 nonadjacent form
- Fast exponentials
- Arithmetic Expression Construction.
- Verifiable decryption in the head
- Half-aggregation of Schnorr signatures with tight reductions
- Balanced non-adjacent forms
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
- A new strategy for generating shortest addition sequences
- Calculating optimal addition chains
- Star reduction among minimal length addition chains
- A fast and SPA secure scalar multiplication for elliptic curve cryptography
- Proof of necessary work: succinct state verification with fairness guarantees
- A space efficient algorithm for multiset multicover with multiplicity constraints problem via algebraic method
- Survey: recovering cryptographic keys from partial information, by example
- Improved generalized Atkin algorithm for computing square roots in finite fields
- On the number of optimal base 2 representations of integers
- Improved generation of minimal addition chains
- Applying quick exponentiation for block upper triangular matrices
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Should one always use repeated squaring for modular exponentiation?
- A low-complexity LUT-based squaring algorithm
This page was built for publication: A Survey of Fast Exponentiation Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209277)
