El Gamal Algorithm and Java problem

Question

I was trying to implement the El Gamal algorithm in java, but the problem is with the last part. I'm not getting the value of Message but according to algorithm i should get the value of message. Can anyone please tell me what did i do wrong?
theory says, msg = x * (z^a)modInverse(p);
import java.math.BigInteger;
import java.math.*;
import java.util.*;
class ElGamel
     public static void main(String[] args)
          BigInteger p = new BigInteger("7747");
          BigInteger q = new BigInteger("3853");
          BigInteger a = new BigInteger("773");
          BigInteger k = new BigInteger("1193");
          BigInteger msg = new BigInteger("39");
          BigInteger y = new BigInteger("0");
          BigInteger x = new BigInteger("0");
          BigInteger z = new BigInteger("0");
          BigInteger temp = new BigInteger("0");
          BigInteger t2 = new BigInteger("0");
          int t1 = 0;
          y = q.modPow(a,p);
          System.out.println("Y is "+y);
          x = q.modPow(k,p);
          System.out.println("X is "+x);
          t1 = k.intValue();
          z = (msg.multiply(y.pow(t1))).mod(p);
          System.out.println("Z is "+z);
          t1 = a.intValue();
          x = x.pow(t1);
          temp = x.modInverse(p);
          msg = z.multiply(temp);
          System.out.println("Message is "+msg);
}

Answer 1

Reposting your code with markup. In future please use [code] tags, as you can see the effect it has on legibility: import java.math.BigInteger;
import java.math.*;
import java.util.*;
class ElGamel
    public static void main(String[] args)
        BigInteger p = new BigInteger("7747");
        BigInteger q = new BigInteger("3853");
        BigInteger a = new BigInteger("773");
        BigInteger k = new BigInteger("1193");
        BigInteger msg = new BigInteger("39");
        BigInteger y = new BigInteger("0");
        BigInteger x = new BigInteger("0");
        BigInteger z = new BigInteger("0");
        BigInteger temp = new BigInteger("0");
        BigInteger t2 = new BigInteger("0");
        int t1 = 0;
        y = q.modPow(a,p);
        System.out.println("Y is "+y);
        x = q.modPow(k,p);
        System.out.println("X is "+x);
        t1 = k.intValue();
        z = (msg.multiply(y.pow(t1))).mod(p);
        System.out.println("Z is "+z);
        t1 = a.intValue();
        x = x.pow(t1);
        temp = x.modInverse(p);
        msg = z.multiply(temp);
        System.out.println("Message is "+msg);
}