# Evervault Papers

### Crypto means cryptography

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

###### On the (Im)possibility of Obfuscating Programs

###### Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups

###### A Digital Signature Based on a Conventional Encryption Function

###### The Knowledge Complexity of Interactive Proof-Systems

###### Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security

###### CryptDB: Protecting Confidentiality with Encrypted Query Processing

###### Protocols for Secure Computations

###### Bitcoin: A Peer-to-Peer Electronic Cash System

###### A fully homomorphic encryption scheme

###### On Data Banks and Privacy Homomorphisms

###### A fast quantum mechanical algorithm for database search

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

###### Use of Elliptic Curves in Cryptography

###### Elliptic Curve Cryptosystems

#### Elliptic Curve Cryptosystems

Neal Koblitz — Published October 1985

This paper, along with Use of Elliptic Curves in Cryptography, 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