Security Proofs for the MD6 Hash Algorithm Ahmed Ezzat Outline - PowerPoint PPT Presentation

Aug 19, 2022 •298 likes •454 views

Security Proofs for the MD6 Hash Algorithm Ahmed Ezzat Outline Introduction to hash algorithms NIST SHA-3 Competition MD6 Algorithm and Mode of Operation Research Objective Approach Introduction to hash algorithms Hash

Security Proofs for the MD6 Hash Algorithm Ahmed Ezzat
Outline � Introduction to hash algorithms � NIST SHA-3 Competition � MD6 Algorithm and Mode of Operation � Research Objective � Approach
Introduction to hash algorithms � Hash function definition � Usage Scenarios � Digital Signature � Message Integrity � Password Verification
Introduction to hash algorithms � Properties � Collision resistance � First pre-image resistance � Second pre-image resistance � Pseudo randomness � Unpredictability
NIST SHA-3 Competition � Salted Hashing � Parellizable � Requirements for a message digest of d-bits: � Collision resistance of approximately d/2 bits. � First - preimage resistance of approximately d bits. � Second - preimage resistance of approximately d − k bits for any message shorter than 2 k bits.
MD6 Algorithm and Mode of Operation � Input message structure
MD6 Algorithm and Mode of Operation � Input: A[ 0 .. 88 ] of A[ 0 .. 16r + 88] for i = 89 to 16 r + 88 : = S i ⊕ ⊕ x A[ i-17 ] A[ i-89 ] ⊕ ( A[ i-18 ] ∧ A[ i-21 ] ) ⊕ ( A[ i-31 ] ∧ A[ i-67 ] ) = x ⊕ x ( x >> r i ) = x ⊕ ( x << l i ) A[i] return A[ 16r + 73 .. 16r + 88 ]
MD6 Algorithm and Mode of Operation � Mode of operation snapshot
MD6 Algorithm and Mode of Operation
MD6 Algorithm and Mode of Operation
Properties Remaining � Second pre-image resistance � Unpredictability
Research Objective The continuation of the security proofs for the MD6 hash function mode of operation
Approach � Mathematical � Empirical
References [1] Cryptographic hash function. Available at http://en.wikipedia.org/wiki/Cryptographic_hash_function [2] Christopher Yale Crutchfield. Security Proofs for the MD6 Hash Function Mode of Operation. Available at http://groups.csail.mit.edu/cis/theses/crutchfield-masters-thesis.pdf [3] The MD6 Hash Function. Available at http://groups.csail.mit.edu/cis/md6/submitted-2008-10- 27/Supporting_Documentation/md6_report.pdf

Recommend

1 Simple Hash Functions Requirements for Hash Functions 1. can be applied to any sized message M

CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Using Symmetric Ciphers for MACs can use any block cipher chaining mode and use final block as a MAC Chapter 12 Hash Algorithms Data Authentication Algorithm (DAA) is a widely used MAC

305 views • 5 slides

Welcome to PROOFS! PROOFS: Security Proofs for Embedded Systems Introduction to the fifth

Welcome to PROOFS! PROOFS: Security Proofs for Embedded Systems Introduction to the fifth workshop Introduction to the workshop PROOFS: Security Proofs for Embedded Systems UCSB August 20, 2016 5th edition of PROOFS PROOFS 2012:

311 views • 7 slides

Chapter 4 Cryptographic hash functions References: A. J. Menezes, P. C. van Oorschot, S. A.

Grenoble University M2 SCCI Security Proofs - JL Roch Chapter 4 Cryptographic hash functions References: A. J. Menezes, P. C. van Oorschot, S. A. Vanstone: Handbook of Applied Cryptography Chapter 9 - Hash Functions and Data

750 views • 48 slides

CSE 543 - Computer Security Lecture 4 - Cryptography September 6, 2007 URL:

CSE 543 - Computer Security Lecture 4 - Cryptography September 6, 2007 URL: http://www.cse.psu.edu/~tjaeger/cse543-f07/ CSE543 Computer (and Network) Security - Fall 2007 - Professor Jaeger 1 Hash Algorithms Hash algorithm

358 views • 22 slides

13 - Computer Security Hashing 1 Solution : hash

13 - Computer Security Hashing 1 Solution : hash function 0 1 n - h x 0 1 - h x is the hash/digest of x Context Goal - Represent large/sensitive message by a smaller one - Numerous

1.14k views • 68 slides

for hash-based signatures Andreas Hlsing Eindhoven University of Technology The quantum threat

Simplified security arguments for hash-based signatures Andreas Hlsing Eindhoven University of Technology The quantum threat Shors algorithm breaks RSA, (EC)DSA, (EC)DH, Grovers algorithm asymptotically reduces complexity of

694 views • 48 slides

Hash Functions, Message Hash Functions, Message Security Services Security Services

Hash Functions, Message Hash Functions, Message Security Services Security Services Authentication Codes Authentication Codes Confidentiality : Symmetric encryption solves Integrity Ahmet Burak Can Authentication Hacettepe

341 views • 4 slides

Post Quantum Cryptography Kenny Paterson Information Security Group @kennyog Lifetime of a Hash

Post Quantum Cryptography Kenny Paterson Information Security Group @kennyog Lifetime of a Hash Algorithm SHA-1 1995: SHA-1 published (NIST, tweak of 1993 SHA-0 design) 1990s: (various attacks on SHA-0, validating switch to SHA-1)

