History

Mamy André-Ratsimbazafy 7ae0f51000 benchmarking skips cycle counting for ARM		2020-04-15 21:24:18 +02:00
..
README.md	Add formally verified and prover generated BLS12_381 implementation	2020-03-19 00:22:00 +01:00
bls12_381_q_64.c	Add formally verified and prover generated BLS12_381 implementation	2020-03-19 00:22:00 +01:00
bls12_381_q_64.nim	benchmarking skips cycle counting for ARM	2020-04-15 21:24:18 +02:00

Formal verification

This folder will hold code related to formal verification.

References

Fiat Crypto: Synthesizing Correct-by-Construction Code for Cryptographic Primitives https://github.com/mit-plv/fiat-crypto
Andres Erbsen, Jade Philipoom, Jason Gross, Robert Sloan, Adam Chlipala. Simple High-Level Code For Cryptographic Arithmetic -- With Proofs, Without Compromises. To Appear in Proceedings of the IEEE Symposium on Security & Privacy 2019 (S&P'19). May 2019.. This paper describes multiple field arithmetic implementations, and an older version of the compilation pipeline (preserved here). It is somewhat space-constrained, so some details are best read about in theses below.
Jade Philipoom. Correct-by-Construction Finite Field Arithmetic in Coq. MIT Master's Thesis. February 2018. Chapters 3 and 4 contain a detailed walkthrough of the field arithmetic implementations (again, targeting the previous compilation pipeline).
Andres Erbsen. Crafting Certified Elliptic CurveCryptography Implementations in Coq. MIT Master's Thesis. June 2017. Section 3 contains a whirlwind introduction to synthesizing field arithmetic code using coq, without assuming Coq skills, but covering a tiny fraction of the overall library. Sections 5 and 6 contain the only write-up on the ellitpic-curve library in this repository.
The newest compilation pipeline does not have a separate document yet, but this README does go over it in some detail.