Generalized Framework to Attack RSA with Special Exposed Bits of the Private Key

Shixiong WANG; Longjiang QU; Chao LI; Shaojing FU

doi:10.1587/transfun.E100.A.2113

Generalized Framework to Attack RSA with Special Exposed Bits of the Private Key

Shixiong WANG, Longjiang QU, Chao LI, Shaojing FU

Full Text Views

0

Cite this

Summary :

In this paper, we study partial key exposure attacks on RSA where the number of unexposed blocks of the private key is greater than or equal to one. This situation, called generalized framework of partial key exposure attack, was first shown by Sarkar [22] in 2011. Under a certain condition for the values of exposed bits, we present a new attack which needs fewer exposed bits and thus improves the result in [22]. Our work is a generalization of [28], and the approach is based on Coppersmith's method and the technique of unravelled linearization.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.10 pp.2113-2122

Publication Date: 2017/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.2113

Type of Manuscript: PAPER

Category: Cryptography and Information Security

Authors

Shixiong WANG
  National University of Defense Technology
Longjiang QU
  National University of Defense Technology,State Key Laboratory of Cryptology
Chao LI
  National University of Defense Technology
Shaojing FU
  National University of Defense Technology,State Key Laboratory of Cryptology

Keyword

RSA, partial key exposure attack, lattice, LLL algorithm, Coppersmith's method, unravelled linearization

Cite this

Copy

Shixiong WANG, Longjiang QU, Chao LI, Shaojing FU, "Generalized Framework to Attack RSA with Special Exposed Bits of the Private Key" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 10, pp. 2113-2122, October 2017, doi: 10.1587/transfun.E100.A.2113.
Abstract: In this paper, we study partial key exposure attacks on RSA where the number of unexposed blocks of the private key is greater than or equal to one. This situation, called generalized framework of partial key exposure attack, was first shown by Sarkar [22] in 2011. Under a certain condition for the values of exposed bits, we present a new attack which needs fewer exposed bits and thus improves the result in [22]. Our work is a generalization of [28], and the approach is based on Coppersmith's method and the technique of unravelled linearization.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2113/_p

Copy

@ARTICLE{e100-a_10_2113,
author={Shixiong WANG, Longjiang QU, Chao LI, Shaojing FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalized Framework to Attack RSA with Special Exposed Bits of the Private Key},
year={2017},
volume={E100-A},
number={10},
pages={2113-2122},
abstract={In this paper, we study partial key exposure attacks on RSA where the number of unexposed blocks of the private key is greater than or equal to one. This situation, called generalized framework of partial key exposure attack, was first shown by Sarkar [22] in 2011. Under a certain condition for the values of exposed bits, we present a new attack which needs fewer exposed bits and thus improves the result in [22]. Our work is a generalization of [28], and the approach is based on Coppersmith's method and the technique of unravelled linearization.},
keywords={},
doi={10.1587/transfun.E100.A.2113},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - Generalized Framework to Attack RSA with Special Exposed Bits of the Private Key
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2113
EP - 2122
AU - Shixiong WANG
AU - Longjiang QU
AU - Chao LI
AU - Shaojing FU
PY - 2017
DO - 10.1587/transfun.E100.A.2113
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2017
AB - In this paper, we study partial key exposure attacks on RSA where the number of unexposed blocks of the private key is greater than or equal to one. This situation, called generalized framework of partial key exposure attack, was first shown by Sarkar [22] in 2011. Under a certain condition for the values of exposed bits, we present a new attack which needs fewer exposed bits and thus improves the result in [22]. Our work is a generalization of [28], and the approach is based on Coppersmith's method and the technique of unravelled linearization.
ER -