Computer-aided cryptography is an active area of research that develops and applies
formal, machine-checkable approaches to the design, analysis, and implementation of …

The Montgomery ladder is a remarkably simple method of computing scalar multiples of
points on a broad class of elliptic curves. This article surveys a wide range of topics related …

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit
special structures of the rings used in those cryptosystems. The same structures are also …

We present EverCrypt: a comprehensive collection of verified, high-performance
cryptographic functionalities available via a carefully designed API. The API provably …

Introduced by Hoffstein–Pipher–Silverman in 1998. Security related to lattice problems; pre-
version cryptanalyzed with LLL by Coppersmith and Shamir. System parameters (p, q), p …

Safe curves for elliptic-curve cryptography Page 1 Safe curves for elliptic-curve cryptography
Daniel J. Bernstein1,2 and Tanja Lange3,2 1 University of Illinois at Chicago, USA 2 Academia …

Lattice-based cryptography is a highly potential candidate that protects against the threat of
quantum attack. At Usenix Security 2016, Alkim, Ducas, Pöpplemann, and Schwabe …

Pseudorandom functions (PRFs) are one of the fundamental building blocks in
cryptography. Traditionally, there have been two main approaches for PRF design: the …

Elliptic curve cryptosystems are considered an efficient alternative to conventional systems
such as DSA and RSA. Recently, Montgomery and Edwards elliptic curves have been used …

It is generally accepted that a large-scale quantum computer would be capable to break any
public-key cryptosystem used today, thereby posing a serious threat to the security of the …