Correct-by-construction finite field arithmetic in Coq
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/119582 |
| _version_ | 1826193981006938112 |
|---|---|
| author | Philipoom, Jade (Jade D.) |
| author2 | Adam Chlipala. |
| author_facet | Adam Chlipala. Philipoom, Jade (Jade D.) |
| author_sort | Philipoom, Jade (Jade D.) |
| collection | MIT |
| description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018. |
| first_indexed | 2024-09-23T09:48:42Z |
| format | Thesis |
| id | mit-1721.1/119582 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:48:42Z |
| publishDate | 2018 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1195822019-04-10T11:02:05Z Correct-by-construction finite field arithmetic in Coq Philipoom, Jade (Jade D.) Adam Chlipala. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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). 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. by Jade Philipoom. M. Eng. 2018-12-11T20:41:00Z 2018-12-11T20:41:00Z 2018 2018 Thesis http://hdl.handle.net/1721.1/119582 1076360075 eng 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. http://dspace.mit.edu/handle/1721.1/7582 74 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Philipoom, Jade (Jade D.) Correct-by-construction finite field arithmetic in Coq |
| title | Correct-by-construction finite field arithmetic in Coq |
| title_full | Correct-by-construction finite field arithmetic in Coq |
| title_fullStr | Correct-by-construction finite field arithmetic in Coq |
| title_full_unstemmed | Correct-by-construction finite field arithmetic in Coq |
| title_short | Correct-by-construction finite field arithmetic in Coq |
| title_sort | correct by construction finite field arithmetic in coq |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/119582 |
| work_keys_str_mv | AT philipoomjadejaded correctbyconstructionfinitefieldarithmeticincoq |