Randomized signed-scalar multiplication of ECC to resist power attacks
From MaRDI portal
Recommendations
- A novel elliptic curve scalar multiplication algorithm against power analysis
- A new elliptic curve scalar multiplication algorithm to resist simple power analysis
- Applied Cryptography and Network Security
- Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
- Randomized addition-subtraction chains as a countermeasure against power attacks
Cited in
(14)- On \(\tau\)-adic representations of integers
- On binary signed digit representations of integers
- Methods for increasing the resistance of cryptographic designs against horizontal DPA attacks
- Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
- A new elliptic curve scalar multiplication algorithm to resist simple power analysis
- An efficient countermeasure against correlation power-analysis attacks with randomized Montgomery operations for DF-ECC processor
- Cryptanalysis of the countermeasures using randomized binary signed digits
- A novel elliptic curve scalar multiplication algorithm against power analysis
- Randomized addition-subtraction chains as a countermeasure against power attacks
- Preventing SPA/DPA in ECC systems using the Jacobi form
- A more flexible countermeasure against side channel attacks using window method.
- Selected Areas in Cryptography
- Applied Cryptography and Network Security
- Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
This page was built for publication: Randomized signed-scalar multiplication of ECC to resist power attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425742)
