Remarks on the bounds for cryptanalysis of low private key RSA

Autor:	Daoshun Wang, Haijian Zhou, Ping Luo, Yiqi Dai
Rok vydání:	2009
Předmět:	Discrete mathematics Public-key cryptography business.industry law General Materials Science Lattice reduction Arithmetic business Cryptanalysis General Upper and lower bounds Mathematics law.invention
Zdroj:	Progress in Natural Science. 19(10):1327-1331
ISSN:	1002-0071
DOI:	10.1016/j.pnsc.2008.09.013
Popis:	Boneh and Durfee have developed a cryptanalytic algorithm on low private key RSA. The algorithm is based on lattice basis reduction and breaks RSA with private key d N 0.292 . Later on, an improved version by Blomer and May enhanced the efficiency, while reaching approximately this same upper bound. Unfortunately, in both the algorithms, there is a critical error in theoretical analysis, leading to the overestimated upper bound N 0.292 . In this paper we present a more precise analytical model, with which the theoretical upper bound on d is modified to approximately d N 0.277 for ordinary RSA systems with a 1024-bit public key ( N , e ) .
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6614bae418b367498b85bf2f727ebda9 Zobrazit plný text záznamu Full Text from ScienceDirect