Small Secret Exponent Attack on Multiprime RSA
Santosh Kumar R1, Narasimham Ch2, Pallam Setty S3
1Santosh kumar ravva, Department, of IT, MVGR college of engineering, Vizianagaram, INDIA.
2D. Ghosh, Department of ECE, Future Institute of Engineering & Management, Kolkata,India.
3D. Ghosh, Department of ECE, Future Institute of Engineering & Management, Kolkata, India.
Manuscript received on April 06, 2013. | Revised Manuscript received on April 28, 2013. | Manuscript published on May 05, 2013. | PP: 132-134 | Volume-3, Issue-2, May 2013. | Retrieval Number: B1462053213/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Lattice reduction is a powerful algorithm for cryptanalyzing public key cryptosystems, especially RSA. There exist several attacks on RSA by using the lattice reduction techniques. In this paper, we attack on the version of RSA, called Multiprime RSA, by using the lattice reduction techniques.
Keywords: Lattice reduction, Multiprime RSA, Unravelled linearization.