Generalization of Boneh and Durfee's Attack for Arbitrary Public Exponent RSA

Autor:	C. Narasimham, R. SantoshKumar, S. Pallam Setty
Rok vydání:	2012
Předmět:	Discrete mathematics Polynomial Public exponent Theoretical computer science Computer science Generalization Modulus Lattice reduction Computer Science::Cryptography and Security
Zdroj:	International Journal of Computer Applications. 49:39-42
ISSN:	0975-8887
DOI:	10.5120/7880-1190
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d25b444f2952c3eed670151a006a41db https://doi.org/10.5120/7880-1190 Zobrazit plný text záznamu