A secure exponentiation algorithm resistant to a combined attack on RSA implementation
From MaRDI portal
Publication:2804883
DOI10.1080/00207160.2014.935353zbMATH Open1376.94035OpenAlexW2071805062MaRDI QIDQ2804883FDOQ2804883
Dooho Choi, Hyeongdong Kim, Jae-Cheol Ha, Yongje Choi
Publication date: 6 May 2016
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.935353
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 (7)
- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
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)