Seyed Amir Hossain Naseredini

Slides:



Advertisements
Similar presentations
Lecture 5: Cryptographic Hashes
Advertisements

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”
Hashing Algorithms: SHA-3 CSCI 5857: Encoding and Encryption.
Your Security in the IT Market Hash Function Design: Overview of the basic components in SHA-3 competition Daniel Joščák, S.ICZ a.s. & MFF UK.
Towards SHA-3 Christian Rechberger, KU Leuven. Fundamental questions in CS theory Do oneway functions exist? Do collision-intractable functions exist?
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
Hash functions a hash function produces a fingerprint of some file/message/data h = H(M)  condenses a variable-length message M  to a fixed-sized fingerprint.
Cryptography and Network Security Hash Algorithms.
1 Pertemuan 09 Hash and Message Digest Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.
CS470, A.SelcukHash Functions1 Cryptographic Hash Functions CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Hash Functions Nathanael Paul Oct. 9, Hash Functions: Introduction Cryptographic hash functions –Input – any length –Output – fixed length –H(x)
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
HASH Functions.
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.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2015 Nitesh Saxena.
Theory of Computation II Topic presented by: Alberto Aguilar Gonzalez.
Week 4 - Friday.  What did we talk about last time?  Snow day  But you should have read about  Key management.
Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy
Hash Functions Ramki Thurimella. 2 What is a hash function? Also known as message digest or fingerprint Compression: A function that maps arbitrarily.
CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.
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.
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 :
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
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.
High-Speed Architectures of the Cryptographic Hash Function BLAKE E.Umashankar, , M.E,VLSI Design Guide By Ms.M.Saroshree,A.P,ECE.
Practical Aspects of Modern Cryptography Josh Benaloh & Brian LaMacchia.
Chapter 12 – Hash Algorithms
RSA Laboratories’ PKCS Series - a Tutorial
Cryptographic Hash Functions & Digital Signatures
Key Exchange References: Applied Cryptography, Bruce Schneier
CS/ECE 578 Cyber Security Dr. Attila Altay Yavuz
CSCE 715: Network Systems Security
CSE 4095 Digital Signatures and Hashing
MD5 A Hash Algorithm….
Cryptographic Hash Functions
Cryptographic Hash Function
Cryptography and Network Security (Various Hash Algorithms)
Cryptographic Hash Functions
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
The Hash Function Dr. Ron Eaglin.
Cryptographic Hash Functions Part I
Cryptography Lecture 13.
Cryptographic Hash Functions
ICS 454 Principles of Cryptography
How to Break MD5 and Other Hash Functions
Cryptographic Hash Functions
Message Authentication Codes, Hashes and Message Digests
Practical Aspects of Modern Cryptography
CS/ECE 478 Introduction to Network Security Dr. Attila Altay Yavuz
CSCE 715: Network Systems Security
ICS 454 Principles of Cryptography
Message Authentication
Lecture 4.1: Hash Functions: Introduction
Cryptographic Hash Functions Part I
CIS 4930/6930 – Privacy-Preserving and Trustworthy Cyber-Systems Dr
Lecture 4.1: Hash Functions, and Message Authentication Codes
Cryptography Lecture 14.
Hashing Hash are the auxiliary values that are used in cryptography.
Cryptography Lecture 13.
Cryptography Lecture 13.
Lecture 4: Hash Functions
CRYPTOGRAPHY & NETWORK SECURITY
Cryptographic Hash Functions
Presentation transcript:

Seyed Amir Hossain Naseredini Cryptographic Hash Functions Definition, History and Cryptanalysis Seyed Amir Hossain Naseredini Computer and Information Technology Engineering Department Spring, 2017

Outline About our laboratory Introduction History 2 Outline About our laboratory Introduction History Cryptographic hash function Application ARX-Design hash function An example Cryptanalysis Hash functions’ cryptanalysis Why cryptanalysis Conclusion

About our laboratory Data Security Research Laboratory Under supervision of Professor B. Sadeghiyan Research Area Cryptography Cryptanalysis Security protocols Computer forensic Malware detection Vulnerability Detection

