Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks
From MaRDI portal
Recommendations
- Improved elliptic curve multiplication methods resistant against side channel attacks
- A fast parallel elliptic curve multiplication resistant against side channel attacks
- Securing elliptic curve point multiplication against side-channel attacks
- A new method for securing elliptic scalar multiplication against side-channel attacks
- Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
Cited in
(9)- Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- There's something about m-ary. Fixed-point scalar multiplication protected against physical attacks
- A fast parallel elliptic curve multiplication resistant against side channel attacks
- Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
- Exponent Recoding and Regular Exponentiation Algorithms
- Improved elliptic curve multiplication methods resistant against side channel attacks
- Securing elliptic curve point multiplication against side-channel attacks
- Information Security and Cryptology
This page was built for publication: Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408460)