8 citations · 15 across the 4 of their papers we have counts for
5 papers
OpenSSLNTRU: Faster post-quantum TLS key exchange
Daniel J. Bernstein, Billy Bob Brumley, Ming-Shing Chen +1
Google's CECPQ1 experiment in 2016 integrated a post-quantum key-exchange algorithm, newhope1024, into TLS 1.2. The Google-Cloudflare CECPQ2 experiment in 2019 integrated a more ef…
BasicBlocker: ISA Redesign to Make Spectre-Immune CPUs Faster
Jan Philipp Thoma, Jakob Feldtkeller, Markus Krausz +2
Recent research has revealed an ever-growing class of microarchitectural attacks that exploit speculative execution, a standard feature in modern processors. Proposed and deployed…
Faster computation of isogenies of large prime degree
Daniel Bernstein, Luca de Feo, Antonin Leroux +1
Let be an elliptic curve, and a point in of prime order . Vélu's formulae let us compute a quotient curve $\mathcal…
Is the security of quantum cryptography guaranteed by the laws of physics?
Daniel J. Bernstein
It is often claimed that the security of quantum key distribution (QKD) is guaranteed by the laws of physics. However, this claim is content-free if the underlying theoretical defi…
Investigating SRAM PUFs in large CPUs and GPUs
Pol Van Aubel, Daniel J. Bernstein, Ruben Niederhagen
Physically unclonable functions (PUFs) provide data that can be used for cryptographic purposes: on the one hand randomness for the initialization of random-number generators; on t…