23 0

fast prime number generation algorithms on smart mobile devices

Title
fast prime number generation algorithms on smart mobile devices
Author
박희진
Keywords
Prime generation; Primality test; RSA; Public-key cryptosystems; GCD
Issue Date
2017-09
Publisher
SPRINGER
Citation
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, v. 20, no. 3, page. 2167-2175
Abstract
As smart mobile devices are widely used, mobile threats are more serious, so security in mobile becomes more and more important. However, the performance of these devices are not powerful enough to use the same security algorithms as PCs. Public key cryptosystems such as RSA need big primes to enhance the security, however, generating a big prime takes substantial time even on a PC. In this paper, we study two prime generation algorithms for smart mobile devices. First, we analyze a previous prime generation algorithm using a GCD test, named PGCD-MR, and show it sometimes performs inferior to the traditional TD-MR test. Second, we propose a new GCD test, named m-bit GCD-MR, for fast prime generation in both PCs and smart mobile devices. We compare the running times of PGCD-MR, m-bit GCD-MR, and TD-MR combinations on PCs and Samsung Galaxy Tab 10.1. The experimental results show our running time analysis is accurate (only 2% error) and m-bit GCD-MR test is the fastest among three prime generation algorithms. More exactly, m-bit GCD-MR test is about 20% faster than the TD-MR combination.
URI
https://link.springer.com/article/10.1007%2Fs10586-017-0992-3http://repository.hanyang.ac.kr/handle/20.500.11754/115657
ISSN
1386-7857; 1573-7543
DOI
10.1007/s10586-017-0992-3
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE