Your Security in the IT Market www.i.cz Hash Function Design: Overview of the basic components in SHA-3 competition Daniel Joščák, S.ICZ a.s. & MFF UK.

Slides:

Advertisements

Similar presentations

Your Security in the IT Market Beyond the MD5 Collisions Daniel Joščák, S.ICZ a.s. & MFF UK 04/05/2007, SPI Brno.

Advertisements

About a new generation of block ciphers and hash functions - DN and HDN Vlastimil Klíma Independent consultant

1 EUNICE 2010, June, 2010, Swiss army knife in cryptography and information security - cryptographic hash functions Swiss army knife in cryptography.

Hashing Algorithms: SHA-3 CSCI 5857: Encoding and Encryption.

1 Some Current Thinking on Hash Functions Within NIST John Kelsey, NIST, June 2005.

 Stream ciphers o Encrypt chars/bits one at a time o Assume XOR w the key, need long key to be secure  Keystream generators (pseudo-random key) o Synchronous.

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.

PIITMadhumita Chatterjee Security 1 Hashes and Message Digests.

Announcements: 1. HW7 due next Tuesday. 2. Inauguration today! Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman,

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.

Chapter 5 Cryptography Protecting principals communication in systems.

Announcements:Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions and SHA-1 Hash Functions.

Cryptography and Network Security Hash Algorithms.

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

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

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)

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

Lecture 23 Symmetric Encryption

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

Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

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

Cryptographic Hash Functions July Topics  Overview of Cryptography Hash Function  Usages  Properties  Hashing Function Structure  Attack on.

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.

XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions J. Buchmann, E. Dahmen, A. Hülsing | TU Darmstadt |

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

HASH Functions.

Message Authentication  message authentication is concerned with: protecting the integrity of a message protecting the integrity of a message validating.

Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.

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.

Blowfish A widely used block cipher. Blowfish Designed by Bruce Schneier (1993) A variant of it (Twofish) was an AES finalist candidate 64-bit block size,

Cryptographic Hash Functions June Topics  Overview of Cryptography Hash Function  Usages  Properties  Hashing Function Structure 

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

Hashing Algorithms: Basic Concepts and SHA-2 CSCI 5857: Encoding and Encryption.

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

A Case for a Parallelizable Hash Alan Kaminsky and Stanislaw Radziszowski Department of Computer Science B. Thomas Golisano College of Computing and Information.

STATISTICAL AND PERFORMANCE ANALYSIS OF SHA-3 HASH CANDIDATES Ashok V Karunakaran Department of Computer Science Rochester Institute of Technology Committee.

Cryptographic Hash Functions and Protocol Analysis

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

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.

Lecture 23 Symmetric Encryption

CS548_ ADVANCED INFORMATION SECURITY Jong Heon, Park / Hyun Woo, Cho Evaluation of Hardware Performance for the SHA-3 Candidates Using.

Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy

Chapter 2 (C) –Advanced Encryption Standard. Origins clearly a replacement for DES was needed –have theoretical attacks that can break it –have demonstrated.

Cryptography and Network Security (CS435) Part Nine (Message Authentication)

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

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)

Cryptographic Hash Functions

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.

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.

Homework #2 J. H. Wang Oct. 31, 2012.

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

CS555Spring 2012/Topic 141 Cryptography CS 555 Topic 14: CBC-MAC & Hash Functions.

High-Speed Architectures of the Cryptographic Hash Function BLAKE E.Umashankar, , M.E,VLSI Design Guide By Ms.M.Saroshree,A.P,ECE.

Cryptographic Hash Functions

Cryptographic Hash Functions

최신정보보호기술 경일대학교 사이버보안학과 김 현성.

Cryptographic Hash Functions

Cryptography Lecture 13.

Seyed Amir Hossain Naseredini

Presentation transcript:

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 07/05/2009, SPI Brno

Your Security in the IT Market Hash functions in cryptology ►Key component of many protocols ●Electronic signature ●Integrity check ●One-way function ●… ►Fingerprints or message digests