Introduction Cryptographic hash function Introduced by Diffie and Hellman Security requirement Collision resistance Pre-image resistance Second pre-image resistance MD4 was the first cryptographic hash function SHS hash function By NIST Hash function cryptanalysis by Wang et al. SHA-3 competition Select a standard hash function Cryptanalysis To find a flaw

Early History Introduced by Diffie and Hellman 1976 The first collision resistant hash function Merkle and Damgard 1989 Cryptographic hash function received more attention 1990s MD4 Cryptanalysis Dobbertin 1995 A huge step in hash function cryptanalysis Wang et al. 2004

Cryptographic Hash Function Introduction Input: m (variable length) Output: H (fixed length) ℎ 𝑚 =𝐻 Cryptographic hash function Collision resistance 𝑚 1 ≠ 𝑚 2 ↛h 𝑚 1 =ℎ( 𝑚 2 ) Pre-image resistance ℎ 𝑚 =𝐻 ,H↛𝑚 Second pre-image resistance ℎ 𝑚 1 =𝐻 , 𝑚 1 ≠ 𝑚 2 ↛ℎ 𝑚 2 =𝐻

Cryptographic Hash Function (cont’d) Two different types Modification Detection Code (MDC) Message Authentication Code(MAC) Message Hash function MAC function Hash MAC Key

Cryptographic Hash Function (cont’d) A Taxonomy MDC One Way Hash Functions (OWHF) Collision Resistant Hash Functions (CRHF) Universal One Way Hash Functions (UOWHF) MAC Application Based on speed/resistance Some usual applications Store passwords Digital Signature Zero-Knowledge proof Use as a PRNG etc.

Cryptographic Hash Function (cont’d) ARX-Design hash functions Use only three operations modular Addition Rotation Xor Modular addition provides nonlinearity Rotation prevents the balance XOR complicates the function ARX operations are functionally complete Security is a common belief and has not been proven.

Cryptographic Hash Function (cont’d) ShA-3 competition finalists BLAKE (Aumasson et al.) Grøstl (Knudsen et al.) JH (Hongjun Wu) Keccak (Keccak team, Daemen et al.) Skein (Schneier et al.) Let’s take a look at BLAKE hash function

Cryptographic Hash Function (cont’d) BLAKE hash function Designed to compete in SHA-3 Did pass to final round ARX-Design ℎ, the compression function Inputs: ℎ= ℎ 0 ,…, ℎ 7 𝑚= 𝑚 0 ,…, 𝑚 15 𝑠= 𝑠 0 ,…, 𝑠 3 𝑡= 𝑡 0 , 𝑡 1 Output: ℎ′= ℎ′ 0 ,…, ℎ′ 7

Cryptographic Hash Function (cont’d) BLAKE hash function Using 𝐺 in compression function (ℎ)

Cryptographic Hash Function (cont’d) BLAKE hash function Column step and diagonal step

Cryptographic Hash Function (cont’d) BLAKE hash function Final round Iterative algorithm

Hash Functions’ Cryptanalysis Purpose Pre-image Second pre-image Collision Others Pseudo collision Length extension Birthday paradox Range: q The number of input data: k 1− 𝑒 −𝑘(𝑘−1)/2𝑞

Hash Functions’ Cryptanalysis (cont’d) Cryptanalysis of hash functions Differential cryptanalysis Reflection cryptanalysis Boomerang attack Linear cryptanalysis Rotational cryptanalysis Cube attack Algebraic cryptanalysis Statistical Sophisticated High data complexity Algebraic Newer Low data complexity

Noteworthy cryptanalysis MD5 differential cryptanalysis 2005, Wang et al. A huge step Cube attack on MD6 2009, Aumasson et al. Rotational cryptanalysis on ARX-Design 2010, Khovratovich and Nikolic Linear cryptanalysis of CubeHash 2011, Ashur and Dukelman Algebraic cryptanalysis on Keccak 2013, Morawiecki and Srebrny

Noteworthy cryptanalysis (cont’d) Some results Algebraic cryptanalysis of Keccak

Conclusion Talked about cryptographic hash functions Cryptanalysis History Application A taxonomy ARX-Design hash function An example Cryptanalysis Hash functions’ cryptanalysis Purpose of cryptanalysis Some results

Any Question?