35C3 - The year in post-quantum crypto
Channel:media.ccc.de · Length:1:10:01 · Published:2018-12-29 · Views:8371
Summary
Daniel J. Bernstein and Tanja Lange survey recent highlights in post-quantum cryptography at 35C3, covering the NIST competition, network protocol experiments, and broken candidates.
Why HN recommends it
HN recommends it as a good overview of the NIST candidates and the state of post-quantum crypto.
This talk by djb and Tanja Lange is a good overview of the NIST candidates and the current state of pqcrypto — HN, 2019
Cryptography · Quantum computing
Subtitles (excerpt)
[Music] the next talk is called the yen post quantum crypto by Daniel anger please researching in Eindhoven and Daniel Bernstein researching at the University of Chicago they both have the first ever conference on post quantum cryptography in 2006 and they both contributed to the lips old crypt robbery their talk is going to be a summary of Dean and his post Khan crypto competition and they're gonna provide an overview of problems of post corner cryptography and hopefully just how to integrate post common crypto in existing software please welcome them with a huge round of applause all right well thank you first of all this title word post cognate ography what it means we're talking about cryptography were we're designing the systems under the assumption that our H hacker not the user just the attacker has a large quantum computer also to remind you from three years ago when he showed you the attacker we talked about attackers all right so we're seeing like over the last few years 2015 say middle August there was a big announcement by the NSA saying oh yeah actually the world should care about post-conflict ography we need more research they finally wake up to it and that should I had a nice rollout of fact that pretty much every agency just highlight
On Hacker News
AES-256 is believed to be quantum-resistant. The only known quantum attack on AES-256 is utilizing Grover's algorithm, which is an universal approach. As for assymetric crypto, the ones we have now are susceptible to quantum attacks. There are a bunch of proposals for quantum-proof algorithms but nothing officially standardized yet. There is a NIST competition going on right now that is trying to… — est31, 2019-05
They're using a mixture of Streamlined NTRU Prime 4591^761 and X25519. [LINK] Note that this is still considered "experimental" and probably won't be enabled by default. I'd advise checking out some of the recent DJB and Tanja Lange talks for further detail on how research on these algorithms is progressing: [VIDEO] There's also the older but still relevant PQCHacks: [LINK] Haven't seen any talk … — shittyadmin, 2019-03
This talk by djb and Tanja Lange is a good overview of the NIST candidates and the current state of pqcrypto: [VIDEO] — sigil, 2019-02
PQ-Crypto is still a very young research area. There is no widespread (or even niche) use of PQ-Crypto algorithms, no consensus on how safe any of the proposed algorithms are (and many proposals were found to be exceptionally broken -- on classical hardware -- within weeks of their submission[1]). I'm not really sure it's fair to say that just because there are some on-paper algorithms (which hav… — cyphar, 2019-09
The problem is that the largest QCs that we know of in the public are so ridiculously weak that I find it incredibly improbable that any government is anywhere close to having large enough QCs to break anything. The largest QCs are on the order of tens of qubits, but in order to run Shor's algorithm (to break RSA, or the discrete-log equivalent to break Diffie-Hellman) you need hundreds or thousa… — cyphar, 2019-05
Related videos
- Civil War General-Purpose Computing | Cory Doctorow | Talks at Google · Talks at Google · 1:10:23
- The Lively & Liveable Neighbourhoods that are Illegal in Most of North America · Not Just Bikes · 7:18
- Your Brain Thinks Your Whole Home Is One Room · CGP Grey · 10:58
- Jim Keller: Moore's Law, Microprocessors, and First Principles | Lex Fridman Podcast #70 · Lex Fridman · 1:34:43
- What Fossils Will We Leave Behind in 65 Million Years? · Curious Droid · 10:18
- Linux for Chromebooks: Secure Development (Google I/O ’19) · Chrome for Developers · 33:53
- Quantum Computing for Computer Scientists · Microsoft Research · 1:28:22
- Behind the Scenes of iOS Security · Black Hat · 51:31
- Why Electronic Voting Is Still A Bad Idea · Tom Scott · 12:00
- But how does bitcoin actually work? · 3Blue1Brown · 25:15
- Diffie-Hellman Key Exchange · Art of the Problem · 8:38
- BlackHat USA 2011: SSL And The Future Of Authenticity · Christiaan008 · 48:01
- Blockchains Are a Bad Idea (James Mickens) · HBS Digital Initiative · 14:34
- Line Goes Up – The Problem With NFTs · Folding Ideas · 2:18:23
- Theory and Practice of Cryptography · Google TechTalks · 1:32:07
- Why Electronic Voting is a BAD Idea - Computerphile · Computerphile · 8:21