On the Improvement of Wiener Attack on RSA with Small Private Exponent

RSA system is based on the hardness of the integer factorization problem (IFP). Given an RSA modulus N = pq, it is difficult to determine the prime factors p and q efficiently. One of the most famous short exponent attacks on RSA is the Wiener attack. In 1997, Verheul and van Tilborg use an exhausti...

Descripción completa

Detalles Bibliográficos
Autores principales: Wu, Mu-En, Chen, Chien-Ming, Lin, Yue-Hsun, Sun, Hung-Min
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3985315/
https://www.ncbi.nlm.nih.gov/pubmed/24982974
http://dx.doi.org/10.1155/2014/650537

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3985315/
https://www.ncbi.nlm.nih.gov/pubmed/24982974
http://dx.doi.org/10.1155/2014/650537

Ejemplares similares