A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Performance analysis and improvement of JPV primality test for smart IC cards
2014
2014 International Conference on Big Data and Smart Computing (BIGCOMP)
Preserved Fulltext
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 its 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 GCD function.
doi:10.1109/bigcomp.2014.6741451
dblp:conf/bigcomp/JoP14
fatcat:vux4mb5cmvbyhbno4hxnq3lxkm