The Community for Technology Leaders
2016 International Conference on Big Data and Smart Computing (BigComp) (2016)
Hong Kong, China
Jan. 18, 2016 to Jan. 20, 2016
ISSN: 2375-9356
ISBN: 978-1-4673-8795-8
pp: 374-377
Hosung Jo , Embedded Software Research Center, Hanyang University, Seoul, Korea
Heejin Park , Division of Computer Science and Engineering, Hanyang University, Seoul, Korea
ABSTRACT
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.
INDEX TERMS
Tunneling magnetoresistance, Mobile communication, Random number generation, Probabilistic logic, Time measurement, Algorithm design and analysis
CITATION

Hosung Jo and Heejin Park, "Fast prime generation algorithms using proposed GCD test on mobile smart devices," 2016 International Conference on Big Data and Smart Computing (BigComp)(BIGCOMP), Hong Kong, China, 2016, pp. 374-377.
doi:10.1109/BIGCOMP.2016.7425951
87 ms
(Ver 3.3 (11022016))