Enhancing the security in RSA and elliptic curve cryptography based on addition chain using simplified Swarm Optimization and Particle Swarm Optimization for mobile devices

被引:14
作者
Mullai A. [1 ]
Mani K. [2 ]
机构
[1] Department of Computer Science, Seethalakshmi Ramaswami College (Autonomous), Affiliated to Bharathidasan University, Trichy, Tamil Nadu
[2] Department of Computer Science, Nehru Memorial College (Autonomous), Affiliated to Bharathidasan University, Puthanampatti, Trichy, Tamil Nadu
关键词
Addition chain; ECC; PSO and SSO; RSA;
D O I
10.1007/s41870-019-00413-8
中图分类号
学科分类号
摘要
Security is the major concern in mobile or portable devices because the internet community can do their work at any time at any place at anywhere. Today various cryptographic algorithms like RSA, Elliptic Curve Cryptography (ECC), etc., can be used to protect the information in mobile devices. But, they have some limitations viz., energy, battery power, processing speed, operating systems, screen size, resolution, memory size, etc. Providing security for limited power mobile devices is a challenging task. RSA and ECC are normally used in mobile devices. In RSA, both encryption and decryption are of the form xe mod n and in ECC, the scalar point k[P] where k is a scalar and P is a point in EC plays a vital role in performing encryption and decryption. The point arithmetic involved in ECC is a power starving process. To speed up the operations in both cryptographic algorithms, addition chains (AC) are normally used. If the encryption and decryption time get reduced, it ultimately reduces the power consumption. There are several AC algorithms exist in the literature. But, ACs are generated using Particle Swarm Optimization and Simplified Swarm Optimization are proposed in this paper and they are used in the said processes of RSA and ECC with two android and window emulators. The processing time, power consumption taken for encryption, decryption process and security of the said algorithms are also analysed. © 2020, Bharati Vidyapeeth's Institute of Computer Applications and Management.
引用
收藏
页码:551 / 564
页数:13
相关论文
共 57 条
[1]  
Meneses F., Fuertes W., Sancho J., Salvador S., Flores D., Aules H., Castro F., Torres J., Miranda A., Nuela D., RSA encryption algorithm optimization to improve performance and security level of network messages, Int J Comput Sci Netw Secur, (2016)
[2]  
Bos J.W., Halderman J.A., Heninger N., Moore J., Naehrig M., Wustrow E., Elliptic curve cryptography in practice. International conference on financial cryptography and data security, (2014)
[3]  
Renes J., Costello C., Batina L., Complete addition formulas for prime order elliptic curves, Annual International Conference on the Theory and Applications of Cryptographic Techniques, (2016)
[4]  
Smart N.P., Elliptic curves. Cryptography made simple, (2015)
[5]  
Katz N.M., Mazur B., Arithmetic moduli of elliptic curves. Annals of Mathematic Studies, (2016)
[6]  
Paul1 T., Steve T., Addition chains: A reSolve lesson, Austr Sr Math J, (2017)
[7]  
Li L., Li S., Fast inversion in GF(2m) with polynomial basis using optimal addition chains, Circuits and Systems (ISCAS), (2017)
[8]  
Du K.L., Swamy M.N.S., Particle Swarm Optimization. Search and optimization by metaheuristics, (2016)
[9]  
Picek S., Coello C.A.C., Jakobovic D., Mentens N., Evolutionary algorithms for finding short addition chains: going the distance. Evolutionary computation in combinatorial optimization, (2016)
[10]  
Picek S., Coello C.A.C., Jakobovic D., Mentens N., Finding short and implementation-friendly addition chains with evolutionary algorithms, J Heuristics, (2017)