A fast and SPA secure scalar multiplication for elliptic curve cryptography
From MaRDI portal
Publication:6550487
Authors: Amadou Tall 
Publication date: 5 June 2024
Published in: Moroccan Journal of Algebra and Geometry with Applications (Search for Journal in Brave)
addition chainelliptic curve cryptographyscalar multiplicationside-channel attacksLucas chainsaddition-subtraction chainLucas addition-subtraction chains
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Calculation of integer sequences (11Y55)
Cites Work
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Faster Addition and Doubling on Elliptic Curves
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- A Survey of Fast Exponentiation Methods
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- Trading inversions for multiplications in elliptic curve cryptography
- Title not available (Why is that?)
- Some results on addition/subtraction chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Point Multiplication on Elliptic Curves without Precomputation
- A method for computing Lucas sequences
- On addition chains.
- A generalization of the Lucas addition chains
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)