345 views • 31 slides

Cryptographic Hash Functions Signatures Requirements MD5 and SHA CSS441: Security and

CSS441 Hash Functions Hash Functions Authentication Cryptographic Hash Functions Signatures Requirements MD5 and SHA CSS441: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by

1.04k views • 24 slides

Security proofs in the symbolic model web services security, manual and automated proofs

Security proofs in the symbolic model web services security, manual and automated proofs Karthikeyan Bhargavan INRIA karthikeyan.bhargavan@inria.fr http://prosecco.inria.fr/personal/karthik September 2013 Karthikeyan Bhargavan (INRIA)

800 views • 58 slides

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee KAIST Outline Introduction - Message Authentication Code - Double-block Hash-then-Sum paradigm Our Contribution - Tight security proof of

394 views • 24 slides

Hash Functions Hash Functions 1 Cryptographic Hash Function Crypto hash function h(x) must

Hash Functions Hash Functions 1 Cryptographic Hash Function Crypto hash function h(x) must provide o Compression output length is small o Efficiency h(x) easy to compute for any x o One-way given a value y it is infeasible to find

465 views • 42 slides

Hash Truncation Tim Polk August 1, 2005 Why Hash Truncation? Assume we have confidence in a

Hash Truncation Tim Polk August 1, 2005 Why Hash Truncation? Assume we have confidence in a hash algorithm H that produces a digest of length N If an application or protocol needs a message digest of length Np, and Np < N

383 views • 7 slides

Hashing Connections 2-Universal Hash Function Perfect Hashing Anil Maheshwari Proofs

Hashing Anil Maheshwari Setting Balls & Bins Hashing Connections 2-Universal Hash Function Perfect Hashing Anil Maheshwari Proofs anil@scs.carleton.ca School of Computer Science Carleton University Canada Outline Hashing Anil

372 views • 21 slides

Better proofs for rekeying D. J. Bernstein Security of AES-256 key k is far below 2 256 in most

1 Better proofs for rekeying D. J. Bernstein Security of AES-256 key k is far below 2 256 in most protocols: (AES k (0) ; : : : ; AES k ( n 1)) is distinguishable from uniform with probability n ( n 1) = 2 129 , plus tiny key-guessing

577 views • 32 slides

{ } { } Pr { t } = by definition of Pr i [ n ] , h ( x i ) t = Pr a

1 stream from left to right and we want to minimize the memory needed by the algorithm to ac- . But, fortunately: However, the following fact seems to imply that the algorithm is wrong. thetical family of hash functions and then see how to turn

206 views • 3 slides

Security Proofs for Signature Schemes David Pointcheval David.Pointcheval@ens.fr Jacques Stern

Security Proofs for Signature Schemes David Pointcheval David.Pointcheval@ens.fr Jacques Stern Jacques.Stern@ens.fr Laboratoire dInformatique Ecole Normale Sup erieure 45, rue dUlm 75230 PARIS CEDEX 05 Security Proofs for

588 views • 12 slides

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso,

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso, Franois-Xavier Standaert Radbout University Nijmegen (The Netherlands), UCL (Belgium) EUROCRYPT 2018, Tel Aviv, Israel Motivation (side-channel security

775 views • 52 slides

Formal Security Analysis and Improvement of a hash-based

Formal Security Analysis and Improvement of a hash-based NFC M-coupon Protocol Ali Alshehri and Steve Schneider Agenda Introduc?on. Approach

498 views • 25 slides

CSCI-UA.9480 Introduction to Computer Security Session 1.1 One-Way Functions and Hash Functions

CSCI-UA.9480 Introduction to Computer Security Session 1.1 One-Way Functions and Hash Functions Prof. Nadim Kobeissi 1.1a Why Hash Functions? Describing the importance of the cryptographers Swiss Army knife. 2 CSCI-UA.9480:

569 views • 34 slides

Hash-flooding DoS reloaded: Hash flooding begins? attacks and defenses July 1998 article

Hash-flooding DoS reloaded: Hash flooding begins? attacks and defenses July 1998 article Jean-Philippe Aumasson, Designing and attacking Kudelski Security (NAGRA) port scan detection tools by Solar Designer (Alexander D. J. Bernstein,

1.83k views • 164 slides

Outline The Game-based Methodology 1 Cryptography for Computational Security Proofs

Cryptography Game-based Proofs Assumptions BF IB-Encryption Conclusion Outline The Game-based Methodology 1 Cryptography for Computational Security Proofs Introduction Provable Security David Pointcheval 2 Game-based Methodology

722 views • 10 slides

Network Security Cryptography: Cryptographic Hash Functions And Message Authentication Code

Network Security Cryptography: Cryptographic Hash Functions And Message Authentication Code F033581 Topic 2: Hash Functions and 1 Message Authentication Readings for This Lecture Wikipedia Cryptographic Hash Functions Message

689 views • 25 slides

Security Models: Proofs, Protocols and Certification Florent Autrau - Yassine Lakhnech -

Security Models: Proofs, Protocols and Certification Florent Autrau - Yassine Lakhnech - Jean-Louis Roch Master-2 Security, Cryptology and Coding of Information Systems ENSIMAG/Grenoble-INP UJF Grenoble University, France Security Models,

396 views • 20 slides