中文

Journal of Applied Sciences >

2013 , Vol. 31 >Issue 6: 655 - 660

DOI: https://doi.org/10.3969/j.issn.0255-8297.2013.06.016

Computer Science and Applications

Cryptanalysis against an Improved RSA Algorithm

Expand
  • 1. School of Software, Yunnan University, Kunming 650091, China
    2. Technical Support Department, Yunnan Air Traffic Management Sub-Bureau, Kunming 650200, China
    3. School of Information Science and Engineering, Yunnan University, Kunming 650091, China

Received date: 2011-03-24

  Revised date: 2013-05-31

  Online published: 2013-05-31

Fold

Abstract

 Cryptanalysis against an improved RSA algorithm, client assistant RSA algorithm (CA-RSA), is carried out by using the Jochemsz and May’s techniques for finding small roots of polynomials. We perform cryptanalytic attacks based on the LLL Lattice basis reduction algorithm. Security of the CA-RSA algorithm
with two private exponents is analyzed. CA-RSA can effectively be broken when the two decryption exponents are less than modular N to the power of 1/12.

Key words： RSA algorithm; client assistant RSA algorithm; LLL algorithm; Lattice basis reduction; Lattice attack, cryptanalysis

Cite this article

LI Yun-fei1,2,3 , LIU Qing1, LI Tong1, HAO Lin3 . Cryptanalysis against an Improved RSA Algorithm[J]. Journal of Applied Sciences, 2013 , 31(6) : 655 -660 . DOI: 10.3969/j.issn.0255-8297.2013.06.016

Options
Outlines

/

〈 〉