Fast elliptic scalar multiplication using new double-base chain and point halving

DOI10.1016/J.AMC.2006.05.111zbMath1126.94015OpenAlexW2035549799MaRDI QIDQ865543

N. E. Zubov

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.111

zbMATH Keywords

point halvingdouble-base chainelliptic curve cryptography (ECC)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Halving for the 2-Sylow subgroup of genus 2 curves over binary fields ⋮ Lower bounds on the lengths of double-base representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient arithmetic on Koblitz curves
• Trading inversions for multiplications in elliptic curve cryptography
• Elliptic Curve Cryptosystems
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Minimality of the Hamming Weight of the τ-NAF for Koblitz Curves and Improved Combination with Point Halving
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Public Key Cryptography – PKC 2004

This page was built for publication: Fast elliptic scalar multiplication using new double-base chain and point halving