This preview shows pages 1–17. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS70: Satish Rao: Lecture 10. Outline. 1. Cryptography 2. Public Key Cryptography 3. RSA system 3.1 Efficiency: Repeated Squaring. 3.2 Correctness: Fermat’s Theorem. 3.3 Construction. 4. Warnings. Cryptography ... Bob Alice Eve Cryptography ... Bob Alice Eve Secret s Cryptography ... Bob Alice Eve Secret s Message m Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Works because m ⊕ s ⊕ s = m ! Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Works because m ⊕ s ⊕ s = m ! ...and totally secure! ...given E ( m , s ) any message m is equally likely. Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Works because m ⊕ s ⊕ s = m ! ...and totally secure! ...given E ( m , s ) any message m is equally likely. Disadvantages: Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Works because m ⊕ s ⊕ s = m ! ...and totally secure! ...given E ( m , s ) any message m is equally likely. Disadvantages: Shared secret! Cryptography ... Bob Alice Eve Secret s Message m E ( m , s ) m = D ( E ( m , s ) , s ) Example: Onetime Pad: secret s is string of length  m  . E ( m , s ) – bitwise m ⊕ s . D ( x , s ) – bitwise x ⊕ s . Works because m ⊕ s ⊕ s = m !...
View
Full
Document
This note was uploaded on 02/29/2012 for the course COMPSCI 70 taught by Professor Rau during the Fall '11 term at University of California, Berkeley.
 Fall '11
 Rau

Click to edit the document details