Fast, Safe, Pure-Rust Elliptic Curve Cryptography
summary
curve25519-dalek implements Curve25519 arithmetic in pure Rust, using radix 2^51 limbs and a widening 64×64→128 mul strategy with explicit carry passes to get fast, constant-time field ops. Benchmarks show performance comparable to curve25519-donna (slightly better on verification) and calling Dalek from Go runs about three times faster than Go’s pure-Go implementation. The crate supports no_std, runs in an embedded PowerPC HSM and targets SGX, and includes higher-level primitives (range proofs, Borromean-ring style signatures, Rayon-parallel verification) that actually work and scale.
AI-written summary · about
chapters (13)
- 0:00Start
- 3:27History of Other Elliptic Curve Libraries
- 5:53Array Indexing
- 10:43Wrapping Arithmetic
- 11:04Widening Arithmetic
- 11:40Compiler Explorer
- 13:48Tuple Struct
- 21:52Side Channels
- 22:18Side Channel Attack
- 28:43Zero Knowledge Proof
- 30:34Range Proof
- 32:19Borromean Rings Signatures
- 32:30Borromean Rings Signature
related talks
34m"The Cryptography State of the Union"
17mPerformant, Readable and Interoperable Rust from Dafny
39mGraviola: fast, high-assurance cryptography for Rust
40mGraviola: fast, high-assurance cryptography for Rust
29mThe Go Cryptography State of the Union
13mNew Asymmetric Crypto Algorithm in DPDK - EdDSA
20mFixing the rusty core of the internet with functional prog.
58mFast Cryptographic Code via Partial Evaluation