Every attempt to access to the Internet through a Web browser, email sent, VPN connection,
VoIP call, instant message or other use of telecommunications systems involves …

Richard Feynman's observation that certain quantum mechanical effects cannot be
simulated efficiently on a computer led to speculation that computation in general could be …

We significantly reduce the cost of factoring integers and computing discrete logarithms in
finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu …

Solving computationally hard problems using conventional computing architectures is often
slow and energetically inefficient. Quantum computing may help with these challenges, but it …

We investigate the security of Diffie-Hellman key exchange as used in popular Internet
protocols and find it to be less secure than widely believed. First, we present Logjam, a …

We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …

We give precise quantum resource estimates for Shor's algorithm to compute discrete
logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of …

Faster and more accurate state measurement is required for progress in superconducting
qubit experiments with greater numbers of qubits and advanced techniques such as …

A computer is generally considered to be a universal computational device; ie, it is believed
able to simulate any physical computational device with a cost in computation time of at most …

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …