Efficient exponentiation using precomputation and vector addition chains

DOI10.1007/BFB0053453MaRDI QIDQ4365757zbMATH OpenFDO

Authors Peter de Rooij

Publication date 14 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053453

zbMATH Keywords

efficient algorithmexponentiation with precomputationvector addition chains

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• More flexible exponentiation with precomputation
• scientific article; zbMATH DE number 503339
• A note on speeding up exponentiation by precomputation

Cited in

(25)

• Reusing nonces in Schnorr signatures (and keeping it secure...)
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
• The Brun gcd algorithm in high dimensions is almost always subtractive
• Speeding up exponentiation using an untrusted computational resource
• On the construction of short addition-subtraction chains and their applications
• Accelerating oblivious transfer with batch multi-exponentiation
• A note on speeding up exponentiation by precomputation
• Binary addition chain on EREW PRAM
• Twisted Edwards Curves Revisited
• Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
• scientific article; zbMATH DE number 177037 (Why is no real title available?)
• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• scientific article; zbMATH DE number 1950620 (Why is no real title available?)
• ECM using Edwards curves
• More flexible exponentiation with precomputation
• Improving and extending the Lim/Lee exponentiation algorithm
• Primitive element pairs with a prescribed trace in the cubic extension of a finite field
• Faster Addition and Doubling on Elliptic Curves
• A new strategy for generating shortest addition sequences
• Star reduction among minimal length addition chains
• Rational approximations, multidimensional continued fractions, and lattice reduction
• Fast elliptic curve scalar multiplications in SN(T)ARK circuits
• Faster signature verification with 3-dimensional decomposition
• Mechanically proving termination using polynomial interpretations

This page was built for publication: Efficient exponentiation using precomputation and vector addition chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365757)