Implement the extended Euclidean algorithm to nd multiplicative inverse of 60 in mod 97. Particularly, your program should generate intermediate values of Dividend, Divisor, Quotient, Remainder, X and Y for each round. Write down these values in the following table, and write down the multiplicative inverse value.

public class ExtendedEuclid {

public static long multInverse(long a, long b) { long dividend = a; long divisor = b; long x_2 = 1, y_2 = 0; long x_1 = 0, y_1 = 1; // keep looping until the divisor is 00 System.out.printf("%10s%10s%10s%10s%10s%6s%6s ", "Round", "Dividend", "divisor", "quotient", "remainder", "x", "y"); //... return 0; } /** Main function **/ public static void main (String[] args) { multInverse(97, 60); }

}

In-Class Exercise 14: Multiplicative Inverse CPSC370: Introduction to Computer Cryptology Implement the extended Euclidean algorithm to find multiplicative inverse of 60 in mod 97. Particularly, your program should generate intermediate values of Dividend, Divisor Quotient, Remainder, X and Y for each round. Write down these values in the following table, and write down the multiplicative inverse value. Table 1: Multiplicative inverse of 60 in mod 9'7 Round Dividend Divisor Quotient Remainder x.val y-val 0 97 60 3 9 60-1 (mod 97)