DJ
Daniel J. Bernstein
Manus quae lapidem fundamenti ponit
— the hand that lays the foundation stone
— On the schedule —
Getting a subroutine right: a case study
Does cryptographic software development have to be a neverending cycle of CVEs and patches? What can you do to escape the cycle? My talk 'Fast, constant-time, correct: pick three' at last year's OpenSSL Conference explained the unprecedented assurance level of the formally verified assembly subroutines in s2n-bignum, but can you really take the risk of writing your own code in assembly and hoping to be able to formally verify it? In this talk I'll look at a completely different example of a subroutine that has escaped the cycle, using tools that have already been applied to a much wider range of software.
— Compositor's note —
Prof. Daniel J. Bernstein designs cryptography to proactively reduce risks. His designs with large-scale deployment include X25519, Ed25519, ChaCha20, SipHash (co-designed with Jean-Philippe Aumasson), Streamlined NTRU Prime (with various co-designers), and Classic McEliece (with various co-designers). Bernstein coined the phrase “post-quantum cryptography” in 2003.