lec2 - Modern Cryptography Lecture 2 Yongdae Kim Admin...

Info icon This preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Modern Cryptography Lecture 2 Yongdae Kim
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Admin Stuff E-mail Subject should have [5471] in front, e.g. “[5471] Project proposal” CC TA and PostDoc: [email protected], [email protected] Office hours Me: T 1:30 ~ 2:30, Th 10:00 ~ 11:00 (and by appointment) TA: M 1:15 PM ~ 2:15 PM Work on projects 1st assignment on-line (due: 02/02 9:00 AM)
Image of page 2
3 Recap Math… Proof techniques Direct/Indirect proof, Proof by contradiction, Proof by cases, Existential/Universal Proof, Forward/backward reasoning Divisibility: a divides b (a|b) if c such that b = ac GCD d = gcd(a,b) d > 0 d | a and d | b e | a and e | b implies e | d lcm, relatively prime, existence of GCD Eucledean Algorithm d = gcd (a, b) x, y such that d = a x + b y.
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4 Few more useful stuff Let d = gcd (a, b) gcd (a/d, b/d) = ? a | bc and d = 1 ? a | bc (a/d) | c gcd (ma, mb) = md if m > 0 gcd (n, n+1) ? gcd (a, b) = gcd (a + kb, b) ?
Image of page 4
5 Prime p 2 is prime if a | p a = ± 1 or ± p Hereafter, p is prime [Euclid] p | ab p | a or p | b [Euclid] There are infinite number of primes. Prime number theorem: let π (x) denote the number of prime numbers x, then lim x π (x)/(x/ln x) = 1 Euler phi function : For n 1, let φ (n) denote the number of integers in [1, n] which are relatively prime to n. if p is a prime then φ (p)=p-1 if p is a prime, then φ (p r ) = p r-1 (p-1). φ is multiplicative. That is if gcd(m,n)=1 then φ (m*n) = φ (n) * φ (m)
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
6 Fundamental theorem of arithmetic Every positive integer greater than 1 can be uniquely written as a prime or as the product of two or more primes where the prime factors are written in order of non-decreasing size Examples 100 = 2 * 2 * 5 * 5 182 = 2 * 7 * 13 29820 = 2 * 2 * 3 * 5 * 7 * 71
Image of page 6
7 Pairwise relative prime A set of integers a 1 , a 2 , … a n are pairwise relatively prime if, for all pairs of numbers, they are relatively prime Formally: The integers a 1 , a 2 , … a n are pairwise relatively prime if gcd( a i , a j ) = 1 whenever 1 i < j n . Example: are 10, 17, and 21 pairwise relatively prime? gcd(10,17) = 1, gcd (17, 21) = 1, and gcd (21, 10) = 1 Thus, they are pairwise relatively prime Example: are 10, 19, and 24 pairwise relatively prime? Since gcd(10,24) 1, they are not
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
8 Modular arithmetic If a and b are integers and m is a positive integer, then a is congruent to b modulo m if m divides a-b Notation: a b (mod m ) Rephrased: m | a-b Rephrased: a mod m = b If they are not congruent: a b (mod m ) Example: Is 17 congruent to 5 modulo 6? Rephrased: 17 5 (mod 6) As 6 divides 17-5, they are congruent Example: Is 24 congruent to 14 modulo 6? Rephrased: 24 14 (mod 6) As 6 does not divide 24-14 = 10, they are not congruent
Image of page 8
9 Example (World of mod n) -2n -n 0 n 2n 3n 4n 0 -2n+1 -n+1 1 n+1 2n+1 3n+1 4n+1 1 -2n+2 -n+2 2 n+2 2n+2 3n+2 4n+2 2 -n-1 -1 n-1 2n-1 3n-1 4n-1 5n-1 n-1
Image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10 More on congruence Every integer is either of the form 4k, 4k+1, 4k+2, 4k+3.
Image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern