Главная
Study mode:
on
1
Intro
2
Hamming code Parity check matrix (n=7,k= 4)
3
Coding theory
4
Code-based encryption
5
Consequence of security analysis
6
Decoding problem
7
Different views on decoding
8
The Niederreiter cryptosystem 11
9
Note on codes
10
Security notions and codes
11
Generic attack: Brute force Given K and s=ke, find e with wt(e) = t.
12
Generic attack: Information-set decoding, 1962 Prange
13
Lee-Brickell attack
14
Stern's attack
15
Binary Goppa code
16
How to hide nice code?
Description:
Explore code-based cryptography assumptions in this 50-minute lecture by Tanja Lange from Technische Universiteit Eindhoven. Delve into topics such as Hamming codes, parity check matrices, and coding theory. Examine code-based encryption, security analysis consequences, and the decoding problem from various perspectives. Learn about the Niederreiter cryptosystem and security notions related to codes. Investigate generic attacks, including brute force and information-set decoding methods like the Lee-Brickell and Stern's attacks. Gain insights into binary Goppa codes and techniques for concealing code structures. This talk, part of the Quantum Cryptanalysis of Post-Quantum Cryptography series at the Simons Institute, provides a comprehensive overview of fundamental concepts in code-based cryptography.

Overview of Code-Based Crypto Assumptions

Simons Institute
Add to list