Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Probabilistic analysis on JPV algorithm and improving it using GCD function
- Authors
- Jo, Ho sung; Park, H.
- Issue Date
- Apr-2015
- Publisher
- Natural Sciences Publishing Co.
- Keywords
- GCD function; Primality test; Prime generation; Public-key cryptosystem
- Citation
- Applied Mathematics and Information Sciences, v.9, no.2, pp.535 - 542
- Indexed
- SCOPUS
- Journal Title
- Applied Mathematics and Information Sciences
- Volume
- 9
- Number
- 2
- Start Page
- 535
- End Page
- 542
- ISSN
- 1935-0090
- 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 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. 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
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Jo, Ho sung
- COLLEGE OF ENGINEERING (INNOVATION CENTER FOR ENGINEERING EDUCATION)