In this paper, we investigate the security property of RSA when some middle bits of the private key d are known to an attacker. Using the technique of unravelled linearization, we present a new attack on RSA with known middle bits, which improves a previous result under certain circumstance. Our approach is based on Coppersmith's method for finding small roots of modular polynomial equations.
Shixiong WANG
National University of Defense Technology
Longjiang QU
National University of Defense Technology
Chao LI
National University of Defense Technology
Shaojing FU
National University of Defense Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shixiong WANG, Longjiang QU, Chao LI, Shaojing FU, "A New Attack on RSA with Known Middle Bits of the Private Key" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 12, pp. 2677-2685, December 2015, doi: 10.1587/transfun.E98.A.2677.
Abstract: In this paper, we investigate the security property of RSA when some middle bits of the private key d are known to an attacker. Using the technique of unravelled linearization, we present a new attack on RSA with known middle bits, which improves a previous result under certain circumstance. Our approach is based on Coppersmith's method for finding small roots of modular polynomial equations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.2677/_p
Copy
@ARTICLE{e98-a_12_2677,
author={Shixiong WANG, Longjiang QU, Chao LI, Shaojing FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Attack on RSA with Known Middle Bits of the Private Key},
year={2015},
volume={E98-A},
number={12},
pages={2677-2685},
abstract={In this paper, we investigate the security property of RSA when some middle bits of the private key d are known to an attacker. Using the technique of unravelled linearization, we present a new attack on RSA with known middle bits, which improves a previous result under certain circumstance. Our approach is based on Coppersmith's method for finding small roots of modular polynomial equations.},
keywords={},
doi={10.1587/transfun.E98.A.2677},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - A New Attack on RSA with Known Middle Bits of the Private Key
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2677
EP - 2685
AU - Shixiong WANG
AU - Longjiang QU
AU - Chao LI
AU - Shaojing FU
PY - 2015
DO - 10.1587/transfun.E98.A.2677
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2015
AB - In this paper, we investigate the security property of RSA when some middle bits of the private key d are known to an attacker. Using the technique of unravelled linearization, we present a new attack on RSA with known middle bits, which improves a previous result under certain circumstance. Our approach is based on Coppersmith's method for finding small roots of modular polynomial equations.
ER -