Simple High-Level Code For Cryptographic Arithmetic With Proofs, Without Compromises
We introduce an unusual approach for implementing cryptographic arithmetic in short high-level code with machinechecked proofs of functional correctness. We further demonstrate that simple partial evaluation is sufficient to transform such initial code into highly competitive C code, breaking the de...
Main Authors: | Erbsen, Andres, Philipoom, Jade D., Gross, Jason S., Sloan, Robert Hal, Chlipala, Adam |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/131080 |
Similar Items
-
Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises
by: Erbsen, Andres, et al.
Published: (2021) -
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
by: Gross, Jason, et al.
Published: (2024) -
Foundational Integration Verification of a Cryptographic Server
by: Erbsen, Andres, et al.
Published: (2024) -
Reification by Parametricity: Fast Setup for Proof by Reflection, in Two Lines of Ltac
by: Gross, Jason, et al.
Published: (2021) -
Correct-by-construction finite field arithmetic in Coq
by: Philipoom, Jade (Jade D.)
Published: (2018)