An Algorithm Research of Terminal Key Generation for Mobile Payment

Abstract:

Article Preview

For the limited calculation of mobile device, the difficulty of finding big prime number and the complexity of RSA exponential modular computation, this paper proposes a modified algorithm to find prime numbers in the RSA algorithm. It modifies the method of random numbers generation to improve the efficiency of pre-screening algorithm. To reduce the terminal calculation and accelerate the speed of key-pair generation, it transfers the most time-consuming operation of big prime number modular exponentiation to the servers. Based on the key-pair generation algorithm, this paper finally proposes a terminal registration scheme of mobile payment.

Info:

Periodical:

Edited by:

Robin G. Qiu and Yongfeng Ju

Pages:

187-191

DOI:

10.4028/www.scientific.net/AMM.135-136.187

Citation:

P. S. Gu et al., "An Algorithm Research of Terminal Key Generation for Mobile Payment", Applied Mechanics and Materials, Vols. 135-136, pp. 187-191, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.