Comp 3704
Introduction to Cryptography
Homework 7
Due Tuesday, February 25, 2003

1. Is there a number whose square equals 35 mod 1117? Explain why or why not.
2. Calculate the Jacobi symbol of 610 on 987.
3. Show that the number 561 is not prime by showing it is not an Euler pseudoprime to the base 3.
4. If you are testing a 100-bit number for primality, how many random test numbers a will you use in the Solovay-Strassen algorithm before you are 99.995 sure that the number is prime?
5. Give me a proposal for project 3. This does not need to be a huge project. You could read and present an abstract of a paper, or implement a cryptographic algorithm. Give me a several sentence description of what you intend to do.