Not the Real Exam

due February 29, 2001

  1. In 500 words or less, describe why you really, really like the random oracle model.
  2. Factor a 1000-bit integer of your choice.
  3. Explain what index calculus algorithms have to do with calculus.
  4. Describe what is meant by a "corned beef hash" function.
  5. Explain the relevance of the "discrete log" problem to the lumber industry.
  6. Compare the Pollard "rho" algorithm to the Pollard "sigma" and "tau" algorithms. Present your answer in Greek.
Hint: You might find it convenient to build a quantum computer to perform computations.