HackerTube 中文?

35C3 - The year in post-quantum crypto

media.ccc.deYouTube ↗

Further reading 1

What can a language express, and what can it guarantee? →Factorial can be written without naming the function. That trick raises a harder question: if every program must terminate, can unrestricted recursion be allowed? Take that distinction into slides, libraries and language extensions.This video helps answer · What changes when “this program” becomes “every program”?

Caption notes

In this 2018 cryptography talk Bernstein describes verifying machine code for a fast sort. That choice removes one assumption about the compiler while leaving a precisely bounded claim about the implementation and its specification.

Community transcript ↗
Original passages · 2
for every possible input
35C3 - The year in post-quantum crypto · ▶ 60:07–60:11
verification isn't going to rely on some compiler being correct.
35C3 - The year in post-quantum crypto · ▶ 60:38–60:43

Hacker News comments

View original on HN ↗