A secure exponentiation algorithm resistant to a combined attack on RSA implementation
From MaRDI portal
Publication:2804883
Recommendations
- Combined implementation attack resistant exponentiation
- Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT
- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
- Combined attack on CRT-RSA. Why public verification must not be public?
- Attacking Exponent Blinding in RSA without CRT
Cites work
Cited in
(9)- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding
- Combined attack on CRT-RSA. Why public verification must not be public?
- scientific article; zbMATH DE number 1950337 (Why is no real title available?)
- scientific article; zbMATH DE number 5846081 (Why is no real title available?)
- Topics in Cryptology – CT-RSA 2004
- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
- Applied Cryptography and Network Security
- Further Research on N-1 Attack against Exponentiation Algorithms
- Combined implementation attack resistant exponentiation
This page was built for publication: A secure exponentiation algorithm resistant to a combined attack on RSA implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804883)