A Survey of Fast Exponentiation Methods
From MaRDI portal
Publication:4209277
DOI10.1006/jagm.1997.0913zbMath0915.11064OpenAlexW2099317248WikidataQ55924007 ScholiaQ55924007MaRDI QIDQ4209277
Publication date: 23 June 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/482da61cfb06aaad135bd0df0c367d2bbec0686b
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)
Related Items (72)
Evaluating the Cache Side Channel Attacks Against ECDSA ⋮ A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation ⋮ A Tale of Three Signatures: Practical Attack of ECDSA with wNAF ⋮ A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics ⋮ Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ A fast parallel modular exponentiation algorithm ⋮ IGCC for PAPR reduction in OFDM systems over the nonlinearity of SSPA and wireless fading channels ⋮ Stern polynomials ⋮ Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ On the number of optimal base 2 representations of integers ⋮ Computing special powers in finite fields ⋮ Improved generation of minimal addition chains ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Applying quick exponentiation for block upper triangular matrices ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ A Number System with Base −32 ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ 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 ⋮ Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases ⋮ Verifiable decryption in the head ⋮ Half-aggregation of Schnorr signatures with tight reductions ⋮ Fast Point Decompression for Standard Elliptic Curves ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour ⋮ Balanced non-adjacent forms ⋮ Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two ⋮ On the construction of short addition-subtraction chains and their applications ⋮ Random small Hamming weight products with applications to cryptography ⋮ Fast Point Multiplication on Elliptic Curves without Precomputation ⋮ A new strategy for generating shortest addition sequences ⋮ Calculating optimal addition chains ⋮ Star reduction among minimal length addition chains ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ A note on asynchronous multi-exponentiation algorithm using binary representation ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques ⋮ On a generalization of addition chains: addition-multiplication chains ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY ⋮ Arithmetic Expression Construction. ⋮ Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques ⋮ A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices ⋮ Should one always use repeated squaring for modular exponentiation? ⋮ A low-complexity LUT-based squaring algorithm ⋮ Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques ⋮ 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 ⋮ Just a Little Bit More ⋮ The double-base number system and its application to elliptic curve cryptography ⋮ Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation ⋮ Securing RSA against Fault Analysis by Double Addition Chain Exponentiation ⋮ On \(\tau\)-adic representations of integers ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Probabilistic inductive constraint logic ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS ⋮ Exponent Recoding and Regular Exponentiation Algorithms ⋮ Fast exponentiation by folding the signed-digit exponent in half ⋮ Binary Addition Chain on EREW PRAM ⋮ Signed bits and fast exponentiation ⋮ Finding the Eigenvalue in Elkies' Algorithm ⋮ Modular exponentiation via the explicit Chinese remainder theorem ⋮ 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 ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ 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
This page was built for publication: A Survey of Fast Exponentiation Methods
