A fast and SPA secure scalar multiplication for elliptic curve cryptography

MaRDI QIDQ6550487zbMATH OpenFDO

Authors Amadou Tall

Publication date 5 June 2024

Published in Moroccan Journal of Algebra and Geometry with Applications (Search for Journal in Brave)

zbMATH Keywords

addition chainelliptic curve cryptographyscalar multiplicationside-channel attacksLucas chainsaddition-subtraction chainLucas addition-subtraction chains

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Calculation of integer sequences (11Y55)

Recommendations

• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• Information Security and Privacy
• scientific article; zbMATH DE number 2085437
• scientific article; zbMATH DE number 1950345
• An efficient method against side-channel attacks on ECC

Cites work

• scientific article; zbMATH DE number 5968524 (Why is no real title available?)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 708817 (Why is no real title available?)
• scientific article; zbMATH DE number 1878345 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• A generalization of the Lucas addition chains
• A method for computing Lucas sequences
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Elliptic Curve Cryptosystems
• Fast Point Multiplication on Elliptic Curves without Precomputation
• Faster Addition and Doubling on Elliptic Curves
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• On addition chains.
• Some results on addition/subtraction chains
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Trading inversions for multiplications in elliptic curve cryptography

This page was built for publication: A fast and SPA secure scalar multiplication for elliptic curve cryptography

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