Fast prime generation algorithms using proposed GCD test on mobile smart devices
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jo, Hosung | - |
dc.contributor.author | Park, Heejin | - |
dc.date.accessioned | 2022-07-15T18:20:28Z | - |
dc.date.available | 2022-07-15T18:20:28Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2016-03 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/155058 | - |
dc.description.abstract | As mobile smart devices are widely used, mobile security becomes more and more important. However, the performance of these devices are not powerful enough to use the same security algorithms as PC's. Public key cryptosystem such as RSA needs big primes to enhance the security, however, a generating big primes takes a substantial time even on a PC. In this paper, we proposed two prime generation algorithms for mobile smart devices using GCD primality test. We analyzed and compared the running times of our algorithm with the widely used TD-MR combination on Samsung Galaxy Tab 10.1. The experimental results showed only a 2% error and our algorithm is about 20% faster than the TD-MR combination. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Fast prime generation algorithms using proposed GCD test on mobile smart devices | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Park, Heejin | - |
dc.identifier.doi | 10.1109/BIGCOMP.2016.7425951 | - |
dc.identifier.scopusid | 2-s2.0-84964665953 | - |
dc.identifier.bibliographicCitation | 2016 International Conference on Big Data and Smart Computing, BigComp 2016, pp.374 - 377 | - |
dc.relation.isPartOf | 2016 International Conference on Big Data and Smart Computing, BigComp 2016 | - |
dc.citation.title | 2016 International Conference on Big Data and Smart Computing, BigComp 2016 | - |
dc.citation.startPage | 374 | - |
dc.citation.endPage | 377 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Cryptography | - |
dc.subject.keywordPlus | Public key cryptography | - |
dc.subject.keywordPlus | Mobile smart devices | - |
dc.subject.keywordPlus | Primality tests | - |
dc.subject.keywordPlus | Prime | - |
dc.subject.keywordPlus | Prime generation | - |
dc.subject.keywordPlus | Prime generation algorithms | - |
dc.subject.keywordPlus | Public key cryptosystems | - |
dc.subject.keywordPlus | Running time | - |
dc.subject.keywordPlus | Security algorithm | - |
dc.subject.keywordPlus | Big data | - |
dc.subject.keywordAuthor | GCD | - |
dc.subject.keywordAuthor | Primality test | - |
dc.subject.keywordAuthor | Prime | - |
dc.subject.keywordAuthor | Prime generation | - |
dc.subject.keywordAuthor | Public-key cryptosystems | - |
dc.subject.keywordAuthor | RSA | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7425951 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.