Главная
Study mode:
on
1
Intro
2
PostQuantum Crypto
3
Classical Functions
4
Does it make sense
5
Is it secure
6
Block ciphers
7
Simons algorithm
8
Whats really happening
9
Hidden Shift Problem
10
What We Know
11
Coset Sampling
12
Evan Mansoor
13
Is this fix a good idea
14
Random selfreducible
15
Decisional version
16
Generic fit
17
Security reductions
18
Summary
19
Future work
Description:
Explore a groundbreaking paper on post-quantum cryptography presented at Eurocrypt 2017. Delve into the concept of quantum-secure symmetric key cryptography based on hidden shifts. Examine classical functions, block ciphers, and Simon's algorithm to understand the foundations of this approach. Investigate the Hidden Shift Problem and its implications for cryptographic security. Learn about coset sampling, random self-reducibility, and the decisional version of the problem. Analyze security reductions and consider the potential impact on future cryptographic systems. Gain insights into the challenges and opportunities in developing quantum-resistant encryption methods.

Quantum Secure Symmetric Key Cryptography Based on Hidden Shifts

TheIACR
Add to list
0:00 / 0:00