Show simple item record

dc.contributor.authorErbsen, Andres
dc.contributor.authorPhilipoom, Jade D.
dc.contributor.authorGross, Jason S.
dc.contributor.authorSloan, Robert Hal
dc.contributor.authorChlipala, Adam
dc.date.accessioned2021-02-25T13:07:14Z
dc.date.available2021-02-25T13:07:14Z
dc.date.issued2019-04
dc.identifier.issn1063-7109
dc.identifier.urihttps://hdl.handle.net/1721.1/130000
dc.description.abstractWe introduce a new approach for implementing cryptographic arithmetic in short high-level code with machine-checked proofs of functional correctness. We further demonstrate that simple partial evaluation is sufficient to transform into the fastest-known C code, breaking the decades-old pattern that the only fast implementations are those whose instruction-level steps were written out by hand. These techniques were used to build an elliptic-curve library that achieves competitive performance for 80 prime fields and multiple CPU architectures, showing that implementation and proof effort scales with the number and complexity of conceptually different algorithms, not their use cases. As one outcome, we present the first verified high-performance implementation of P-256, the most widely used elliptic curve. implementations from our library were included in BoringSSL to replace existing specialized code, for inclusion in several large deployments for Chrome, Android, and CloudFlare.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grants CCF-1253229,CCF-1512611, and CCF-1521584)en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/SP.2019.00005en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleSimple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromisesen_US
dc.typeArticleen_US
dc.identifier.citationErbsen, Andres et al. “Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises.” Proceedings - IEEE Symposium on Security and Privacy, May-2019 (May 2019) © 2019 The Author(s)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.relation.journalProceedings - IEEE Symposium on Security and Privacyen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2020-12-04T19:12:09Z
dspace.orderedauthorsErbsen, A; Philipoom, J; Gross, J; Sloan, R; Chlipala, Aen_US
dspace.date.submission2020-12-04T19:12:17Z
mit.journal.volume2019-Mayen_US
mit.licenseOPEN_ACCESS_POLICY


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record