Главная
Study mode:
on
1
Introduction
2
Hash Functions
3
Security Goals
4
NearCollision
5
Lower Level
6
NearCollisions
7
Collision Environments
8
Truncation
9
Collision Attack
10
Memory Trailer
11
How does this work
12
Complexity analysis
13
Examples
14
Second Contribution
15
Complexity
16
Degenerates
17
Summary
18
Question
Description:
Explore the concept of time-memory trade-offs for near-collisions in cryptography through this insightful talk presented at FSE 2013 by Gaëtan Leurent. Delve into hash functions, security goals, and near-collision attacks while examining collision environments and truncation techniques. Gain a comprehensive understanding of complexity analysis, practical examples, and the implications of this research on cryptographic security. Learn about the second contribution of the study and its complexity, as well as degenerate cases. Conclude with a summary and engage in a thought-provoking question-and-answer session to solidify your grasp of this advanced cryptographic topic.

Time-Memory Trade-Offs for Near-Collisions

TheIACR
Add to list