34C3 - LatticeHacks

  Рет қаралды 5,846

media.ccc.de

media.ccc.de

Күн бұрын

media.ccc.de/v...
Fun with lattices in cryptography and cryptanalysis
Lattices are an extremely useful mathematical tool for cryptography.
This talk will explain the basics of lattices in cryptography and cryptanalysis.
It’s an exciting time for public-key cryptography. With the threat of practical quantum computers looming in the next few decades, it’s high time to replace the systems that can be broken by a quantum computer with ones that remain secure even if the attacker has a quantum computer. However, this is easier said than done - there is no consensus what replacements should be chosen and how secure the systems are. NIST has just started a 5-7 year competition with the target to recommend a portfolio of post-quantum encryption and signature schemes. Considerations will be speed, bandwidth, and of course security.
Several of the submissions are based on lattices. At our current level of understanding, lattice-based cryptography offers relatively small public keys for both encryption and signatures, while having good performance and reasonably sized ciphertexts and signatures. While these features are nice and make us want to know more about lattices, that world can be a scary place full of discussions of Minkowski bounds, Gaussian distributions, and orthogonalized bases. We will show how these schemes work in accessible terms.
Lattices have been used in cryptography for more than thirty years, but for most of that only as a tool to attack systems, starting with knapsack systems in the early 80’s. Lattices can also be used to break conventional public-key cryptosystems such as RSA or Diffie-Hellman when they are incorrectly implemented. This talk will explain these fun attacks in concrete terms, with code you can run at home.
Algorithms will be presented as Python/Sage code snippets and will already be online before the talk at latticehacks.c....
This is a joint presentation by Daniel J. Bernstein, Nadia Heninger, and Tanja Lange, surveying work by many people.
djb Tanja Lange Nadia Heninger
fahrplan.event...

Пікірлер
34C3 -  Are all BSDs created equally?
58:58
media.ccc.de
Рет қаралды 9 М.
34C3 -  Public FPGA based DMA Attacking
31:27
media.ccc.de
Рет қаралды 10 М.
Inside Out 2: ENVY & DISGUST STOLE JOY's DRINKS!!
00:32
AnythingAlexia
Рет қаралды 12 МЛН
Every parent is like this ❤️💚💚💜💙
00:10
Like Asiya
Рет қаралды 16 МЛН
Life hack 😂 Watermelon magic box! #shorts by Leisi Crazy
00:17
Leisi Crazy
Рет қаралды 10 МЛН
The Joker wanted to stand at the front, but unexpectedly was beaten up by Officer Rabbit
00:12
Lattices: Algorithms, Complexity, and Cryptography
13:16
Simons Institute
Рет қаралды 7 М.
34C3 -  MQA - A clever stealth DRM-Trojan
1:00:32
media.ccc.de
Рет қаралды 17 М.
34C3 -  BBSs and early Internet access in the 1990ies
1:01:42
media.ccc.de
Рет қаралды 10 М.
Chris Peikert: Lattice-Based Cryptography
1:19:38
QuICS
Рет қаралды 25 М.
34C3 -  Microarchitectural Attacks on Trusted Execution Environments
55:02
Log4J & JNDI Exploit: Why So Bad? - Computerphile
26:31
Computerphile
Рет қаралды 499 М.
Tech Talk: What is Public Key Infrastructure (PKI)?
9:22
IBM Technology
Рет қаралды 121 М.
34C3 -  Decoding Contactless (Card) Payments
58:19
media.ccc.de
Рет қаралды 10 М.
Inside Out 2: ENVY & DISGUST STOLE JOY's DRINKS!!
00:32
AnythingAlexia
Рет қаралды 12 МЛН