International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 49 - Issue 19 |
Published: July 2012 |
Authors: R. Santosh Kumar, C. Narasimham, S. Pallam Setty |
![]() |
R. Santosh Kumar, C. Narasimham, S. Pallam Setty . Generalization of Boneh and Durfee’s Attack for Arbitrary Public Exponent RSA. International Journal of Computer Applications. 49, 19 (July 2012), 39-42. DOI=10.5120/7880-1190
@article{ 10.5120/7880-1190, author = { R. Santosh Kumar,C. Narasimham,S. Pallam Setty }, title = { Generalization of Boneh and Durfee’s Attack for Arbitrary Public Exponent RSA }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 49 }, number = { 19 }, pages = { 39-42 }, doi = { 10.5120/7880-1190 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A R. Santosh Kumar %A C. Narasimham %A S. Pallam Setty %T Generalization of Boneh and Durfee’s Attack for Arbitrary Public Exponent RSA%T %J International Journal of Computer Applications %V 49 %N 19 %P 39-42 %R 10.5120/7880-1190 %I Foundation of Computer Science (FCS), NY, USA
In 2000, Boneh-Durfee extended the bound for low private exponent from 0. 25 (provided by wiener) to 0. 292 with public exponent size is same as modulus size. They have used powerful lattice reduction algorithm (LLL) with coppersmith's theory of polynomials. In this paper we generalize their attack to arbitrary public exponent.