Efficient Isogeny Computations on Twisted Edwards Curves
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Suhri | - |
dc.contributor.author | Yoon, Kisoon | - |
dc.contributor.author | Kwon, Jihoon | - |
dc.contributor.author | Hong, Seokhie | - |
dc.contributor.author | Park, Young-Ho | - |
dc.date.accessioned | 2021-12-19T06:41:10Z | - |
dc.date.available | 2021-12-19T06:41:10Z | - |
dc.date.created | 2021-08-30 | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 1939-0114 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/132144 | - |
dc.description.abstract | The isogeny-based cryptosystem is the most recent category in the field of postquantum cryptography. However, it is widely studied due to short key sizes and compatibility with the current elliptic curve primitives. The main building blocks when implementing the isogeny-based cryptosystem are isogeny computations and point operations. From isogeny construction perspective, since the cryptosystem moves along the isogeny graph, isogeny formula cannot be optimized for specific coefficients of elliptic curves. Therefore, Montgomery curves are used in the literature, due to the efficient point operation on an arbitrary elliptic curve. In this paper, we propose formulas for computing 3 and 4 isogenies on twisted Edwards curves. Additionally, we further optimize our isogeny formulas on Edwards curves and compare the computational cost of Montgomery curves. We also present the implementation results of our isogeny computations and demonstrate that isogenies on Edwards curves are as efficient as those on Montgomery curves. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY-HINDAWI | - |
dc.subject | ELLIPTIC-CURVES | - |
dc.subject | TIME | - |
dc.title | Efficient Isogeny Computations on Twisted Edwards Curves | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hong, Seokhie | - |
dc.identifier.doi | 10.1155/2018/5747642 | - |
dc.identifier.scopusid | 2-s2.0-85051005854 | - |
dc.identifier.wosid | 000440439200001 | - |
dc.identifier.bibliographicCitation | SECURITY AND COMMUNICATION NETWORKS | - |
dc.relation.isPartOf | SECURITY AND COMMUNICATION NETWORKS | - |
dc.citation.title | SECURITY AND COMMUNICATION NETWORKS | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | ELLIPTIC-CURVES | - |
dc.subject.keywordPlus | TIME | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.