chirayu-joshi / rsa

RSA 2048 implementation in Java using BigInteger, Java Security and Java file handling

RSA

RSA 2048 implementation in Java using BigInteger, Java Security and Java file handling

rsa's Issues

Long message can't be shared due to modulus operation (in a^b(mod n))

As limited number of data can be passed at a time in this implementation of algorithm due to modulus operation, data should be divided into chunks, and each chunk has to be encrypted and decrypted separately.

This happens mainly when we want to send cipher text which was encrypted using private key of client. Due to encryption, size of message becomes greater than or equal to 'n' (or 'modulus' in our case) while we are passing this cipher text for further encryption using public key of server.