---
abstract: |
    We develop a new approach for building cryptographic implementations. Our approach goes the last mile and delivers assembly code that is provably functionally correct, protected against side-channels, and as efficient as hand-written assembly. We illustrate our approach using -, one of the mandatory ciphersuites in TLS 1.3, and deliver formally verified vectorized implementations which outperform the fastest non-verified code.

    We realize our approach by combining the framework, which offers in a single language features of high-level and low-level programming, and the proof assistant, which offers a versatile verification infrastructure that supports proofs of functional correctness and equivalence checking. Neither of these tools had been used for functional correctness before. Taken together, these infrastructures empower programmers to develop efficient and verified implementations by game hopping, starting from reference implementations that are proved functionally correct against a specification, and gradually introducing program optimizations that are proved correct by equivalence checking.

    We also make several contributions of independent interest, including a new and extensible verified compiler for , with a richer memory model and support for vectorized instructions, and a new embedding of in .
author:
- 
bibliography:
- 'dblp.bib'
- 'abbrev3.bib'
- 'crypto.bib'
title: 'The Last Mile: High-Assurance and High-Speed Cryptographic Implementations'
---