Your Security in the IT Market Good hash ftion must be ►Collision resistant: it is hard to find two distinct inputs m 1 and m 2, s.t. H(m 1 ) = H(m 2 ). ►1 st preimage resistant: given h, it is hard to find any m s.t. h = H(m). ►2 nd preimage resistant: given m 1, it is hard to find m 2 ≠ m 1 s.t. H(m 1 ) = H(m 2 ) ►Efficient (speed matters)

Your Security in the IT Market Why to build them? ►Weaknesses in old wide spread h. f. ●MD2, MD4, MD5, SHA 1 ►Real collisions producing algorithms ●Wang et al. 04 ●Klíma 05 ●Rechberger et al. 06 ●Stevens 05 and 06 (new target collisions) ‘ former functions

Your Security in the IT Market Need for a new function new candidates for SHA-3 ►“only” SHA 2 functions are fine ►SHA3 competition organized by NIST ●deadline 31. oct ●51 submissions

Your Security in the IT Market Areas for research and improvements 1.Mode of use for compression function 2.Compression function itself

Your Security in the IT Market Improvements of Merkle- Damgård construction

Your Security in the IT Market HAIFA, wide pipes, output transformation ►Examples: ARIRANG, BMW, Cheetah,Chi, Echo, Edon-R, Crunch, ECHO, ECOH, Grostl, JH, Keccak, Lux, Lane, Luffa, Lux, Skein, MD6, SIMD, Vortex…

Your Security in the IT Market Tree structure ►Example: MD6

Your Security in the IT Market Sponge structure ►Absorbing ●Initialize state ●XOR some of the message to the state ●Apply compression function ●XOR some more of the message into the state ●Apply compression function… ►Squeezing ●Apply compression function ●Extract some output ●Apply compression function ●Extract some output ●Apply compression function … ►Examples: Keccak, Luffa.

Your Security in the IT Market Improvements of Compression function

Your Security in the IT Market One step of compr. ftion ‘ MD5 ‘ SHA-1 ‘ SHA-2

Your Security in the IT Market Feedback Shift Register ►Pros: efficiency in HW, known theory from stream ciphers, easy to implement ►Cons: SW implementation, stream cipher weaknesses ►Examples: MD6, Shabal, Essence, NaSHA

Your Security in the IT Market Feistel Network ►Pros: block cipher theory, easy to implement ►Cons: can not be generalized ►Examples: ARIRANG, BLAKE, Chi, CRUNCH, DynamicSHA2, JH, Lesamnta, Sarmal, SIMD, Skein, TIB3

Your Security in the IT Market S-boxes ►Pros: theory from block ciphers, speed in HW ►Cons: often implemented as look-up tables - side channel attacks ►Examples: Cheetah, Chi, CRUNCH, ECHO, ECOH, Grostl, Hamsi, JH, Khichidy, LANE, Lesamnta, Luffa, Lux, SANDstorm, Sarmal, SHAvite-3, SWIFFTX, TIB3. (33 out of 51 candidates uses S-Boxes)

Your Security in the IT Market MDS Matrixes ►Pros: mathematical background and proven diffusion properties ►Cons: memory requirements ►Examples: ARIRANG, Cheetah, ECHO, Fugue, Grostl, JH, LANE, Lux, Sarmal, Vortex.

Your Security in the IT Market Where to look at candidates: ►NIST webpage: 3/index.html ►Hash ZOO The_SHA-3_Zoo&oldid=3106 ►Ebash hash.html ►Classification of the SHA-3 Candidates Cryptology ePrint Archive: Report 511/2008,

Your Security in the IT Market Conclusion ►Do not use MD5, MD4, MD2 ►SHA-1 is not recommended after 2009 ►Use SHA-2 instead (no weaknesses) or ►SHA-3 standard is coming in 2-3 years ►Cryptanalysis of current submissions is expected ►Second round candidates coming soon (june-august 2009, 15(?) algorithms)

Your Security in the IT Market Thank you for your attention. Daniel Joščák S.ICZ a.s. MFF UK, Dept. of Algebra