Fast simultaneous scalar multiplication

DOI10.1016/j.amc.2007.03.017zbMath1193.65050OpenAlexW2069609240MaRDI QIDQ990540

E. Karthikeyan, Pagavathigounder Balasubramaniam

Publication date: 1 September 2010

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

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

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationnon-adjacent formcomplementary recodingjoint-sparse form

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computer aspects of numerical algorithms (65Y99) Error analysis and interval analysis (65G99)

Cites Work

• Unnamed Item
• Elliptic curve cryptosystems and their implementation
• Elliptic curve scalar multiplication algorithm using complementary recoding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology – CRYPTO 2004
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Fast simultaneous scalar multiplication