A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve
We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechani...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2017-05 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Russinoff, David M |
| description | We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and is computationally surveyable in the sense that all steps that require mechanical support are presented in such a way that they may readily reproduced in any suitable programming language. |
| doi_str_mv | 10.48550/arxiv.1705.01226 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1705_01226</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2074353357</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-8bc76c7a46691cf8cf09acc224673b5cc30d6d072c496f5e9770c5bc16eae0c33</originalsourceid><addsrcrecordid>eNotj9FLwzAYxIMgOOb-AJ8M-Nz6NWmS9nGUOYXBBPde0m8pZnRLTNNh_3vXTTg4OO4OfoQ8ZZDmhRDwqsOvPaeZApFCxpi8IzPGeZYUOWMPZNH3BwBgUjEh-Ixsl7RyRz9EHa076a4b6dcQzmbUTWfoZ3CupRfFb0PXwQ1-irwJ0Zp-yvWJrrrO-miRVtPukdy3uuvN4t_nZPe22lXvyWa7_qiWm0QLppKiQSVR6VzKMsO2wBZKjchYLhVvBCKHvdyDYpiXshWmVApQNJhJow0g53PyfLu90tY-2KMOYz1R11fqS-Pl1vDB_Qymj_XBDeFC2NcMVM4F50LxP-qTWko</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2074353357</pqid></control><display><type>article</type><title>A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve</title><source>Freely Accessible Journals</source><source>arXiv.org</source><creator>Russinoff, David M</creator><creatorcontrib>Russinoff, David M</creatorcontrib><description>We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and is computationally surveyable in the sense that all steps that require mechanical support are presented in such a way that they may readily reproduced in any suitable programming language.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1705.01226</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computer Science - Cryptography and Security ; Curves ; Mathematics - Number Theory ; Programming languages</subject><ispartof>arXiv.org, 2017-05</ispartof><rights>2017. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1705.01226$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.4204/EPTCS.249.3$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Russinoff, David M</creatorcontrib><title>A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve</title><title>arXiv.org</title><description>We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and is computationally surveyable in the sense that all steps that require mechanical support are presented in such a way that they may readily reproduced in any suitable programming language.</description><subject>Algorithms</subject><subject>Computer Science - Cryptography and Security</subject><subject>Curves</subject><subject>Mathematics - Number Theory</subject><subject>Programming languages</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj9FLwzAYxIMgOOb-AJ8M-Nz6NWmS9nGUOYXBBPde0m8pZnRLTNNh_3vXTTg4OO4OfoQ8ZZDmhRDwqsOvPaeZApFCxpi8IzPGeZYUOWMPZNH3BwBgUjEh-Ixsl7RyRz9EHa076a4b6dcQzmbUTWfoZ3CupRfFb0PXwQ1-irwJ0Zp-yvWJrrrO-miRVtPukdy3uuvN4t_nZPe22lXvyWa7_qiWm0QLppKiQSVR6VzKMsO2wBZKjchYLhVvBCKHvdyDYpiXshWmVApQNJhJow0g53PyfLu90tY-2KMOYz1R11fqS-Pl1vDB_Qymj_XBDeFC2NcMVM4F50LxP-qTWko</recordid><startdate>20170503</startdate><enddate>20170503</enddate><creator>Russinoff, David M</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20170503</creationdate><title>A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve</title><author>Russinoff, David M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-8bc76c7a46691cf8cf09acc224673b5cc30d6d072c496f5e9770c5bc16eae0c33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Computer Science - Cryptography and Security</topic><topic>Curves</topic><topic>Mathematics - Number Theory</topic><topic>Programming languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Russinoff, David M</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Russinoff, David M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve</atitle><jtitle>arXiv.org</jtitle><date>2017-05-03</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and is computationally surveyable in the sense that all steps that require mechanical support are presented in such a way that they may readily reproduced in any suitable programming language.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1705.01226</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2017-05 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1705_01226 |
| source | Freely Accessible Journals; arXiv.org |
| subjects | Algorithms Computer Science - Cryptography and Security Curves Mathematics - Number Theory Programming languages |
| title | A Computationally Surveyable Proof of the Group Properties of an Elliptic Curve |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T10%3A57%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Computationally%20Surveyable%20Proof%20of%20the%20Group%20Properties%20of%20an%20Elliptic%20Curve&rft.jtitle=arXiv.org&rft.au=Russinoff,%20David%20M&rft.date=2017-05-03&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1705.01226&rft_dat=%3Cproquest_arxiv%3E2074353357%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2074353357&rft_id=info:pmid/&rfr_iscdi=true |