1. UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Tuesday, 26 November Number-Theoretic Algorithms Chapter 31

2. Chapter Dependencies Ch 31 Number-Theoretic Algorithms RSA Math: Number Theory You’re responsible for material in this chapter that we discuss in lecture. (Note that this does not include sections 31.8 or 31.9.)

3. Overview ä Motivation: RSA ä Basics ä Euclid’s GCD Algorithm ä Chinese Remainder Theorem ä Powers of an Element ä RSA Details

4. Motivation: RSA

5. RSA Encryption source: 91.503 textbook Cormen et al. 31.5

6. RSA Digital Signature source: 91.503 textbook Cormen et al. 31.6 assume Alice also sends her name so Bob knows whose public key to use ?

7. RSA Cryptosystem (31.19) (31.26) (31.35) (31.36) encode decode source: 91.503 textbook Cormen et al. to be explained later…. need efficient ways to compute P(M), S(C)

8. RSA Dependence ä Correctness:  Euler’s  Function ä Fermat’s Theorem ä Chinese Remainder Theorem ä Efficiency: ä Modular Exponentiation ä Primality Testing ä Security: ä Difficulty of Factoring Large Primes see chart of result dependencies on board…

9. Basic Concepts * Indicates that result is on chart of result dependencies on board…

10. Division & Remainders source: 91.503 textbook Cormen et al. 31.1 (3.8) *

11. Equivalence Class Modulo n source: 91.503 textbook Cormen et al. (31.1) (31.2)

12. Common Divisors source: 91.503 textbook Cormen et al. (31.3) (31.4) (31.5) * *

13. Greatest Common Divisor source: 91.503 textbook Cormen et al. (31.6) (31.7) (31.8) (31.9) (31.10) 31.2 (3.8) (31.4) * *

14. Greatest Common Divisor source: 91.503 textbook Cormen et al. 31.3 (31.4) 31.2 31.4 *

15. Relatively Prime Integers source: 91.503 textbook Cormen et al. 31.6 31.2 31.2 *

16. Relatively Prime Integers source: 91.503 textbook Cormen et al. 31.7 31.6 31.1-6 *

17. Greatest Common Divisor source: 91.503 textbook Cormen et al. 31.9 (31.5) (3.8) (31.4) (31.3) (31.4) (31.3) (31.5) (31.14) (31.15) (31.14) (31.15) *

18. Euclid’s GCD Algorithm

19. source: 91.503 textbook Cormen et al. * Also see Java code on course web site

20. Extended Euclid source: 91.503 textbook Cormen et al. (31.16) 31.1 * *

21. BREAK

22. Chinese Remainder Theorem

23. Modular Arithmetic source: 91.503 textbook Cormen et al.

24. Finite Groups source: 91.503 textbook Cormen et al. size of this group is 6 size of this group is 8 31.2 Additive group mod 6 Multiplicative group mod 15 elements relatively prime to n

25. Finite Groups source: 91.503 textbook Cormen et al. 31.12

26. Finite Groups source: 91.503 textbook Cormen et al. 31.13 31.6 31.12 31.26

27. Euler’s Phi Function source: 91.503 textbook Cormen et al. (31.19) *

28. Lagrange’s Theorem source: 91.503 textbook Cormen et al. 31.15 *

29. Finite Groups 31.17 * source: 91.503 textbook Cormen et al. 31.18 31.19** additive subgroup generated by a where k

30. Solving Modular Linear Eq source: 91.503 textbook Cormen et al. 31.20 (31.4) *

31. Solving Modular Linear Eq source: 91.503 textbook Cormen et al. 31.22 31.18 31.18 31.22 31.24 * *

32. Solving Modular Linear Eq source: 91.503 textbook Cormen et al. 31.26 * *

33. Chinese Remainder Theorem source: 91.503 textbook Cormen et al. (31.23) 31.27 (31.23) (31.24) (31.25) (31.26) *

34. Chinese Remainder Theorem source: 91.503 textbook Cormen et al. 31.29 *

35. BREAK

36. Powers of an Element

37. Theorems of Euler & Fermat source: 91.503 textbook Cormen et al. 31.30 31.31 * *

38. Modular Exponentiation source: 91.503 textbook Cormen et al. * Also see Java code on course web site

39. RSA Details

40. RSA Encryption source: 91.503 textbook Cormen et al. 31.5

41. RSA Digital Signature source: 91.503 textbook Cormen et al. 31.6 assume Alice also sends her name so Bob knows whose public key to use ?

42. RSA Cryptosystem (31.19) (31.26) (31.35) (31.36) encode decode source: 91.503 textbook Cormen et al. need efficient ways to compute P(M), S(C)

43. RSA Correctness source: 91.503 textbook Cormen et al. (31.35)(31.36) 31.31 31.29 by Thm 31.31 (Fermat)

44. BREAK