PublicKey1.java

This main class uses a brute force search and elGamal search for a public key cryptography and prints out the message, the method asks the user to input a modulus, generater and a g^xmodp and then uses the method modMult to find the gx of the other persons unknown, now we have to enter the other two knowns in the cryptography which are the c1 and c2 and with this the ElGamal cipher is (c1,c2), we then input a private key and use this private key and the two methods modPow and modMult to find the message, the modMult and modPow methods r recursive to ensure the numbers do not get too big and take too much time to complete.