Edu25519

This is an implementation of Curve25519 from Daniel Bernstein. It uses the montgomery ladder and most tricks introduced in the original paper, mainly the radix ceil(25.5i) storing that makes reduction very fast.

This code was written as a clean, readable, self-contained implementation for educational purposes only.

It's supposed to show the concepts of the original publication in a comprehensible manner and has therefore not been optimized for speed or security, but for readability!

Build

To build the library and example program, do the usual cmake dance:

mkdir build && cd build
cmake .. && make
./example

Sources

The code comments frequently mention the main sources by their index:

1. D. J. Bernstein. Curve25519: new Diffie-Hellman speed records. Proceedings of PKC 2006
2. Hankerson, Darrel, Alfred J. Menezes, and Scott Vanstone. Guide to elliptic curve cryptography. Springer Science & Business Media, 2006.
3. RFC 7748 Elliptic Curves for Security