Performance analysis and improvement of JPV primality test for smart IC cards
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jo, Ho sung | - |
dc.contributor.author | Park, Hee jin | - |
dc.date.accessioned | 2022-07-16T06:15:25Z | - |
dc.date.available | 2022-07-16T06:15:25Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2014-02 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160788 | - |
dc.description.abstract | JPV algorithm, proposed by Joye et al. was predicted to be faster than the combined prime generation algorithm but it runs slower in practice. This discrepancy is because only the number of Fermat test calls was compared in estimating a total running time. We present a probabilistic analysis on the total running time of JPV algorithm. This analysis is very accurate and corresponds to the experiment with only 1-2% error. Furthermore, we propose an improved JPV algorithm that uses Euclid function. It is faster than JPV algorithm and similar to the combined algorithm with the same space requirement. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | Performance analysis and improvement of JPV primality test for smart IC cards | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jo, Ho sung | - |
dc.contributor.affiliatedAuthor | Park, Hee jin | - |
dc.identifier.doi | 10.1109/BIGCOMP.2014.6741451 | - |
dc.identifier.scopusid | 2-s2.0-84900629983 | - |
dc.identifier.bibliographicCitation | 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014, pp.271 - 275 | - |
dc.relation.isPartOf | 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014 | - |
dc.citation.title | 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014 | - |
dc.citation.startPage | 271 | - |
dc.citation.endPage | 275 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Public key cryptography | - |
dc.subject.keywordPlus | Combined algorithms | - |
dc.subject.keywordPlus | Performance analysis and improvements | - |
dc.subject.keywordPlus | Primality tests | - |
dc.subject.keywordPlus | Prime generation | - |
dc.subject.keywordPlus | Prime generation algorithms | - |
dc.subject.keywordPlus | Probabilistic analysis | - |
dc.subject.keywordPlus | Public key cryptosystems | - |
dc.subject.keywordPlus | Space requirements | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordAuthor | Primality test | - |
dc.subject.keywordAuthor | Prime generation | - |
dc.subject.keywordAuthor | Public-key cryptosystem | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6741451 | - |
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.