Fast simultaneous scalar multiplication

DOI10.1016/J.AMC.2007.03.017zbMATH Open1193.65050OpenAlexW2069609240MaRDI QIDQ990540FDOQ990540

Authors: E. Karthikeyan, P. 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

Recommendations

• Elliptic curve scalar multiplication algorithm using complementary recoding
• scientific article; zbMATH DE number 1941262
• scientific article; zbMATH DE number 2219248
• scientific article; zbMATH DE number 2085210
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationnon-adjacent formcomplementary recodingjoint-sparse form

Mathematics Subject Classification ID

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

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Elliptic Curve Cryptosystems
• Advances in Cryptology – CRYPTO 2004
• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• Elliptic curve cryptosystems and their implementation
• Elliptic curve scalar multiplication algorithm using complementary recoding

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate computation of scalar products
• Fast multiplication and sparse structures
• Title not available (Why is that?)

This page was built for publication: Fast simultaneous scalar multiplication

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