Assignment -1

Date of Submission: 8th May, 2019

Q1. A group of people are arranging themselves for a parade. If they line up three to a row,
one person is left over. If they line up four to a row, two people are left over, and if they line
up five to a row, three people are left over. What is the smallest possible number of people?
What is the next smallest number?

Q2. Suppose you write a message as a number m (mod 31) Encrypt m as m 7 (mod 31). How
would you decrypt?

Q3. Show that 7 is a primitive root mod 601.

Q4. Explore SHANKS’ ALGORITHM for finding discrete logarithms in Zp*,

where p is prime and a is a primitive element modulo p. Implement the algorithm and Use
your program to find log106 12375 in Z24691 and log6 248388 in Z458009