arXiv · 1705.01226
A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve
Abstract
We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and is computationally surveyable in the sense that all steps that require mechanical support are presented in such a way that they may readily reproduced in any suitable programming language.
Explore related subjects
Keep this discovery
David M. Russinoff. 2017-05-03. A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve. https://doi.org/10.4204/eptcs.249.3
Cite the original work for its findings. Save a collection to share your selection of sources.