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

Mullai, A.; Mani, Kaustubh

doi:10.1007/s41870-019-00413-8

Cited by 16 publications

(7 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recognizing the importance of security for mobile devices, in [19] Mullai and Mani focused on enhancing crucial aspects and optimizing the cryptography operations of RSA and ECC. To suit these two algorithms, they proposed generating addition chains (ACs) based on particle swarm optimization (PSO) and simplified swarm optimization (SSO) before measuring performance using mobile emulators of Android and Windows.…”

Section: B Eccmentioning

confidence: 99%

Evaluation Study of Elliptic Curve Cryptography Scalar Multiplication on Raspberry Pi4

Alkhudhayr¹,

Moulahi²,

Alabdulatif³

2021

IJACSA

View full text Add to dashboard Cite

The internet of things (IoT) is defined as a collection of autonomous devices that connect and network with each other via the Internet without the requirement for human interaction. It enhances daily our lives such as through personal devices, healthcare sensing, retail sensing, and industrial control, as well as the smart homes, smart cities, and smart supply chains. Although the IoT offers significant benefits, it has inherent issues, including security and privacy risks, memory size limitations, and processing capability challenges. This paper describes the application of elliptic curve cryptography (ECC) in a simulated IoT environment to ensure the confidentiality of data passed between the connected devices. Scalar multiplication represents the main operation of ECC, and it is primarily used for key generation, encryption, and decryption. The aim of this paper is to evaluate and show the efficiency of adapt lightweight ECC with an IoT devices. In the study outlined in this paper, scalar multiplication was implemented on Raspberry Pi4 and processing time and consumed energy were measured to compare the performance. The comparison was made on the scalar multiplication of both fast and basic ECC algorithms. The result of the performance test revealed that a fast scalar multiplication reduced the computation time in comparison with basic scalar multiplication while consuming a similar level of energy.

show abstract

Section: B Eccmentioning

confidence: 99%

Evaluation Study of Elliptic Curve Cryptography Scalar Multiplication on Raspberry Pi4

Alkhudhayr¹,

Moulahi²,

Alabdulatif³

2021

IJACSA

View full text Add to dashboard Cite

show abstract

“…On the other hand, Léon-Javier et al [23] proposed algorithm based on particle swarm optimization (PSO). Mullai and Mani [26] used PSO and simplified swarm optimization to generate ACs for RSA for the purpose of using ACs to optimize computations in encryption/decryption processes to reduce processing time and power consumption in mobile devices. Cruz-Cortes et al [14] introduced an artificial immune system for finding short ACs for moderate-sized exponents (i.e., less than 20 bits) and large exponents (i.e., up to 2048 bits).…”

Section: Related Workmentioning

confidence: 99%

“…On the other hand, many non-exact algorithms [4,[13][14][15][16]18,23,24,[26][27][28][29][30][31][32][33]36] have been proposed to find a short AC. In these algorithms, the length of the generated AC is not necessarily minimal and the algorithms run in polynomial time.…”

Section: Introductionmentioning

confidence: 99%

“…Also, the window and continued fraction methods give a better output than other methods. [13][14][15][16]23,[26][27][28][29][31][32][33] for a short AC include the genetic algorithm (GA), evolutionary algorithm (EA), ant colony algorithm, swarm intelligence algorithms, and artificial immune algorithm. All these algorithms are based on many factors such as the size of the population, the maximum number of iterations, and the strategies of different operators such as crossover and/or mutation.…”

Section: Introductionmentioning

confidence: 99%

“…All these algorithms are based on many factors such as the size of the population, the maximum number of iterations, and the strategies of different operators such as crossover and/or mutation. In general, non-deterministic algorithms can produce a short AC with a length that is better than that generated by the deterministic algorithms, see [26,32].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations