Fast prime generation algorithms using proposed GCD test on mobile smart devices
- Authors
- Jo, Hosung; Park, Heejin
- Issue Date
- Mar-2016
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- GCD; Primality test; Prime; Prime generation; Public-key cryptosystems; RSA
- Citation
- 2016 International Conference on Big Data and Smart Computing, BigComp 2016, pp.374 - 377
- Indexed
- SCOPUS
- Journal Title
- 2016 International Conference on Big Data and Smart Computing, BigComp 2016
- Start Page
- 374
- End Page
- 377
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/155058
- DOI
- 10.1109/BIGCOMP.2016.7425951
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/155058)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.