1 / 20

Privacy and Authentication: An Introduction to Cryptography

Privacy and Authentication: An Introduction to Cryptography. Very Brief. Whitfield Diffie, Martin Hellman (and Isabelle Stanton). What is Cryptography?. Definition: The science or study of the techniques of secret writing, esp. code and cipher systems, methods, and the like

beauregard-daniel
Download Presentation

Privacy and Authentication: An Introduction to Cryptography

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Privacy and Authentication: An Introduction to Cryptography Very Brief Whitfield Diffie, Martin Hellman (and Isabelle Stanton)

  2. What is Cryptography? • Definition: The science or study of the techniques of secret writing, esp. code and cipher systems, methods, and the like • Google Image search for cryptography→

  3. Cryptanalysis • A system is “broken” if there exists a technique to decrypt a message that is at all faster than brute-force • A larger keyspace is always more secure • Trade-offs exist with large keys i.e. if you need a 3 million bit key to guarantee 100% security but a 256 bit key gives you 99%...

  4. Models of Attackers • Ciphertext only attack (weakest system) • Can discern the key from only 1 ciphertext • Known plaintext attack • Has both the unencrypted and encrypted message • Chosen plaintext attack • Can chose the message and see the encrypted version • Chosen text attack (strongest system) • Can select message OR ciphertext at will

  5. Classical Cryptography • Time period: 4500 BC – 1946ish • Stenography (sort of) • Substitution Ciphers (and Vigènere Ciphers) • One Time Pad • Transposition Ciphers • Polyalphabetic Ciphers • Codes • All WWII crypto systems (Enigma, Purple, etc) • Modern systems are distinguished by use of mathematical systems and proofs of security

  6. One-Time Pad • XOR a message with a random key of the same length • Provably secure! Given any ciphertext of length m it can be decrypted to every message of length m • Key can only be used once (or it is broken) • Difficult to distribute keys

  7. Substitution (Caesar) Cipher • OS IS NEARLY OVER = QY AY MCKBXW QZCB • ROT-13 • Vulnerable to frequency analysis – ciphertext only attack succeeds

  8. WWII Crypto: Engima • A rotor style machine • Key is how to set the rotors, reflector and the plugboard • Keyspace ≈ 10114 • First computer, Colossus, built in Bletchley Park by Alan Turing’s team to perform cryptanalysis on Enigma. Biggest weakeness was operator error

  9. Modern Cryptography: DES • Adopted by NIST as national standard in 1976 • Developed by IBM as the Lucifer cipher • A block cipher based on Feistel S-boxes

  10. DES Structure

  11. DES Problems • 56-bit keys = broken in less than 24 hours • Also vulnerable to chosen plaintext attacks • Triple DES – run DES 3 times over the message with 2 different keys – is still practically secure • Replaced with AES in 2002

  12. Public Key: RSA • Select two large primes, p and q. N = pq • Φ(N)=(p-1)(q-1) (the # of #’s relatively prime to N) • Select random E in [1, Φ(N)–1] • Publish E and N -> public key • ED = 1 mod Φ(N) -> D is the private key • Encryption: C = ME modN • Decryption: M = CD modN

  13. RSA - Continued • Can do digital signatures (sign your outgoing message with your private key, then their public key) • Exponentiation is computationally expensive • Most frequently used as a method for exchanging keys for a symmetric system • Many other public key systems, el-gamal, elliptic curves etc.

  14. Cryptographic Hash Functions • One-way functions used as a checksum • Important features: • “Impossible” to invert • Error-propagation • Fast • Few input collisions • MD5 (128 bits, 1996), SHA-1 (160 bits, 2005), SHA-256, SHA-512

  15. Key Distribution • Diffie-Hellman Key Exchange • Link-encryption • End-to-end encryption • Key distribution center • Couriers • Pigeons

  16. Diffie-Hellman Key Exchange (1976) • Relies on difficulty of modular logarithms • Secure if g and p are chosen well (can be chosen in advance)

  17. Link-Encryption • Encrypts and decrypts all traffic at each communication link • Advantage: Each user needs to manage only 1 key • Disadvantage: You must be able to trust the links. Not realistic.

  18. End-To-End Encryption • Encrypted by sender with receiver’s key • Advantage: Ensures privacy of the message contents • Disadvantage: Requires each user to manage O(n) keys and system has O(n2) keys total

  19. Key Distribution Center • Trusted third party • See Kristen’s presentation!

  20. Future Directions • Quantum cryptography - can guarantee no eavesdropper. Creates a secure channel for exchanging keys. • Identity-based encryption - your name is your public key. Eliminates key distribution problem. I ♥ MBC

More Related