A Explication of the RSA Algorithm
A
Term Paper
On
RSA
Subject: Information System and Cyber Laws
Bachelor of Technology
In
Computer Science & Engineering
Session: 2012-13
Submitted to: Submitted by:
Ms. Shruti Saxena Arpit Varshney Roll No.1012210026 Group: 61
SHRI RAMSWAROOP MEMORIAL Group OF
PROFESSIONAL COLLEGES, LUCKNOW
Affiliated to
G.B. TECHNICAL UNIVERSITY, LUCKNOW
INTRODUCTION
* RSA is an algorithm for public-key cryptography that is based on the presumed difficulty of factoring large integers, the factoring problem.
* RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described the algorithm in 1977.
* Clifford Cocks, an English mathematician, had developed an equivalent system in 1973, but it was classified until 1997
* The RSA scheme is a block cipher in which the plain text and cipher text are integers between 0 and n-1 for some n.
* A Typical size of n is 1024 bits or 309 decimal digits.
* This is a public key encryption scheme.
* In this scheme two pairs of integers {e, n} and {d, n} are used. First of them i.e. {e.n} is called the RSA public key and the other one i.e. {d, n} is called the RSA secret key.
* The sender uses the public key and encrypts the message say M into cipher text as –
C = M^e mod n. C is the cipher text and M is the message or the plane text * At the receiving end the receiver accept the cipher text C and decrypt the C into M using secret key {d, n}- M = C^d mod n.
LITERATURE REVIEWS
History and implementation :-
The RSA algorithm was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT; the letters RSA are the initials of their surnames, listed in the same order as on the paper.
MIT was granted U.S. Patent 4,405,829 for a
Term Paper
On
RSA
Subject: Information System and Cyber Laws
Bachelor of Technology
In
Computer Science & Engineering
Session: 2012-13
Submitted to: Submitted by:
Ms. Shruti Saxena Arpit Varshney Roll No.1012210026 Group: 61
SHRI RAMSWAROOP MEMORIAL Group OF
PROFESSIONAL COLLEGES, LUCKNOW
Affiliated to
G.B. TECHNICAL UNIVERSITY, LUCKNOW
INTRODUCTION
* RSA is an algorithm for public-key cryptography that is based on the presumed difficulty of factoring large integers, the factoring problem.
* RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described the algorithm in 1977.
* Clifford Cocks, an English mathematician, had developed an equivalent system in 1973, but it was classified until 1997
* The RSA scheme is a block cipher in which the plain text and cipher text are integers between 0 and n-1 for some n.
* A Typical size of n is 1024 bits or 309 decimal digits.
* This is a public key encryption scheme.
* In this scheme two pairs of integers {e, n} and {d, n} are used. First of them i.e. {e.n} is called the RSA public key and the other one i.e. {d, n} is called the RSA secret key.
* The sender uses the public key and encrypts the message say M into cipher text as –
C = M^e mod n. C is the cipher text and M is the message or the plane text * At the receiving end the receiver accept the cipher text C and decrypt the C into M using secret key {d, n}- M = C^d mod n.
LITERATURE REVIEWS
History and implementation :-
The RSA algorithm was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT; the letters RSA are the initials of their surnames, listed in the same order as on the paper.
MIT was granted U.S. Patent 4,405,829 for a
References: - [1] http://www.cryptographyworld.com/rsa.htm [2] http://en.wikipedia.org/wiki/RSA_(algorithm) [3] http://courses.cs.vt.edu/~cs5204/fall00/protection/rsa.html [4] http://books.google.co.in/books [5]COMPUTER NETWORK BY ANDREW S. TANENBAUM [6] http://www.rsa.com [7] http://www.jsums.edu