A novel leakage model in OpenSSL's Miller-Rabin primality test
From MaRDI portal
Cites work
- A coding-theoretic approach to recovering noisy RSA keys
- A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL
- Advances in Cryptology - CRYPTO 2003
- Correcting errors in RSA private keys
- Efficient Factoring Based on Partial Information
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures
- Power Analysis Attacks
- Reconstructing RSA Private Keys from Random Key Bits
- Recovering RSA secret keys from noisy key bits with erasures and errors
- RSA key recovery from digit equivalence information
- Sliding right into disaster: left-to-right sliding windows leak
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
This page was built for publication: A novel leakage model in OpenSSL's Miller-Rabin primality test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390949)
