Efficient scalar multiplication for elliptic curves over binary fields

DOI10.1007/s11859-008-0616-0zbMath1199.68132OpenAlexW2067780672MaRDI QIDQ3403217

Ya Liu, Haihua Gu, Da-Wu Gu

Publication date: 12 February 2010

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11859-008-0616-0

zbMATH Keywords

projective coordinatesscalar multiplicationelliptic curve cryptosystemdouble-base number system

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Efficient arithmetic on Koblitz curves
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• The double-base number system and its application to elliptic curve cryptography
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient scalar multiplication for elliptic curves over binary fields