This is our repository for the Java Project for Second Semester at Bennett University

RSA Encryption: Private key will be two very large prime numbers p and q Take two numbers N = p*q and E set E as 65537

Encryption y = x^E mod N Dencryption x = y^d mod N where x is plain text, y is cipher text