1 / 9

Comprehensive Computer Security Fundamentals

Learn about message authentication, confidentiality, and user authorization in computer security. Explore encryption algorithms like RC4 and key distribution methods. Understand RSA encryption and signing processes.

tolla
Download Presentation

Comprehensive Computer Security Fundamentals

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. Computer security: message authentication Frans Kaashoek 6.033 Spring 2007

  2. Security goals • Confidentiality • Authentication • Message • User • Authorization

  3. RC4 (or ARC4) byte S[256]; procedure RC4_generate() return key-byte { i  (i + 1) mod 256; j  (j + S[i]) mod 256; swap (S[i], S[j]); t  (S[i] + S[j]) mod 256; return S[t];

  4. Initialization from a seed procedure RC4_init (seed) for i from 0 to 255 do { S[i]  i; K[i]  seed[i]; } j  0; for i from 0 to 255 do { j  (j + S[i] + K[i]) mod 256; swap( S[i], S[j]); } i  0; j  0;

  5. Sign and verify using Hmac procedure sign (m,k) { tH((k  outerpad) +H((k innerpad) + m)) returnt; } procedure verify (m, t, k) { hH((k  outerpad) + H((k innerpad) + m)) if (h = t) return accept; elsereturn reject; }

  6. key distribution Charles • 3 is a certificate for Alice’s public key • Charles is called a certificate authority 3. M = “A’s Kapub =…”, sign(M, KCpriv) 2. Alice? Alice Bob 1. M, Sign(M, KApriv)

  7. Transform C ← me (mod n) Reverse Transform Cd(mod n) = med (mod n) = m RSA public-key cipher • p, q primes • n  p  q • z  (p-1)  (q-1) • Pick e relative prime to z • Pick d s.t. ed = 1 (mod z) • K1 = (e, n) • K2 = (d, n) • Message m s.t. 0 ≤ m < n p = 47, q = 59 n ← 2773 z ← 2668 e = 17, d = 157 m ← 31 c ← 3117 (mod 2773) = 587 587157 (mod 2773) = m

  8. 2005: 640-bit key factored in 3 months using 80 2.2Ghz Opterons

  9. Sign and verify using RSA procedure sign (m,Kpriv) { t hash(m) t  RSA-transform (h, Kpriv) returnt; } procedure verify (m, t, Kpub) { h RSA-reverse (t,Kpub) if (hash(h) = t) return accept; elsereturn reject; } Needs further refinement!

More Related