An Algorithm Research of Terminal Key Generation for Mobile Payment

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 135-136)
• Pages: 187-191
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.135-136.187
• Online since: October 2011
• Authors: Peng Sheng Gu, Jia Ming He, Ling Hui Fan
• Keywords: Finding Big Prime Number, Key-Pair Generation, Mobile Payment, RSA Algorithm

References

[1] Behrouz A. Forouzan, Cryptography and Network Security, (2008).

[2] Guo-xiang Yao, Liang-chao Lin, Lin Lu, Efficient Method of RSA Key-Pair Generation, Computer Engineering , Vol. 33, No. 20, October. (2007).

[3] Jian-quan Xie, A Quick Generation Method of Prime Number in RSA Algorithm, Leading-edge Technologies.

[4] Hang tu, Li li, Optimizing RSA Key Generating Under Restrained Conditions, MINI-MICRO SYSTEMS, Vol. 25, No. 12, Dec. (2004).

[5] Bing Zhao, Scheme Design of Digital Signature Based on Hybrid Pattern Cryptographic System, Journal of Henan Institute of Education (Natural Science), Vol. 16, No. 1, Mar. (2007).

[6] Shoushang Luo, Cryptography and Information Security, Beijing University of Posts and Telecommunications, (2009).