Fast prime generation algorithms using proposed GCD test on mobile smart devices

Jo, Hosung; Park, Heejin

doi:10.1109/BIGCOMP.2016.7425951

상세 보기

Fast prime generation algorithms using proposed GCD test on mobile smart devices

Jo, Hosung;
Park, Heejin

Citations

SCOPUS

3

초록

As mobile smart devices are widely used, mobile security becomes more and more important. However, the performance of these devices are not powerful enough to use the same security algorithms as PC's. Public key cryptosystem such as RSA needs big primes to enhance the security, however, a generating big primes takes a substantial time even on a PC. In this paper, we proposed two prime generation algorithms for mobile smart devices using GCD primality test. We analyzed and compared the running times of our algorithm with the widely used TD-MR combination on Samsung Galaxy Tab 10.1. The experimental results showed only a 2% error and our algorithm is about 20% faster than the TD-MR combination.

키워드

GCD; Primality test; Prime; Prime generation; Public-key cryptosystems; RSA; Algorithms; Cryptography; Public key cryptography; Mobile smart devices; Primality tests; Prime; Prime generation; Prime generation algorithms; Public key cryptosystems; Running time; Security algorithm; Big data

제목: Fast prime generation algorithms using proposed GCD test on mobile smart devices

저자: Jo, Hosung; Park, Heejin

DOI: 10.1109/BIGCOMP.2016.7425951

발행일: 2016-03

유형: Conference Paper

저널명: IEEE International Conference on Big Data and Smart Computing

페이지: 374 ~ 377