back

PQCHacks

A gentle introduction to post-quantum cryptography

If you suspend your transcription on amara.org, please add a timestamp below to indicate how far you progressed! This will help others to resume your work!

Please do not press “publish” on amara.org to save your progress, use “save draft” instead. Only press “publish” when you're done with quality control.

Video duration
01:00:57
Language
English
Abstract
<p>Last year your friend Karen joined the alternative music scene and sent you a sound track. The government is recording everything, and this year announced that alternative music is a gateway drug to terrorism (see <a href="http://www.theguardian.com/australia-news/2015/sep/25/radicalisation-kit-links-activism-and-alternative-music-scene-to-extremism">http://www.theguardian.com/australia-news/2015/sep/25/radicalisation-kit-links-activism-and-alternative-music-scene-to-extremism</a>). Fortunately, Karen encrypted the email.</p>

<p>Fast forward to 2035. Stasi 2.0 has risen to power and has decided that, to protect society, anyone who has ever been exposed to alternative music will be sent to a „better place“. They still have a copy of Karen’s ciphertext. And here’s the really bad news: They’ve just finished building a billion-qubit quantum computer.</p>

<p>Back in 2015, large general-purpose quantum computers haven’t been built yet, but the consensus is that they will be built, and that they will allow well-funded attackers to retroactively break practically all of today's deployed public-key cryptography.
RSA will be dead.
ECC will be dead.
DSA will be dead.
„Perfect forward secrecy“, despite its name, won’t help.
</p>

<p>Fortunately, there are replacement public-key cryptosystems
that have held up very well against analysis of possible attacks,
including future quantum attacks.
This talk will take a hands-on look at the two examples
with the longest track records: namely, hash-based signatures (Merkle trees) and code-based encryption (McEliece).
</p>

<p>The talk will be given as a joint presentation by Daniel J. Bernstein and Tanja Lange.</p>

Talk ID
7210
Event:
32c3
Day
1
Room
Hall 1
Start
11 p.m.
Duration
01:00:00
Track
Security
Type of
lecture
Speaker
djb
Tanja Lange
Talk Slug & media link
32c3-7210-pqchacks

Talk & Speaker speed statistics

Very rough underestimation:
168.9 wpm
937.2 spm
While speaker(s) speak(s):
173.4 wpm
956.0 spm
180.3 wpm
1010.9 spm
165.5 wpm
892.4 spm
100.0% Checking done100.0%
0.0% Syncing done0.0%
0.0% Transcribing done0.0%
0.0% Nothing done yet0.0%
  

Work on this video on Amara!

Talk & Speaker speed statistics with word clouds

Whole talk:
168.9 wpm
937.2 spm
keyquantummessagecryptosignbitspublichashbit1signaturepeoplesecretumsystem0securitycomputersecuresignaturesthingscodeyearsproblemalgorithmspost-quantumkeyserrorgoodlangetalktimenumberalgorithmthingsignedsigningmessagesbrokencomputerssystemsexampleemptysizeideaalrighthere&#x27;sbigstuffproblems
While speakers speak:
173.4 wpm
956.0 spm
keymessagesignquantumcryptobitspublichashbitsignaturesecret10peoplesecuritysystemcodesignaturesthingssecurecomputeryearsproblempost-quantumumerrorgoodmessagessignedbrokensystemssigningideaexamplecomputersalrightthingkeysemptyecchere&#x27;ssizestuffcheck8matrixbigstringtimesmall
djb:
180.3 wpm
1010.9 spm
keysignmessagehashsignaturepublicquantumsecretsystemcryptosignaturesthingsmessagessecuritysignedsigning1peoplesystemsemptyproblem0bitsgoodstringkeyssecurebitthingbrokenpost-quantumlamportone-timealrightbigcomputermachinehash-basedhere&#x27;sideabytescode118computersproblemsmerkleinstancestuff32-byte
Tanja Lange:
165.5 wpm
892.4 spm
bitsbitcryptoquantumyearscodeerror10keycomputerpeoplesecuritymatrixsecureumerrorsconnectionspublicequationsalgorithmeccextracallparity100goppasizebetterpost-quantumcodesramordernumberfigurecheckcodingtalktimehappeningprettyrsasmallexample64randomflipcorrectwrongefficient