Evervault Papers

Crypto means cryptography

The most important cryptography papers spanning the past, present, and future of cryptosystems & cryptology.

Non-Malleable Cryptography

Danny Dolev, Cynthia Dwork, & Moni Naor

On the (Im)possibility of Obfuscating Programs

Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, & Ke Yang

Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups

David L. Chaum

A Digital Signature Based on a Conventional Encryption Function

Ralph C. Merkle

The Knowledge Complexity of Interactive Proof-Systems

Shafi Goldwasser, Silvio Micali, & Charles Rackoffero

Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security

Matt Blaze, Whiteld Diffie, Ronald L. Rivest, Bruce Schneier, Tsutomu Shimomura, Eric Thompson, & Michael Wiener

CryptDB: Protecting Confidentiality with Encrypted Query Processing

Raluca Ada Popa, Catherine M. S. Redfield, Nickolai Zeldovich, & Hari Balakrishnan

Protocols for Secure Computations

Andrew C. Yao

Bitcoin: A Peer-to-Peer Electronic Cash System

Satoshi Nakamoto

A fully homomorphic encryption scheme

Craig Gentry

On Data Banks and Privacy Homomorphisms

Ronald L. Rivest, Len Adleman, & Michael L. Dertouzos

A fast quantum mechanical algorithm for database search

Lov K. Grover

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter Shor

Use of Elliptic Curves in Cryptography

Victor Miller

Use of Elliptic Curves in Cryptography

Victor Miller — Published August 1985

This paper, along with Elliptic Curve Cryptosystems, independently proposed the use of elliptic curves in cryptography.

Unlike other public-key cryptosystems — like RSA, which relies on the fact that factoring large integers is slow and multiplication is fast (the Prime Factorization Problem) — elliptic curve cryptography (ECC) depends on the difficulty of the Elliptic Curve Discrete Logarithm Problem: given two points, P and Q, on an elliptic curve, find the integer n, if it exists, such that Q = nP.

ECC provides similar security guarantees compared to RSA, but with significantly reduced key sizes and more efficient computation. ECC — specifically, Elliptic Curve Diffie-Hellman (ECDH) — is now the preferred authentication mechanism for secure web browsing over SSL/TLS.

Download PDF

See all Papers