Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography

DOI10.1007/978-3-030-65277-7_11zbMath1492.94094OpenAlexW3089994116MaRDI QIDQ2152032

Koray Karabina, Abhraneel Dutta, Aaron Hutchinson

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_11

zbMATH Keywords

elliptic curvesscalar multiplicationscalar recoding

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient arithmetic on Koblitz curves
• Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Minimum weight modified signed-digit representations and fast exponentiation
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Exponent Recoding and Regular Exponentiation Algorithms
• New directions in cryptography
• On the Evaluation of Powers
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Information Security Practice and Experience
• Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• \(d\)-MUL: optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves

This page was built for publication: Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography