Performance analysis and improvement of JPV primality test for smart IC cards
- Authors
- Jo, Ho sung; Park, Hee jin
- Issue Date
- Feb-2014
- Publisher
- IEEE
- Keywords
- Primality test; Prime generation; Public-key cryptosystem
- Citation
- 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014, pp.271 - 275
- Indexed
- SCOPUS
- Journal Title
- 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014
- Start Page
- 271
- End Page
- 275
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160788
- DOI
- 10.1109/BIGCOMP.2014.6741451
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
- 서울 공과대학 > 서울 공학교육혁신센터 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160788)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.