The soft graphic integer sub-decomposition method for elliptic scalar multiplication

DOI10.1080/09720529.2021.1885808zbMath1483.94029OpenAlexW3203295969WikidataQ114099781 ScholiaQ114099781MaRDI QIDQ5035834

Ruma Kareem K. Ajeena

Publication date: 22 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2021.1885808

zbMATH Keywords

computational complexityelliptic curve cryptographyscalar multiplicationsoft graphsISD methodSG-ISD method

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (05C99)

Cites Work

• Elliptic curve scalar multiplication algorithm using complementary recoding
• Handbook of Graph Theory
• Highly Regular Right-to-Left Algorithms for Scalar Multiplication
• High-Performance Architecture of Elliptic Curve Scalar Multiplication
• An Introduction to Mathematical Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The soft graphic integer sub-decomposition method for elliptic scalar multiplication