/**

* RSA algorithm is asymmetric cryptography algorithm. Asymmetric actually means that it works on

* two different keys i.e. Public Key and Private Key. As the name describes that the Public Key is

* given to everyoneand Private key is kept private.

*/

package ciphers;

import java.math.BigInteger;

import java.security.SecureRandom;

import javax.swing.JOptionPane;

public final class rsa {

public static void main(String[] args) {

RSA rsa = new RSA(1024);

String text1 = JOptionPane.showInputDialog("Enter a message to encrypt :");

String ciphertext = rsa.encrypt(text1);

JOptionPane.showMessageDialog(null, "Your encrypted message : " + ciphertext);

JOptionPane.showMessageDialog(null, "Your message after decrypt : " + rsa.decrypt(ciphertext));

}

private BigInteger modulus, privateKey, publicKey;

public RSA(int bits) {

generateKeys(bits);

}

public synchronized String encrypt(String message) {

return (new BigInteger(message.getBytes())).modPow(publicKey, modulus).toString();

}

public synchronized BigInteger encrypt(BigInteger message) {

return message.modPow(publicKey, modulus);

}

public synchronized String decrypt(String encryptedMessage) {

return new String((new BigInteger(encryptedMessage)).modPow(privateKey, modulus).toByteArray());

}

public synchronized BigInteger decrypt(BigInteger encryptedMessage) {

return encryptedMessage.modPow(privateKey, modulus);

}

public synchronized void generateKeys(int bits) {

SecureRandom r = new SecureRandom();

BigInteger p = new BigInteger(bits / 2, 100, r);

BigInteger q = new BigInteger(bits / 2, 100, r);

modulus = p.multiply(q);

BigInteger m = (p.subtract(BigInteger.ONE)).multiply(q.subtract(BigInteger.ONE));

publicKey = new BigInteger("3");

while (m.gcd(publicKey).intValue() > 1) {

publicKey = publicKey.add(new BigInteger("2"));

}

privateKey = publicKey.modInverse(m);

}

}