Lightweight Computational Complexity Stepping Up the NTRU Post-Quantum Algorithm Using Parallel Computing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Elkabbany, Ghada Farouk | - |
dc.contributor.author | Ahmed, Hassan I. Sayed | - |
dc.contributor.author | Aslan, Heba K. | - |
dc.contributor.author | Cho, Young-Im | - |
dc.contributor.author | Abdallah, Mohamed S. | - |
dc.date.accessioned | 2024-02-14T01:30:18Z | - |
dc.date.available | 2024-02-14T01:30:18Z | - |
dc.date.issued | 2024-01 | - |
dc.identifier.issn | 2073-8994 | - |
dc.identifier.issn | 2073-8994 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/90404 | - |
dc.description.abstract | The Nth-degree Truncated polynomial Ring Unit (NTRU) is one of the famous post-quantum cryptographic algorithms. Researchers consider NTRU to be the most important parameterized family of lattice-based public key cryptosystems that has been established to the IEEE P1363 standards. Lattice-based protocols necessitate operations on large vectors, which makes parallel computing one of the appropriate solutions to speed it up. NTRUEncrypt operations contain a large amount of data that requires many repetitive arithmetic operations. These operations make it a strong candidate to take advantage of the high degree of parallelism. The main costly operation that is repeated in all NTRU algorithm steps is polynomial multiplication. In this work, a Parallel Post-Quantum NTRUEncrypt algorithm called PPQNTRUEncrypt is proposed. This algorithm exploits the capabilities of parallel computing to accelerate the NTRUEncrypt algorithm. Both analytical and Apache Spark simulation models are used. The proposed algorithm enhanced the NTRUEncrypt algorithm by approximately 49.5%, 74.5%, 87.6%, 92.5%, 93.4%, and 94.5%, assuming that the number of processing elements is 2, 4, 8, 12, 16, and 20 respectively. | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | MDPI | - |
dc.title | Lightweight Computational Complexity Stepping Up the NTRU Post-Quantum Algorithm Using Parallel Computing | - |
dc.type | Article | - |
dc.identifier.wosid | 001151083900001 | - |
dc.identifier.doi | 10.3390/sym16010012 | - |
dc.identifier.bibliographicCitation | SYMMETRY-BASEL, v.16, no.1 | - |
dc.description.isOpenAccess | Y | - |
dc.identifier.scopusid | 2-s2.0-85183096413 | - |
dc.citation.title | SYMMETRY-BASEL | - |
dc.citation.volume | 16 | - |
dc.citation.number | 1 | - |
dc.type.docType | Article | - |
dc.publisher.location | 스위스 | - |
dc.subject.keywordAuthor | post-quantum cryptography | - |
dc.subject.keywordAuthor | NTRU | - |
dc.subject.keywordAuthor | parallel computing | - |
dc.subject.keywordAuthor | Apache Spark | - |
dc.subject.keywordPlus | STATE | - |
dc.relation.journalResearchArea | Science & Technology - Other Topics | - |
dc.relation.journalWebOfScienceCategory | Multidisciplinary Sciences | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon 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.