Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation

DOI10.1007/11496618_11MaRDI QIDQ5450897zbMATH OpenOpenAlexFDO

Authors Bodo Möller

Publication date 17 March 2008

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

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

zbMATH Keywords

Efficient implementationselliptic curve cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1950620
• Advances in Cryptology – CRYPTO 2004
• Topics in Cryptology – CT-RSA 2005
• Analysis of sliding window techniques for exponentiation
• Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems

Cited in

(11)

• Signed bits and fast exponentiation
• Analysis of sliding window techniques for exponentiation
• Analysis of the variable length nonzero window method for exponentiation
• Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Exponent Recoding and Regular Exponentiation Algorithms
• scientific article; zbMATH DE number 1950620 (Why is no real title available?)
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Applied Cryptography and Network Security
• Advances in Cryptology – CRYPTO 2004
• Minimal weight and colexicographically minimal integer representations

This page was built for publication: Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation

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