CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography.

Slides:

Advertisements

Similar presentations

Chapter 3 Public Key Cryptography and Message authentication.

Advertisements

Hash Functions A hash function takes data of arbitrary size and returns a value in a fixed range. If you compute the hash of the same data at different.

Lecture 5: Cryptographic Hashes

Lecture 7 Overview. Advanced Encryption Standard 10, 12, 14 rounds for 128, 192, 256 bit keys – Regular Rounds (9, 11, 13) – Final Round is different.

Hash Function. What are hash functions? Just a method of compressing strings – E.g., H : {0,1}*  {0,1} 160 – Input is called “message”, output is “digest”

Digital Signatures and Hash Functions. Digital Signatures.

Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.

CSE331: Introduction to Networks and Security Lecture 21 Fall 2002.

Chapter 4  Hash Functions 1 Overview  Cryptographic hash functions are functions that: o Map an arbitrary-length (but finite) input to a fixed-size output.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Henric Johnson1 Chapter3 Public-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology, Sweden

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.

Csci5233 Computer Security & Integrity 1 Cryptography: Basics (2)

Hash Functions Nathanael Paul Oct. 9, Hash Functions: Introduction Cryptographic hash functions –Input – any length –Output – fixed length –H(x)

Cryptography and Network Security Chapter 11 Fourth Edition by William Stallings Lecture slides by Lawrie Brown/Mod. & S. Kondakci.

CS526Topic 5: Hash Functions and Message Authentication 1 Computer Security CS 526 Topic 5 Cryptography: Cryptographic Hash Functions And Message Authentication.

Public Key Cryptography and Cryptographic Hashes CS461/ECE422 Fall 2009.

1 Message Authentication and Hash Functions Authentication Requirements Authentication Functions Message Authentication Codes Hash Functions Security of.

1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden

Digital Signatures Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 7, 2013.

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

Acknowledgements: William Stallings.William Stallings All rights Reserved Session 4 Public Key Cryptography (Part 2) Network Security Essentials Application.

Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2015 Nitesh Saxena.

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

1 Hashes and Message Digests. 2 Hash Also known as –Message digest –One-way function Function: input message -> output One-way: d=h(m), but not h’(d)

Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.

Chapter 21 Public-Key Cryptography and Message Authentication.

CSCI 172/283 Fall 2010 Hash Functions, HMACs, and Digital Signatures.

11-Basic Cryptography Dr. John P. Abraham Professor UTPA.

Confidentiality Confidentiality is maintained so long as private keys are secure. Authenticity is possible via public-key encryption by encrypting messages.

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.

1 Number Theory and Advanced Cryptography 6. Digital Signature Chih-Hung Wang Sept Part I: Introduction to Number Theory Part II: Advanced Cryptography.

Cryptographic Hash Functions and Protocol Analysis

Week 4 - Friday.  What did we talk about last time?  Snow day  But you should have read about  Key management.

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

15-499Page :Algorithms and Applications Cryptography I – Introduction – Terminology – Some primitives – Some protocols.

Authentication. Goal: Bob wants Alice to “prove” her identity to him Protocol ap1.0: Alice says “I am Alice” Failure scenario?? “I am Alice”

CSC 382: Computer SecuritySlide #1 CSC 382: Computer Security Modern Cryptography.

Hash Functions Ramki Thurimella. 2 What is a hash function? Also known as message digest or fingerprint Compression: A function that maps arbitrarily.

1 ISA 562 Information Security Theory & Practice Public Key Cryptosystem Chapter 9 of Bishop ’ s Book.

Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2014 Nitesh Saxena.

CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.

Hashes Lesson Introduction ●The birthday paradox and length of hash ●Secure hash function ●HMAC.

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.

IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.

Lecture 9 Overview. RSA Invented by Cocks (GCHQ), independently, by Rivest, Shamir and Adleman (MIT) Two keys e and d used for Encryption and Decryption.

