A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks
From MaRDI portal
Recommendations
- Faster side-channel resistant elliptic curve scalar multiplication
- A fast parallel elliptic curve multiplication resistant against side channel attacks
- Side-channel analysis of Montgomery's representation randomization
- Improved elliptic curve multiplication methods resistant against side channel attacks
- A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
Cited in
(7)- Side-channel analysis of Montgomery's representation randomization
- Faster side-channel resistant elliptic curve scalar multiplication
- Power analysis to ECC using differential power between multiplication and squaring
- Coordinate blinding over large prime fields
- Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve
- Advances in Cryptology - EUROCRYPT 2004
- A new method for securing elliptic scalar multiplication against side-channel attacks
This page was built for publication: A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536672)