Upgrade to Pro — share decks privately, control downloads, hide ads and more …

New Directions In Cryptography - Papers We Love

New Directions In Cryptography - Papers We Love

I gave a talk about Whitfield Diffie & Martin Hellman’s (1976) “New Directions In Cryptography” paper at Papers We Love Singapore where they announced the Diffie-Hellman Key Exchange.

Video Link: https://engineers.sg/v/601

Vishnu Prem

March 28, 2016
Tweet

More Decks by Vishnu Prem

Other Decks in Technology

Transcript

  1. Hello! Vishnu Prem Computer Science @ NUS NUS Hackers Secure

    message passing got me first interested in technology Used to be HackerspaceSG member in 2009. Gotta fix that This is my first Papers We Love
  2. The paper New Directions in Cryptography Published November 1976 on

    IEEE Transactions of Information Theory NSA claimed they invented it already Whitfield DIffie & Martin Hellman won the Turing Prize in 2015
  3. “The development of cheap digital hardware has freed it from

    the design limitations of mechanical computing and brought the cost of high grade cryptographic devices down…”
  4. Why cryptography? Conventional Cryptography 2 motivations • Privacy - No

    one else can read my messages except my intended recipient - No one else can inject messages messages to my intended recipients • Authentication - Recipients knows that only sender could have sent this message Most modern standards give both, auth-only standards exists too
  5. One time pad Conventional Cryptography One time pad (OTP) is

    randomly generated and shared between Alice & Bob OTP needs to be as large as message Unconditionally secure vs. Computationally infeasible
  6. Alice Bob Eve Secure Channel Insecure Channel Plaintext: HELLO Key:

    XMCKL Key: XMCKL Text + Key (mod 26) H E L L O + X M C K L = E Q N V Z Ciphertext: EQNVZ E Q N V Z - X M C K L = H E L L O Text - Key (mod 26)
  7. Disadvantages of OTP Conventional Cryptography OTP needs to be as

    large as the message. Not so practical Instead of Unconditionally secure, let’s use Computationally infeasible instead
  8. Symmetric stream cipher Conventional Cryptography Process input in small chunks

    of text Common stream cipher: Rivest Cipher 4 - RC4 (No longer considered secure) Symmetric means same key for encryption & decryption RC4 HELLO YXTE
  9. Symmetric block cipher Conventional Cryptography Acts on large blocks of

    texts at once Small change in input produces major changes in output This error prorogation is useful: e.g. hash functions Common block cipher: AES-256bit This paper mainly deals with block ciphers AES HELLO YXTE
  10. Alice Bob Eve Secure Channel Insecure Channel Key: E8E9EAEBEDE… Plaintext:

    014BAF2278A… Ciphertext: 6743C3D151… Ciphertext: 6743C3D151… Plaintext: 014BAF2278A… Key: E8E9EAEBEDE… Ciphertext: 6743C3D151…
  11. Threats Conventional Cryptography Cipher only attack • Eve has access

    to cipher text Known plaintext attack • Eve has access to both plaintext & ciphertext Chosen plaintext attack • Eve has access to cryptographic system
  12. Intro to key sizes Conventional Cryptography All ciphers can be

    brute forced 128 bits -> 128 0s & 1s 2^128 possibilities -> 340 billion billion billion billion If you could test 1 billion keys a second -> 5 * 10^21 years
  13. One way function DH Key Exchange A function that is

    easy one way, but computationally hard the other way DH paper proposed exponents
  14. One way function DH Key Exchange Y = a^X mod

    q q = prime number a = primitive root of q
  15. One way function DH Key Exchange Y = 3^X mod

    17 Y will distribute within 1-16
  16. One way function DH Key Exchange 12 = 3^? mod

    17 Discrete logarithm problem
  17. Alice Bob Eve Insecure Channel 3 mod 17 Secret: 15

    Secret: 13 Shared: 12 Shared: 6 12^15 mod 17 = 10 6^13 mod 17 = 10 Alice: 6 Bob: 12 3^13^15 mod 17 = 10 3^15^13 mod 17 = 10 3^13^15 mod 17 = 10 3^15^13 mod 17 = 10 3^15 mod 17 = 6 3^13 mod 17 = 12
  18. RSA New Directions in Cryptography DH Paper proposed a way

    public key cryptography could be done 2 years later, RSA was released Asymmetric Ciphers - Prime Numbers • Generate a key pair • One key to encrypt, pair key to decrypt
  19. RSA New Directions in Cryptography Asymmetric Cipher generartes two keys:

    Public & Private key Plaintext + Ciphertext = Ciphertext + Plaintext =
  20. RSA New Directions in Cryptography But • Asymmetric ciphers are

    1000s slower than symmetric ciphers So we use RSA to just share a symmetric key instead