Dan Boneh Collision resistance Generic birthday attack Online Cryptography Course Dan Boneh.

Slides:

Advertisements

Similar presentations

Hash Tables:. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Advertisements

Dan Boneh Message integrity Message Auth. Codes Online Cryptography Course Dan Boneh.

ElGamal Security Public key encryption from Diffie-Hellman

Online Cryptography Course Dan Boneh

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”

Dan Boneh Stream ciphers Real-world Stream Ciphers Online Cryptography Course Dan Boneh.

Message Authentication Codes (MACs) and Hashes David Brumley Carnegie Mellon University Credits: Many slides from Dan Boneh’s June 2012.

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Dan Boneh Message Integrity A Parallel MAC Online Cryptography Course Dan Boneh.

Authentication and Digital Signatures CSCI 5857: Encoding and Encryption.

Notation Intro. Number Theory Online Cryptography Course Dan Boneh

1 CIS 5371 Cryptography 4. Collision Resistant Hash Functions B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

CNS2010handout 10 :: digital signatures1 computer and network security matt barrie.

Announcements: 1. Class cancelled tomorrow 2. HW7 due date moved to Thursday. Questions? This week: Birthday attacks, Digital signatures Birthday attacks,

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

CS470, A.SelcukHash Functions1 Cryptographic Hash Functions CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.

Dan Boneh Intro. Number Theory Modular e’th roots Online Cryptography Course Dan Boneh.

Dan Boneh Basic key exchange The Diffie-Hellman protocol Online Cryptography Course Dan Boneh.

Dan Boneh Public Key Encryption from trapdoor permutations The RSA trapdoor permutation Online Cryptography Course Dan Boneh.

Dan Boneh Introduction What is cryptography? Online Cryptography Course Dan Boneh.

Dan Boneh Intro. Number Theory Intractable problems Online Cryptography Course Dan Boneh.

Dan Boneh Introduction Course Overview Online Cryptography Course Dan Boneh.

Dan Boneh Odds and ends Key Derivation Online Cryptography Course Dan Boneh.

Dan Boneh Stream ciphers The One Time Pad Online Cryptography Course Dan Boneh.

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Topic 22: Digital Schemes (2)

Dan Boneh Block ciphers More attacks on block ciphers Online Cryptography Course Dan Boneh.

1 Hashes and Message Digests. 2 Hash Also known as –Message digest –One-way function Function: input message -> output One-way: d=h(m), but not h’(d)

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Dan Boneh Public Key Encryption from trapdoor permutations Is RSA a one-way function? Online Cryptography Course Dan Boneh.

Dan Boneh Introduction Discrete Probability (crash course) Online Cryptography Course Dan Boneh See also:

Dan Boneh Introduction Discrete Probability (crash course) Online Cryptography Course Dan Boneh.

Brand-New Hash Function   BeeM A. Satoh SCIS2006 SHA-1 Broken! Prof. Xiaoyun Wang.

1 Hash Functions. 2 A hash function h takes as input a message of arbitrary length and produces as output a message digest of fixed length

Dan Boneh Collision resistance Introduction Online Cryptography Course Dan Boneh.

Dan Boneh Basic key exchange Merkle Puzzles Online Cryptography Course Dan Boneh.

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

Dan Boneh Message Integrity CBC-MAC and NMAC Online Cryptography Course Dan Boneh.

Prepared by Dr. Lamiaa Elshenawy

Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy

Notation Intro. Number Theory Online Cryptography Course Dan Boneh

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

Dan Boneh Stream ciphers Stream ciphers are semantically secure Online Cryptography Course Dan Boneh Goal: secure PRG ⇒ semantically secure stream cipher.

Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.3 Hash Functions.

Ryan Henry I 538 /B 609 : Introduction to Cryptography.

CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.

Dan Boneh Collision resistance The Merkle-Damgard Paradigm Online Cryptography Course Dan Boneh.

Dan Boneh Stream ciphers PRG Security Defs Online Cryptography Course Dan Boneh.

Dan Boneh Intro. Number Theory Fermat and Euler Online Cryptography Course Dan Boneh.

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

Dan Boneh Intro. Number Theory Arithmetic algorithms Online Cryptography Course Dan Boneh.

The Birthday Paradox July Definition 2 Birthday attacks are a class of brute-force techniques that target the cryptographic hash functions. The.

1 4.1 Hash Functions and Data Integrity A cryptographic hash function can provide assurance of data integrity. ex: Bob can verify if y = h K (x) h is a.

Dan Boneh Introduction Discrete Probability (crash course, cont.) Online Cryptography Course Dan Boneh See also:

Dan Boneh Public Key Encryption from trapdoor permutations Constructions Online Cryptography Course Dan Boneh Goal: construct chosen-ciphertext secure.

Dan Boneh Collision resistance Timing attacks on MAC verification Online Cryptography Course Dan Boneh.

Topic 26: Discrete LOG Applications

A way to detect a collision…

Cryptographic Hash Functions Part I

Cryptography Lecture 13.

Cryptography Lecture 19.

Cryptographic Hash Functions

Cryptographic Hash Functions Part I

Cryptography Lecture 14.

Cryptography Lecture 14.

Cryptography Lecture 13.

SHA: Secure Hash Algorithm

Cryptography Lecture 13.

Lecture 4: Hash Functions

Cryptography Fundamentals

Presentation transcript:

Dan Boneh Collision resistance Generic birthday attack Online Cryptography Course Dan Boneh

Dan Boneh Generic attack on C.R. functions Let H: M  {0,1} n be a hash function ( |M| >> 2 n ) Generic alg. to find a collision in time O(2 n/2 ) hashes Algorithm: 1.Choose 2 n/2 random messages in M: m 1, …, m 2 n/ 2 (distinct w.h.p ) 2.For i = 1, …, 2 n/2 compute t i = H(m i ) ∈ {0,1} n 3.Look for a collision (t i = t j ). If not found, got back to step 1. How well will this work?

Dan Boneh The birthday paradox Let r 1, …, r n ∈ {1,…,B} be indep. identically distributed integers. Thm: when n = 1.2 × B 1/2 then Pr [ ∃ i≠j: r i = r j ] ≥ ½ Proof: (for uniform indep. r 1, …, r n )

Dan Boneh B=10 6 # samples n

Dan Boneh Generic attack H: M  {0,1} n. Collision finding algorithm: 1.Choose 2 n/2 random elements in M: m 1, …, m 2 n/2 2.For i = 1, …, 2 n/2 compute t i = H(m i ) ∈ {0,1} n 3.Look for a collision (t i = t j ). If not found, got back to step 1. Expected number of iteration ≈ 2 Running time: O(2 n/2 ) (space O(2 n/2 ) )

Dan Boneh Sample C.R. hash functions: Crypto [ Wei Dai ] AMD Opteron, 2.2 GHz ( Linux) digest generic functionsize (bits)Speed (MB/sec)attack time SHA SHA SHA Whirlpool NIST standards * best known collision finder for SHA-1 requires 2 51 hash evaluations

Dan Boneh End of Segment