Introduction Analysis of the MD4 family The Design of SIMD Attacks on New Hash Functions

icon

139

pages

icon

English

icon

Documents

Écrit par

Publié par

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
icon

139

pages

icon

English

icon

Ebook

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Introduction Analysis of the MD4 family The Design of SIMD Attacks on New Hash Functions Design and Analysis of Hash Functions Gaëtan Leurent École normale supérieure Paris, France Ph.D. Defense September 30, 2010 G. Leurent (ENS) Design and Analysis of Hash Functions September 30, 2010 1 / 59

  • md4 family

  • supérieure de paris

  • no structural

  • hash functions

  • ecole normale

  • output can

  • any key

  • introduction analysis


Voir Alternate Text

Publié par

Nombre de lectures

24

Langue

English

Poids de l'ouvrage

2 Mo

Introduction
Analysis of the MD4 family
The Design ofSIMD
Attacks on New Hash Functions
Design and Analysis of Hash Functions
G. Leurent (ENS)
Gaëtan Leurent
École normale supérieure Paris, France
Ph.D. Defense September 30, 2010
Design and Analysis of Hash Functions
September 30, 2010
1 / 59
Introduction
I
I
Analysis of the MD4 family
The Design ofSIMD
An Ideal Hash Function: the
Attacks on New Hash Functions
Random Oracle
Public Random Oracle The output can be used as a fingerprint of the document
G. Leurent (ENS)
Design and Analysis of Hash Functions
September 30, 2010
2 / 59
Introduction
I
I
Analysis of the MD4 family
The Design ofSIMD
Attacks on New Hash Functions
An Ideal Hash Function: the Random Oracle
0x1d66ca77ab361c6f
Public Random Oracle The output can be used as a fingerprint of the document
G. Leurent (ENS)
Design and Analysis of Hash Functions
September 30, 2010
2 / 59
Introduction
I
I
Analysis of the MD4 family
The Design ofSIMD
A Concrete Hash Function
A public function with no structural property. ICryptographic strength without any key!
F:{0,1}
→ {0,1}n
G. Leurent (ENS)
F
Design and Analysis of Hash Functions
Attacks on New Hash Functions
0x1d66ca77ab361c6f
September 30, 2010
3 / 59
Introduction
I
I
Analysis of the MD4 family
The Design ofSIMD
A Concrete Hash Function
Apublicfunction withno structural property. ICryptographic strength without any key!
F:{0,1}
→ {0,1}n
G. Leurent (ENS)
F
Design and Analysis of Hash Functions
Attacks on New Hash Functions
0x1d66ca77ab361c6f
September 30, 2010
3 / 59
Introduction
Analysis of the MD4 family
Preimage attack
GivenFandH, findM Ideal security: 2n.
G. Leurent (ENS)
?
The Design ofSIMD
Security goals
F
s.t.F(M) =H.
0xb58bff99
Design and Analysis of Hash Functions
Attacks on New Hash Functions
September 30, 2010
4 / 59
Introduction
Analysis of the MD4 family
Second-preimage attack
=
?
GivenFandM1, findM2 Ideal security: 2n.
G. Leurent (ENS)
The Design ofSIMD
Security goals
F
F
0xf46cc414
=M1s.t.F(M1) =F(M2).
Design and Analysis of Hash Functions
Attacks on New Hash Functions
September 30, 2010
4 / 59
Introduction
Analysis of the MD4 family
Collision attack
?
=
?
The Design ofSIMD
Security goals
F
F
GivenF, findM16=M2s.t.F(M1) =F(M2). 2 Ideal security: 2n/.
G. Leurent (ENS)
Design and Analysis of Hash Functions
?
Attacks on New Hash Functions
September 30, 2010
4 / 59
Introduction
Analysis of the MD4 family
The Design ofSIMD
Using Hash Functions
Hash functions are used in many different contexts:
I
I
I
I
To generateunique identifiers IHash-and-sign signatures ICommitment schemes
As aone-wayfunction IOne-Time-Passwords IForward security
Tobreak the structureof the input IEntropy extractors IKey derivation IPseudo-random number generator
To buildMACs IHMAC IChallenge/response authentication
G. Leurent (ENS)
Design and Analysis of Hash Functions
Attacks on New Hash Functions
September 30, 2010
5 / 59
Introduction
I
Analysis of the MD4 family
The Design ofSIMD
Hash function design
Build a smallcompression function, anditerate.
I
I I
Cut the message in chunksM0, ...Mk Hi=f(Mi,H1) F(M) =Hk
M0
IV
G. Leurent (ENS)
f
M1
H0
f
M2
H1
f
Design and Analysis of Hash Functions
M3
H2
f
Attacks on New Hash Functions
H3
September 30, 2010
6 / 59
Voir Alternate Text
  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • Podcasts Podcasts
  • BD BD
  • Documents Documents
Alternate Text