Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors

DOI10.1007/978-3-642-36362-7_12zbMath1314.94081OpenAlexW2402561894MaRDI QIDQ4916008

Noboru Kunihiro, Tetsuya Izu, Naoyuki Shinohara

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_12

zbMATH Keywords

RSAside-channel attackkey-recoverymaximal likelihoodcold boot attack

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Recovering secrets from prefix-dependent leakage ⋮ Improved Key Recovery Algorithms from Noisy RSA Secret Keys with Analog Noise ⋮ Cold Boot Attacks in the Discrete Logarithm Setting ⋮ Towards Optimal Bounds for Implicit Factorization Problem

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Efficient pairing computation on supersingular abelian varieties
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Reconstructing RSA Private Keys from Random Key Bits
• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• Correcting Errors in RSA Private Keys
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
• A method for obtaining digital signatures and public-key cryptosystems
• A Coding-Theoretic Approach to Recovering Noisy RSA Keys
• Probability Inequalities for Sums of Bounded Random Variables
• Elements of Information Theory

This page was built for publication: Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors