1. Implementation of Pollard’s Rho Heuristic Mid-term Exam CSE670 Manoj Patil March 03, 2004

2. Pseudo code explains the Pollard’s Rho procedure  This method picks two modulo N congruent numbers x and y.  Modulo N numbers: We are considering a finite set of numbers that is [0, n).  if y = x mod n, that means that (y-x) is a multiple of n  If GCD [ (x-y), N ] is not equal to 1 or N, then we just proved the compositeness of the number N. else we will pick another random x number to repeat the procedure.  Next random number is chosen by a polynomial While TRUE do print d

3. Top Level design for Pollard’s Rho procedure

4. Datapath for the Pollard’s Rho procedure

5. State Machine for the Pollard’s Rho procedure control unit

6. Simulation for the Pollard’s Rho procedure control unit