CIT 380 Securing Computer Systems.ppt

CIT 380: Securing Computer Systems CIT 380: Securing Computer Systems Slide #* CIT 380: Securing Computer Systems Modern Cryptography CIT 380: Securing Computer Systems Slide #* Overview Cryptographic Checksums Hash Functions HMAC Number Theory Review Public Key Cryptography One-Way Trapdoor Functions Diffie-Helman RSA Modern Steganography CIT 380: Securing Computer Systems Slide #* Hash Functions Checksum to verify data integrity. Hash Function h: A?B Input A: variable length Output B: fixed length “fingerprint” of input Many inputs produce same output. Example Hash Function Sum 32-bit words of message mod 232. CIT 380: Securing Computer Systems Slide #* Hash Function: ASCII Parity ASCII parity bit ASCII has 7 bits; 8th bit is for “parity” Even parity: even number of 1 bits Odd parity: odd number of 1 bits Bob receives as bits. Sender is using even parity; 6 1 bits, so character was received correctly Note: could be garbled, but 2 bits would need to have been changed to preserve parity Sender is using odd parity; even number of 1 bits, so character was not received correctly CIT 380: Securing Computer Systems Slide #* Cryptographic Checksums Hash with authentication/integrity protection Cannot obtain original message from hash. Cannot find another message with same hash. Additional Names Message Authentication Code Message Digest CIT 380: Securing Computer Systems Slide #* One-Way Function Function f easy to compute, hard to reverse Given x, easy to calculate f(x). Given f(x), hard to compute x. What’s easy and what’s hard? easy: polynomial time hard: exponential time Are there any one-way functions? CIT 380: Securing Computer Systems Slide #* Cryptographic Checksum Definition A function h: A?B such that: For any x IN A, h(x) is easy to compute. For any y IN B, it is computationally infeasible to find x IN A such that h(x) = y. It is computationally infeasible to find x, x′ IN A such that x ≠ x′ and h(x) = h(x′). CIT 380: Securing Computer Systems Sli