• Publications
  • Influence
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
tl;dr
We demonstrate that LWE-based key exchange is quite practical: our constant time implementation requires around 1.3ms computation time for each party; compared to the recent NewHope R-LWE scheme, communication sizes increase by a factor of 4.7x, but remain under 12 KiB. Expand
  • 221
  • 41
  • Open Access
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
tl;dr
This paper introduces Kyber (part of CRYSTALS – Cryptographic Suite for Algebraic Lattices – a package submitted to NIST post-quantum standardization effort in November 2017), a portfolio of postquantum cryptographic primitives built around a key-encapsulation mechanism (KEM), based on hardness assumptions over module lattices. Expand
  • 193
  • 40
  • Open Access
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem
tl;dr
We demonstrate the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, we accompany these cipher suites with a rigorous proof of security. Expand
  • 265
  • 37
  • Open Access
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
tl;dr
We show how to remove this non-standard assumption via techniques introduced by Brakerski and construct a new fully homomorphic encryption scheme based on standard lattice assumptions. Expand
  • 322
  • 36
  • Open Access
Factorization of a 768-Bit RSA Modulus
tl;dr
This paper reports on the factorization of the 768-bit RSA-768 by the number field sieve factoring method and discusses some implications for RSA. Expand
  • 423
  • 18
  • Open Access
Differential Computation Analysis: Hiding Your White-Box Designs is Not Enough
tl;dr
We present a new approach to assess the security of white-box implementations which requires neither knowledge about the look-up tables used nor any reverse engineering effort. Expand
  • 73
  • 18
  • Open Access
Selecting elliptic curves for cryptography: an efficiency and security analysis
tl;dr
We present a collection of twisted Edwards curves with particularly efficient arithmetic that are up to 1.4 times faster than the recent implementation record on the corresponding NIST curve. Expand
  • 83
  • 12
  • Open Access
Elliptic Curve Cryptography in Practice
tl;dr
In this paper we perform a review of elliptic curve cryptography as it is used in practice today in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. Expand
  • 158
  • 10
  • Open Access
NewHope Algorithm Specifications and Supporting Documentation
  • 38
  • 10
  • Open Access