Skip to content
0:00 / 0:00

#post-quantumcryptography#nist#danielj.bernstein

35C3 - The year in post-quantum crypto

media.ccc.de

274K subscribers • 57 videos on Hallway • Conference channel

YouTube
  • Recommended by 3 people: 3 on Hacker News.
  • Presented by Daniel J. Bernstein and Tanja Lange

Advanced. Deep dive for people who know the field.

8.3K views7 years ago3 recommendations

SecurityComputer scienceCryptographyComputation and complexity

Daniel J. Bernstein and Tanja Lange review the state of post-quantum cryptography in late 2018, focusing on the NIST standardization process.

media.ccc.de/v/35c3-9926-the_year_in_post-quantum_crypto The world is finally catching on to the urgency of deploying post-quantum cryptography: cryptography designed to survive attacks by quantum computers. NIST's post-quantum competition is in full swing, and network protocols are exploring post-quantum extensions. This talk will take the audience on a journey through selected recent highlights from the post-quantum world. Post-quantum cryptography has become one of the most active areas in cryptography, trying to address important questions from potential users. Is post-quantum cryptography secure? In the first ten months of this year we have seen several serious breaks of submissions to the NIST competition. At this point, out of the original 69 submissions, 13 are broken and 8 are partially broken. Are the remaining 48 submissions all secure? Or is this competition a denial-of-service attack against the cryptanalysis community? NIST will select fewer candidates for the 2nd round, but it is not clear whether there is an adequate basis for judging security. Does post-quantum cryptography provide the functionality we expect from cryptography? For example, the original Diffie-Hellman system provides not just encryption but also more advanced features such as non-interactive key exchange (not provided by any NIST submissions) and blinding. The era of post-NIST post-quantum cryptography has begun with the exciting new CSIDH proposal, which has non-interactive key exchange and is smaller than any NIST submission, but uses more CPU time and needs much more study. Is post-quantum cryptography small enough? Even for network protocols that rely purely on encryption, integration remains a major problem because of the bandwidth requirements of most post-quantum systems, especially the post-quantum systems with the strongest security track records. Experiments with integration of post-quantum cryptography into TLS have focused on encryption without post-quantum authentication. A new generation of network protocols has been designed from the ground up for full post-quantum security. Is post-quantum cryptographic software fast enough, and is it safe to use? Adding post-quantum cryptography to the cryptographic software ecosystem has produced a giant step backwards in software quality. Major areas of current activity include software speedups, benchmarking, bug fixes, formal verification, patent avoidance, and development of post-quantum software libraries such as Open Quantum Safe and libpqcrypto. The talk will be given as a joint presentation by Daniel J. Bernstein and Tanja Lange. djb Tanja Lange fahrplan.events.ccc.de/congress/2018/Fahrplan/events/9926.ht…

Why it's here

3 people recommend this

What people say. Recommended as an authoritative and detailed overview of the NIST post-quantum cryptography competition and algorithm security.

sigilon Hacker News • Recommends

On “NIST Reveals 26 Algorithms Advancing to the Post-Quantum Crypto ‘Semifinals’”

This talk by djb and Tanja Lange is a good overview of the NIST candidates and the current state of pqcrypto: link to this video

shittyadminon Hacker News • Recommends

On “Cryptography of SSH (2006)”

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: link to this video There's also the older but still relevant PQCHacks: link Haven't seen any talk of post quantum signatures in changelogs yet at least, but research is happening rapidly in this field and OpenSSH has really upped their game in recent years.

est31on Hacker News • Recommends

On “How to factor 2048 bit RSA integers in 8 hours using 20M noisy qubits”

…talk on the topic here 2. If quantum computers are possible, we should switch to quantum proof algorithms now rather than later, because then we'd reduce the traffic that can be decrypted at a later point in time. It's quite dangerous right now considering that basically everything is protected by quantum-non-resistant ciphers. 1: link 2: link to this video…

cypharon Hacker News • Mentions

On “Signal, a fast, secure and simple messenger endorsed by Snowden”

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 thousands of stable qubits -- and the current generation of qubits are unstable. You can make stable qubits out of unstable ones by using error correction, but that requires you to have ~1000 unstable qubits to make one stable qubit. So there's at least 5-6 orders of magnitude separating the current state-…

cypharon Hacker News • Mentions

On “Signal, a fast, secure and simple messenger endorsed by Snowden”

> Google and others have experimented with it for https and it worked fine To be clear, Google didn't experiment with actually using post-quantum crypto. Their experiment was to figure out what was the largest key sizes that browsers and networks would accept before you start degrading connections. Their "post-quantum keys" were just padding bytes. This was gone through in the Bernstein and Lange talk this year at 35C31. This is a good thing, given the history of the security of post-quantum candidates2. 1: link to this video 2: link to this video

cypharon Hacker News • Mentions

On “IBM will soon launch a 53-qubit quantum computer”

…imagine that I said "all modern PK crypto that is actually in use today is broken". Because, at the end of the day, that's all that really matters. [As an aside, for RSA the security is provided by the hardness of factorisation which also breaks under QC attackers, not discrete log (it's discrete log for DH, and EC discrete log for ECDH).] 1: link to this video…