CORNACCHIA Algorithm * * GOAL: given d and p prime, find (x,y) such that x^2 + y^2 = d * p * * in this implementation, d = 1. This code does not accept d <> 1 !!! * see "A Course in Computational Algebraic Number Theory" by Henri

To find mod of a number used in crypt app.

This a new algorithm in which we encrypt on the basis of position of the character. Algorithm 1 for key generation and Algorithm 2 is for encryption Algorithm A1 Step1: Let the key be ‘k’. Step2: Multiply the index number +1 with its ASCII c

Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to