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

Elliptic Curve Cryptosystems

Neal Koblitz

A Method for Obtaining Digital Signatures and Public Key Cryptosystems

Ronald L. Rivest, Adi Shamir, & Len Adleman

New Directions in Cryptography

Whitfield Diffie & Martin E. Hellman

Cramming more components onto integrated circuits

Gordon Moore

Cramming more components onto integrated circuits

Gordon Moore — Published April 1965

This paper is the origin of what has become known as Moore’s Law, which states that the number of transistors on integrated circuits doubles approximately every two years. Moore’s Law is directly related to other aspects of progress in computing, including processing speed, product price, and memory capacity.

Cryptographic algorithms are all vulnerable to brute force–trying every possible encryption key, systematically searching for hash-function collisions, factoring the large composite number, and so forth–and brute force gets easier with time (due to Moore’s Law).” — Bruce Schneier

Moore’s Law is directly related to cryptography or, more specifically, to cryptanalysis.

Download PDF

See all Papers

A Mathematical Theory of Cryptography

Claude E. Shannon

La Cryptographie Militaire

Auguste Kerckhoffs