lec13-4

# lec13-4 - Admin Stuff E-mail Modern Cryptography Lecture 13...

This preview shows pages 1–3. Sign up to view the full content.

Modern Cryptography Lecture 13 Yongdae Kim 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:00 ~ 2:00 , Th 10:00 ~ 11:00 (and by appointment) TA: M 1:15 PM ~ 2:15 PM Work on projects Final Report due: May 6 (Firm Deadline: NO EXTENSION ) 6th assignment is due: 4/20 9:00 AM. (Today) Study Guide Come and talk to me and TA as much as possible. (Google chat is good!) Check Calendar 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, LCM, relatively prime, existence of GCD Eucledean Algorithm d = gcd (a, b) x, y such that d = a x + b y. gcd(a, b) = gcd(a, b + ka) Modular Arithmetic a b (mod m ) iff | a-b iff a = b + mk for some k (mod ), c d (mod ) a+c ( b+d ) (mod ), ac bd (mod ) gcd(a, n) =1 a has an arithmetic inverse modulo n. Counting, probability, cardinality, … Security Symmetric Key vs. Public Key, Hash function, MAC, Digital signature, Key management through SKE and PKE, certificate 4 Recap (cnt) Block Cipher Modes of operation and their properties: ECB, OFB, CFB, CBC, CTR Meet-in-the-middle attack and the Double (triple) DES Feistal Cipher and DES Hash function and MAC Probability and Birthday paradox Merkle-Damgard Construction, MD4: design and break MAC Advanced number theory CRT Euler theorem: If a Z n * , then a φ (n) =1 (mod n) Cor: if r ´ s mod φ (n) and (a, n)=1, then a r ´ a s (mod n)

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

View Full Document
5 Recap (cnt) Generator If ord n (a) = φ (n) then a is a generator of Z n *. a is a generator iff a φ (n)/p 1 mod n for all p | φ (n). Let a Z m * and ord(a) = h. Then ord(a k ) = h/gcd(h, k). RSA Encryption n = pq , φ ( n ) = ( p -1)( q -1), gcd( φ ( n ), e ) = 1, ed 1 mod φ ( n ) A’s public key is (n, ); A’s private key is d Encryption: compute c = m e mod n Decryption: m = c d mod Group Theory (G, ° ) is a group if it satisfies closedness, associativity, and has identity and every element has an inverse. (G, ° ) is cyclic if group generator. DLP: Given , a generator g of Z * , and an element y , find the integer x such that = y mod . 6
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/21/2011 for the course CSCI 5471 taught by Professor Staff during the Spring '08 term at Minnesota.

### Page1 / 9

lec13-4 - Admin Stuff E-mail Modern Cryptography Lecture 13...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online