Title :
The additional result over the work of Blomer and May
Author :
Ojha, Navaneet ; Padhye, Sahadeo
Author_Institution :
Dept. of Math., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
Abstract :
In this paper we improve the range of weak keys of RSA cryptosystem for the Generalized Wiener´s attack given by Blomer & May. We have shown that the range of weak keys can be extended by more than 8 times than the range given by Blomer & May. Further we have shown that for some special condition, N can be factored in (O poly(log N)) time.
Keywords :
computational complexity; public key cryptography; Blomer & May; RSA cryptosystem; generalized Wiener attack; Artificial neural networks; Communications technology; Computers; Polynomials; Public key; Continued fractions; Coppersmith´s method; RSA; Wiener´s attack;
Conference_Titel :
Computer and Communication Technology (ICCCT), 2010 International Conference on
Conference_Location :
Allahabad, Uttar Pradesh
Print_ISBN :
978-1-4244-9033-2
DOI :
10.1109/ICCCT.2010.5640387
