Improved techniques for fast exponentiation

DOI10.1007/3-540-36552-4_21MaRDI QIDQ4413333zbMATH OpenFDO

Authors Bodo Möller

Publication date 17 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2587/25870298.htm

zbMATH Keywords

algorithmsexponentiationfractional window

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Analysis of sliding window techniques for exponentiation
• Efficient exponentiation using precomputation and vector addition chains
• A Survey of Fast Exponentiation Methods
• Improving and extending the Lim/Lee exponentiation algorithm

Cited in

(26)

• Approximating \(x^ n\) efficiently
• Analysis of sliding window techniques for exponentiation
• Delegating a product of group exponentiations with application to signature schemes
• Arithmetically improved algorithmic performance
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Cold boot attacks in the discrete logarithm setting
• A note on speeding up exponentiation by precomputation
• On fast calculation of addition chains for isogeny-based cryptography
• scientific article; zbMATH DE number 5991592 (Why is no real title available?)
• scientific article; zbMATH DE number 3879021 (Why is no real title available?)
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Jacobi Quartic Curves Revisited
• Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
• How to improve an exponentiation black-box
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• scientific article; zbMATH DE number 2162686 (Why is no real title available?)
• More flexible exponentiation with precomputation
• Improving and extending the Lim/Lee exponentiation algorithm
• SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Minimality and other properties of the width-𝑤 nonadjacent form
• Fast exponentials
• Survey: recovering cryptographic keys from partial information, by example
• Improved batch exponentiation

This page was built for publication: Improved techniques for fast exponentiation

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