Loading…
RLCA-Robust Lightweight Cryptographic Paradigm for Secure Data Transfer Between IoT Devices
IoT has grown in popularity and acceptance as a result of its numerous uses across different industries. They gather information from the live environment and some send it over networks. These devices may range in size from one cubic millimetre to a credit card size. When deploying in real-time, the...
Saved in:
Published in: | SN computer science 2024-06, Vol.5 (6), p.684, Article 684 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | IoT has grown in popularity and acceptance as a result of its numerous uses across different industries. They gather information from the live environment and some send it over networks. These devices may range in size from one cubic millimetre to a credit card size. When deploying in real-time, there are numerous obstacles to overcome, including those related to processing power, wireless capability, interoperability, and security. When billions of smart devices make a connected network in a diverse set of platforms, especially when shifting from the server world to sensors, it gives birth to various unprecedented challenges for their owners or users. These challenges constitute safety, durability, & privacy, interoperability, and technologies. In this paper, the need for secure data communication for low processing power devices is presented and a new lightweight block cipher cryptographic technique called RLCA (Robust Lightweight Cryptographic Algorithm) uses a combination of linear and non-linear mathematical techniques. Choosing the PRESENT algorithm as a benchmark, a comparative analysis based on the time taken to encrypt and decrypt for different data sizes is carried out. The experimental results have shown an improvement of 97% in execution time as compared with the standard PRESENT algorithm. |
---|---|
ISSN: | 2661-8907 2662-995X 2661-8907 |
DOI: | 10.1007/s42979-024-03026-6 |