Improved fixed-base comb method for fast scalar multiplication

DOI10.1007/978-3-642-31410-0_21MaRDI QIDQ2900633zbMATH OpenOpenAlexFDO

Authors Nashwa A. F. Mohamed, Michael Hutter, Mohsin H. A. Hashim

Publication date 23 July 2012

Published in Progress in Cryptology - AFRICACRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31410-0_21

zbMATH Keywords

scalar multiplicationnon-adjacent formelliptic-curve cryptosystemLim-Lee methodTsaur-Chou methodwidth-\(\omega \) NAF

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 2048533
• Some ways to secure elliptic curve cryptosystems
• scientific article; zbMATH DE number 2219248
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Improved precomputation scheme for scalar multiplication on elliptic curves

Cited in

(1)

• Simplified small exponent test for batch verification

This page was built for publication: Improved fixed-base comb method for fast scalar multiplication

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