Correct-by-construction finite field arithmetic in Coq
Name
1076360075-MIT.pdf
Description
Full printable version
Size
708.5 KB
Format
Adobe PDF
Checksum (MD5)
05daa7a43c3ee24a8991fb8bb7105c0e
Author(s)
Philipoom, Jade (Jade D.)
Advisor(s)
Adam Chlipala.
Date Issued
2018
Publisher
Massachusetts Institute of Technology
Abstract
Elliptic-curve cryptography code, although based on elegant and concise mathematical procedures, often becomes long and complex due to speed optimizations. This statement is especially true for the specialized finite-field libraries used for ECC code, resulting in frequent implementation bugs. I describe the methodologies used to create a Coq framework that generates implementations of finite-field arithmetic routines along with proofs of their correctness, given nothing but the modulus.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 73-74).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