1 Message Authentication using Message Digests and the MD5 Algorithm Message authentication is important where undetected manipulation of messages can.

CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 13.Message Authentication.

Data Integrity / Data Authentication. Definition Authentication (Signature) algorithm - A Verification algorithm - V Authentication key – k Verification.

Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.

Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Christof Paar and Jan Pelzl Chapter 12.

@Yuan Xue 285: Network Security CS 285 Network Security Hash Algorithm Yuan Xue Fall 2012.

Information and Computer Security CPIS 312 Lab 9

Message Integrity and Message Authentication

Cryptographic Hash Functions

Cryptographic Hash Function

Cryptographic Hash Functions

NET 311 Information Security

ICS 454 Principles of Cryptography

Public Key Cryptography Diffie-Hellman, Discrete Log, RSA

CIT 380: Securing Computer Systems

Introduction to Symmetric-key and Public-key Cryptography

Cryptography: Basics (2)

ICS 454 Principles of Cryptography

Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS

Chapter 3 - Public-Key Cryptography & Authentication

Hashing Hash are the auxiliary values that are used in cryptography.

Presentation transcript:

CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography

CIT 380: Securing Computer SystemsSlide #2 Overview 1.Cryptographic Checksums 1.Hash Functions 2.HMAC 2.Number Theory Review 3.Public Key Cryptography 1.One-Way Trapdoor Functions 2.Diffie-Helman 3.RSA 4.Modern Steganography

CIT 380: Securing Computer SystemsSlide #3 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 2 32.

CIT 380: Securing Computer SystemsSlide #4 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 SystemsSlide #5 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 SystemsSlide #6 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 SystemsSlide #7 Cryptographic Checksum Definition A function h: A  B such that: 1.For any x IN A, h(x) is easy to compute. 2.For any y IN B, it is computationally infeasible to find x IN A such that h(x) = y. 3.It is computationally infeasible to find x, x´ IN A such that x ≠ x´ and h(x) = h(x´).

CIT 380: Securing Computer SystemsSlide #8 Collisions If x ≠ x´ and h(x) = h(x´), x and x´ collide. –Pigeonhole principle: if there are n containers for n+1 objects, then at least one container will have 2 objects in it. –Application: suppose n = 5 and k = 3. Then there are 32 elements of A and 8 elements of B, so at least one element of B has at least 4 corresponding elements of A.

CIT 380: Securing Computer SystemsSlide #9 Hash Function Examples Input –“Cryptography” Output (base64 encoded): – –MD5 (128-bit) 64ef07ce3e4b420c334227eecb3b3f4c –SHA1 (160-bit) b804ec5a0d83d19d8db908572f d09f98

MD5/ SHA-1 Hash Web site CIT 380: Securing Computer SystemsSlide #10

CIT 380: Securing Computer SystemsSlide #11 Keyed Hash Function Hash function + secret key Why? –Authentication How? –HMAC algorithm Incorporate key into a keyless hash algorithm.

CIT 380: Securing Computer SystemsSlide #12 HMAC HMAC = Hash Function + Key Inputs: –h: keyless cryptographic checksum function that takes data in blocks of b bytes and outputs blocks of l bytes. –k: cryptographic key. –k´: k modified to be of length b. If short, pad with 0 bytes. If long, hash to length b.

CIT 380: Securing Computer SystemsSlide #13 HMAC HMAC-h(k, m) = h(k´  opad || h(k´  ipad || m)) –  exclusive or –|| concatenation –ipad is repeated b times. –opad is repeated b times. Security depends on security of hash function h.

CIT 380: Securing Computer SystemsSlide #14 Current State of Hash Functions MD4, MD5, SHA-0 Collisions (2004) SHA-1 Collisions (2005) –Effort required is 2 69 instead of No effective pre-image attacks discovered yet. What’s the impact? –Attacker could create two documents. Document A requires payment of $500. Document B requires payment of $50,000. –Digital signatures sign MAC, not document. –Both documents have same MAC. Use SHA-256 for now.