상세 보기
Performance analysis and improvement of JPV primality test for smart IC cards
Citations
SCOPUS
1초록
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.
키워드
Primality test; Prime generation; Public-key cryptosystem; Public key cryptography; Combined algorithms; Performance analysis and improvements; Primality tests; Prime generation; Prime generation algorithms; Probabilistic analysis; Public key cryptosystems; Space requirements; Algorithms
- 제목
- Performance analysis and improvement of JPV primality test for smart IC cards
- 저자
- Jo, Ho sung; Park, Hee jin
- 발행일
- 2014-02
- 유형
- Conference Paper
- 저널명
- 2014 International Conference on Big Data and Smart Computing, BIGCOMP 2014
- 페이지
- 271 ~ 275
- 언어
- ENG
- 출판사
- IEEE
- 발행국가
- 미국
- 분량
- 5 페이지