The RSA Public Key Cryptography, Its Implementation Issues and Analysis of the Possible Attacks Against the Same.

Date of Submission

December 2007

Date of Award

Winter 12-12-2008

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Maitra, Subhamoy (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Cryptography, the subject of data security has been evolved a lot from the very early time of human communication. As the civilization progressed, more and more sophisticated ways to encrypt data have been designed. Beside that, the effort of breaking the secure data by the unauthorized people has also succeeded a lot. Naturally some new cryptosystems were required when the existing ones showed weakness. Public key cryptography has been much more popular than the symmetric key protocols since its invention. In this context, the RSA system have got the most success due to its seemingly unbreakable implementation, designed by Ron Rivest, Adi Shamir and Len Adleman. Though it is used still today in highly sensitive and crucial security purposes, its principle of unbreakability is based on the fact that factoring large integers is still infeasible even by the fastest computers ever designed so far. Moreover, careless design and parameter choosing may harm the essence of security of the same . In this paper, we do a survey on the implementation issues of the RSA protocol, some efficiency measures and the failure cases in particular situations, step by step.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.