A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
From MaRDI portal
Publication:6175989
DOI10.1007/978-3-031-22972-5_18zbMath1519.94207MaRDI QIDQ6175989
Joop van de Pol, Yuan-Yuan Zhou, François-Xavier Standaert, Yu Yu
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Small CRT-exponent RSA revisited
- Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Leakage certification revisited: bounding model errors in side-channel security evaluations
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Partial Key Exposure on RSA with Private Exponents Larger Than N
- Partial Key Exposure Attack on CRT-RSA
- A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices
- Exponent Blinding Does Not Always Lift (Partial) Spa Resistance to Higher-Level Security
- Horizontal Correlation Analysis on Exponentiation
- Reconstructing RSA Private Keys from Random Key Bits
- Gradient Theory of Optimal Flight Paths
- Checking before output may not be enough against fault-based cryptanalysis
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Power Attack on Small RSA Public Exponent
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- Known–Plaintext–Only Attack on RSA–CRT with Montgomery Multiplication
- Attacking Exponent Blinding in RSA without CRT
- Computational Cryptography
- Convolutional Neural Networks with Data Augmentation Against Jitter-Based Countermeasures
- New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
- Power Analysis Attacks
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Partial key exposure attack on short secret exponent CRT-RSA
This page was built for publication: A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding