EECE 252 Lecture Notes - Lecture 8: Discrete Logarithm, Forward Secrecy, Symmetric-Key Algorithm

63 views48 pages

Document Summary

Repudiation y t i u n i t n o. Cryptography e c n a r u s s. The security of a cryptosystem must not depend on keeping secret the crypto-algorithm. The security depends only on keeping secret the key . 3 session key with mutual authentication using symmetric key. Tls example: ciphersuite tls_rsa_with_aes_256_cbc_sha = { 0x00, 0x35 }, ciphersuite tls_dh_rsa_with_aes_256_cbc_sha = { 0x00, 0x37 }; 13 the protocol: public: g and p, secret: alice"s exponent a, bob"s exponent b ga mod p gb mod p. Alice, a: alice computes (gb)a = gba = gab mod p, bob computes (ga)b = gab mod p, could use k = gab mod p as symmetric key. Man-in-the-middle attack ga mod p gt mod p gt mod p gb mod p. Bob, b: trudy shares secret gat mod p with alice, trudy shares secret gbt mod p with bob, alice and bob don"t know trudy exists!

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Questions