Главная
Study mode:
on
1
Intro
2
outline
3
Cryptographic hash function
4
Aside - how Merkle used crypto puzzles!
5
Crypto puzzle - a bit more formal
6
Example Protocol (TLS)
7
Example Output (bitcoin)
8
What are our fixed resources
9
Computation Comparison
10
Memory Bandwidth Comparison
11
RAM VS. CPU
12
Takeaway – why sequentially memory hard?
13
Sliding Tile Problem
14
Momentum
15
Cuckoo Cycle
16
Call to Action
17
QUESTIONS?
Description:
Explore the intricacies of cryptographic puzzles in this 32-minute conference talk from BSides Boston 2015. Delve into the world of cryptographic hash functions, learning about their applications in protocols like TLS and cryptocurrencies such as Bitcoin. Examine the concept of crypto puzzles, their formal definition, and their significance in modern cryptography. Analyze the fixed resources in cryptographic systems, comparing computation and memory bandwidth. Understand the importance of sequentially memory-hard puzzles and their advantages over CPU-intensive alternatives. Discover innovative puzzle designs like the Sliding Tile Problem, Momentum, and Cuckoo Cycle. Gain insights into the pursuit of better crypto puzzles and their potential impact on future cryptographic systems.

In Pursuit of a Better Crypto Puzzle

Add to list
0:00 / 0:00