| Home | Sign up! | Projects | Seminars | Research Notes | Today's Lecture | About |

Update Project Form
 Course: Project Topic: Project Description: The RSA Encryption is one of the most popular encryption method. Till now I have studied the method to convert the data bit into 128 bit using private and public keys(prime no.).To encrypt data using RSA Encryption, the algorithm is defined by R-Rivest, S-Shamir & A-Adleman.

The algorithm-
1. Select primes to be assigned to P,Q (normally they should be large numbers to avoid hacking).

2. Find E such that:-
(i)E>1 & is odd
(ii)gcd(E,(P-1)(Q-1))=1

3.Find D such that:-
(D*E)%(P-1)(Q-1)=1

Now. the actual encryption starts,-
for encryption-Encrypt(T)=pow(T,E)%PQ ,where T stands for text.
for decrytpion-Derypt(C)=pow(C,D)%PQ where C is the encrypted form of the actual text.

Finally, after completion of RSA enryption, we get the encrypted data, the public key (E,PQ)and the private key D
Vectors will be used to do long number computations.The arithmetic operations to be performed to do encryption are-