Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
From MaRDI portal
Recommendations
- On double exponentiation for securing RSA against fault analysis
- Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT
- A secure exponentiation algorithm resistant to a combined attack on RSA implementation
- Public Key Perturbation of Randomized RSA Implementations
- Fault attacks against RSA-CRT implementation
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A practical countermeasure against address-bit differential power analysis.
- A Survey of Fast Exponentiation Methods
- Analysis of sliding window techniques for exponentiation
- Checking before output may not be enough against fault-based cryptanalysis
- Chinese remaindering based cryptosystems in the presence of faults
- scientific article; zbMATH DE number 1088257 (Why is no real title available?)
- scientific article; zbMATH DE number 1149907 (Why is no real title available?)
- scientific article; zbMATH DE number 1979280 (Why is no real title available?)
- scientific article; zbMATH DE number 1979289 (Why is no real title available?)
- scientific article; zbMATH DE number 1504807 (Why is no real title available?)
- scientific article; zbMATH DE number 1504818 (Why is no real title available?)
- scientific article; zbMATH DE number 1759669 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2085203 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- Perturbating RSA Public Keys: An Improved Attack
- Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms
- The doubling attack -- why upwards is better than downwards.
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(14)- On the use of RSA public exponent to improve implementation efficiency and side-channel resistance
- A secure exponentiation algorithm resistant to a combined attack on RSA implementation
- How to Fix Two RSA-Based PVSS Schemes—Exploration and Solution
- Fault attacks on the Montgomery powering ladder
- Trade-off approaches for leak resistant modular arithmetic in RNS
- RSA cryptosystem with fuzzy set theory for encryption and decryption
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms
- scientific article; zbMATH DE number 1759668 (Why is no real title available?)
- Combined attack on CRT-RSA. Why public verification must not be public?
- Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT
- Making RSA–PSS Provably Secure against Non-random Faults
- On double exponentiation for securing RSA against fault analysis
- Topics in Cryptology – CT-RSA 2004
- Lightweight fault detection architecture for modular exponentiation in cryptography on ARM and FPGA
This page was built for publication: Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623066)
