This preview shows page 1. Sign up to view the full content.
Unformatted text preview: r i-s produced by the algorithm. NOTE: you should be able to do this by hand, without a computer or calculator. A. gcd (103927 , 102313) B. gcd (145393 , 82933) 3. (10 points) Give an algorithm that on input integers x and m computes x 37 mod m . As a primitive step you may assume an algorithm for modular multiplication: on input y and z it computes ( y z ) mod m . Your algorithm should use as few modular multiplications as possible (7 is the best possible). You may write the algorithm informally. 4. (5 points) Problem 18 (Chapter 6.8) 5. (5 points) Problem 12 (Chapter 6.8)...
View Full Document
This note was uploaded on 10/07/2010 for the course C S 52475 taught by Professor Gal during the Fall '10 term at University of Texas at Austin.
- Fall '10