HASH ALGORITHMS - Chapter 12

Slides:

Advertisements

Similar presentations

Symmetric Message Authentication Codes Prof. Ravi Sandhu.

Advertisements

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.

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.

17.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 17 Security at the Transport Layer: SSL and TLS.

Cryptography and Network Security Chapter 12 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

1 Chapter 5 Hashes and Message Digests Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :

Goal Ensure integrity of messages, even in presence of

Hash and MAC Algorithms

Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:

Cryptography and Network Security Chapter 12

Cryptography and Network Security Hash Algorithms.

Cryptography and Network Security (CS435) Part Ten (Hash and MAC algorithms)

Information Security and Management 11

SHA (secure hash algorithm) Jen-Chang Liu, 2005 Adapted from lecture slides by Lawrie Brown.

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.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

Cryptography and Network Security Chapter 12 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 4 Data Authentication Part I.

1 Pertemuan 09 Hash and Message Digest Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

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

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.

1 Cryptography and Network Security (Various Hash Algorithms) Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Changed by Somesh Jha)

Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.

Announcement Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed. 1.

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

Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.

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

© 2006 Cisco Systems, Inc. All rights reserved. Network Security 2 Module 3: VPN and Encryption Technology.

Hash and MAC Algorithms Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 12/3/2009 INCS 741: Cryptography 12/3/20091Dr. Monther Aldwairi.

Message Authentication Code July Message Authentication Problem  Message Authentication is concerned with:  protecting the integrity of a message.

Chapter 21 Public-Key Cryptography and Message Authentication.

Data & Network Security

Hash and MAC Functions CS427 – Computer Security

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

1 Network Security Lecture 5 Hashes and Message Digests Waleed Ejaz

Hash and Mac Algorithms. Contents Hash Functions Secure Hash Algorithm HMAC.

CSCE 815 Network Security Lecture 8 SHA Operation and Kerberos.

Chapter 4 Message Authentication MSc. NGUYEN CAO DAT Dr. TRAN VAN HOAI 1.

Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.

A Quick Tour of Cryptographic Primitives Anupam Datta CMU Fall A: Foundations of Security and Privacy.

Hash Algorithms see similarities in the evolution of hash functions & block ciphers –increasing power of brute-force attacks –leading to evolution in algorithms.

Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.

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

Understanding Cryptography – A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl Chapter 11 – Hash Functions.

Cryptography Fundamentals

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

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

Potential vulnerabilities of IPsec-based VPN

1 Chapter 12: Hash and MAC Algorithms Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal, U of Kentucky)

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

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

Information Security and Management 11. Cryptographic Hash Functions Chih-Hung Wang Fall

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

Hash Algorithms Ch 12 of Cryptography and Network Security - Third Edition by William Stallings Modified from lecture slides by Lawrie Brown CIM3681 :

Message Authentication Codes CSCI 5857: Encoding and Encryption.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

 Encryption provides confidentiality  Information is unreadable to anyone without knowledge of the key  Hashing provides integrity  Verify the integrity.

Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.

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

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

Chapter 12 – Hash Algorithms

Information and Computer Security CPIS 312 Lab 9

BPSEC Updates Edward Birrane

MAC: Message Authentication Code

Cryptographic Hash Functions

Presentation transcript:

HASH ALGORITHMS - Chapter 12 MD5 SHA RIPEMD-160 HMAC

Elementary Operations MD5 Message Digest Compression Elementary Operations

MESSAGE DIGEST GENERATION MD5

MD5 COMPRESSION FUNCTION

ELEMENTARY MD5 OPERATION

KEY ELEMENTS OF MD5 B C D || F G H I Table 9.1 – truth table B C D || F G H I -------------------------------------- 0 0 0 || 0 0 0 1 0 0 1 || 1 0 1 0 0 1 0 || 0 1 1 0 0 1 1 || 1 0 0 1 1 0 0 || 0 0 1 1 1 0 1 || 0 1 0 1 1 1 0 || 1 1 0 0 1 1 1 || 1 1 1 0

SECURE HASH ALGORITHM SHA-1 Message Digest Compression Elementary Operations

SHA-1 COMPRESSION FUNCTION

ELEMENTARY SHA OPERATION

TRUTH TABLE for ft – SHA-1 B C D || f0..19 f20..39 f40..59 f60..79 ---------------------------------------------------------------------------- 0 0 0 | 0 0 0 0 0 0 1 | 1 1 0 1 0 1 0 | 0 1 0 1 0 1 1 | 1 0 1 0 0 0 | 0 1 0 1 1 0 1 | 0 0 1 0 1 0 | 1 0 1 0 1 1 1 | 1 1 1 1

CREATION OF 80-WORD I/P

Comparison: MD5 vs SHA1 MD5 message digest – 128 bits SHA-1 message digest – 160 bits Find two messages with same digest: MD5 – 264 operations SHA-1 - 280 operations

message digest lengths: 256, 384, 512 NEW SHA ALGORITHMS SHA-256 SHA-384 SHA-512 message digest lengths: 256, 384, 512 to provide compatibility with AES (see Tables 12.3 and 12.4)

Elementary Operations RIPEMD - 160 Message Digest Compression Elementary Operations

RIPEMD – 160 COMPRESSION FUNCTION

RIPEMD – 160 ELEMENTARY OPERATION

RIPEMD – 160 - data Tables 12.5 – 12.9

HASH FUNCTIONS - comparisons Table 12.8 - comparison Table 12.9 - relative performance

HMAC – a MAC from a HASH Why? Hash functions (e.g. MD5, SHA-1) execute faster than Sym. Key (e.g. DES) HMAC combines HASH with Secret Key to make a MAC HMACK(M) = H[(K+ + opad)||H[K+ + ipad)||M]] Security(H)  Security(HMAC)

HMAC STRUCTURE

EFFICIENT IMPLEMENTATION of HMAC