Paper 2021/428 Original: eprint.iacr.org/2021/428 ↗

A Coq proof of the correctness of X25519 in TweetNaCl

Peter Schwabe
Benoît Viguier
Timmy Weerwag
Freek Wiedijk
Abstract

We formally prove that the C implementation of the X25519 key-exchange protocol in the TweetNaCl library is correct. We prove both that it correctly implements the protocol from Bernstein's 2006 paper, as standardized in RFC 7748, as well as the absence of undefined behavior like arithmetic overflows and array out-of-bounds errors. We also formally prove, based on the work of Bartzia and Strub, that X25519 is mathematically correct, i.e., that it correctly computes scalar multiplication on the elliptic curve Curve25519. The proofs are all computer-verified using the Coq theorem prover. To establish the link between C and Coq we use the Verified Software Toolchain (VST).

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2021-04-06: last updated
2021-04-06: published
Short URL
https://ia.cr/2021/428
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/428,
      author = {Peter Schwabe and Benoît Viguier and Timmy Weerwag and Freek Wiedijk},
      title = {A Coq proof of the correctness of X25519 in TweetNaCl},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/428},
      year = {2021},
      url = {https://eprint.iacr.org/2021/428}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.