Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS

Slides:



Advertisements
Similar presentations
Chapter 3 Public Key Cryptography and Message authentication.
Advertisements

Sri Lanka Institute of Information Technology
Topic 7: Using cryptography in mobile computing. Cryptography basics: symmetric, public-key, hash function and digital signature Cryptography, describing.
Digital Signatures and Hash Functions. Digital Signatures.
Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:
Henric Johnson1 Chapter3 Public-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology, Sweden
1 Information System Security AABFS-Jordan Summer 2006 Digital Signature and Hashing Functions Prepared by: Maher Abu Hamdeh & Adel Hamdan Supervised by:
Cryptography and Network Security Chapter 11 Fourth Edition by William Stallings Lecture slides by Lawrie Brown/Mod. & S. Kondakci.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
1 Message Authentication and Hash Functions Authentication Requirements Authentication Functions Message Authentication Codes Hash Functions Security of.
CRYPTOGRAPHIC DATA INTEGRITY ALGORITHMS
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Acknowledgements: William Stallings.William Stallings All rights Reserved Session 4 Public Key Cryptography (Part 2) Network Security Essentials Application.
Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.
1 Chapter 11: Message Authentication and Hash Functions Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal,
Hash Functions A hash function H accepts a variable-length block of data M as input and produces a fixed-size hash value h = H(M) Principal object is.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!
11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.
11-Basic Cryptography Dr. John P. Abraham Professor UTPA.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography.
Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy
Cryptography and Network Security (CS435) Part Nine (Message Authentication)
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.
IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.
Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.
CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.
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.
@Yuan Xue 285: Network Security CS 285 Network Security Digital Signature Yuan Xue Fall 2012.
Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Christof Paar and Jan Pelzl Chapter 12.
Message Authentication Code
Chapter 12 – Hash Algorithms
Information and Computer Security CPIS 312 Lab 9
CS457 Introduction to Information Security Systems
Cryptographic Hash Functions & Digital Signatures
Computer Communication & Networks
Cryptographic Hash Functions
Cryptographic Hash Function
CSCE 715: Network Systems Security
B. R. Chandavarkar CSE Dept., NITK Surathkal
Message Authentication and Hash Functions
Cryptographic Hash Functions
Presented by: Dr. Munam Ali Shah
Digital Signatures Last Updated: Oct 14, 2017.
NET 311 Information Security
Cryptography and Network Security Chapter 11
ICS 454 Principles of Cryptography
Cryptography and Network Security Chapter 11
Security through Encryption
Chapter 11 – Message Authentication and Hash Functions
Security.
Message Authentication and Hash Functions
NETW4005 COMPUTER SECURITY - A
ICS 454 Principles of Cryptography
Chapter -8 Digital Signatures
DISSERTATION ON CRYPTOGRAPHY.
Message Authentication Code
Chapter 3 - Public-Key Cryptography & Authentication
Hashing Hash are the auxiliary values that are used in cryptography.
Introduction to Cryptography
One-way Hash Function Network Security.
Hash Function Requirements
CRYPTOGRAPHY & NETWORK SECURITY
Digital Signature Standard (DSS)
Message Authentication
Presentation transcript:

Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS Cryptography Techniques (CNET-326)

Hash Function A hash function H accepts a variable-length block of data M as input and produces a fixed-size hash value h = H(M). The kind of hash function needed for security applications is referred to as a cryptographic hash function. A cryptographic hash function is an algorithm for which it is computationally infeasible (because no attack is significantly more efficient than brute force) to find either (a) a data object that maps to a pre-specified hash result (the one-way property) or (b) two data objects that map to the same hash result.

Hash Function Figure 11.1 depicts the general operation of a cryptographic hash function. Typically, the input is padded out to an integer multiple of some fixed length (e.g., 1024 bits), and the padding includes the value of the length of the original message in bits. The length field is a security measure to increase the difficulty for an attacker to produce an alternative message with the same hash value.

Hash Function

Applications of Hash Function Applications of Cryptographic Hash Functions 1. Message Authentication 2. Digital Signatures

Applications of Cryptographic Hash Functions 1. Message Authentication Message authentication is a mechanism or service used to verify the integrity of a message. When a hash function is used to provide message authentication, the hash function value is often referred to as a message digest. The essence of the use of a hash function for message authentication is as follows. The sender computes a hash value as a function of the bits in the message and transmits both the hash value and the message. The receiver performs the same hash calculation on the message bits and compares this value with the incoming hash value. If there is a mismatch, the receiver knows that the message (or possibly the hash value) has been altered (Figure 11.2a).

Use of hash function to check data integrity

Message Authentication Code (MAC) Message authentication is achieved using a message authentication code (MAC), also known as a keyed hash function. Typically, MACs are used between two parties that share a secret key to authenticate information exchanged between those parties. A MAC function takes as input a secret key and a data block and produces a hash value, referred to as the MAC, which is associated with the protected message. If the integrity of the message needs to be checked, the MAC function can be applied to the message and the result compared with the associated MAC value. An attacker who alters the message will be unable to alter the associated MAC value without knowledge of the secret key

Message Authentication Code Stallings Figure 11.4a “Message Authentication” shows the use of a MAC just for authentication.

Applications of Cryptographic Hash Functions 2. Digital Signatures Another important application, which is similar to the message authentication application,is the digital signature. In the case of the digital signature, the hash value of a message is encrypted with a user’s private key. Anyone who knows the user’s public key can verify the integrity of the message that is associated with the digital signature.

Digital Signatures Figure 11.4 illustrates, in a simplified fashion, how a hash code is used to provide a digital signature. A. The hash code is encrypted, using public-key encryption with the sender’s private key. B. If confidentiality as well as a digital signature is desired, then the message plus the private-key-encrypted hash code can be encrypted using a symmetric secret key. This is a common technique.

Simplified Examples of Digital Signatures

Requirements for a CRYPTOGRAPHIC HASH FUNCTIONS H