Enhanced RSA Algorithm for Data Security in the Internet of Things

Abstract Various devices are linked together through a variety of networks in order to exchange data in the Internet of Things (IoT). Life has changed dramatically as a result of the IoT's quickly developing applications, making it more fanciful and akin to living in a virtual environment. IoT security may be a major concern because it allows access to anything from anywhere at any time. Different mechanisms are used, including encryption, to safeguard the data transmitted by various IoT devices. A straightforward piece of content can be transformed into an intangible one via encryption. Two frequently used methods of encryption are symmetric key and asymmetric key cryptography. Asymmetric cryptography uses two separate keys for encoding and unscrambling messages as opposed to symmetric key cryptography, which uses just one key for both encoding and decoding. To protect IoT data, several public key cryptography techniques are utilized. However, numerous studies have demonstrated that it is incredibly challenging to safeguard data while utilizing the fewest resources from hackers and other cybercriminals. This study presents a concise overview of many existing encryption techniques and highlights their shortcomings. Conjointly presents an improved Rivest–Shamir–Adleman (RSA) algorithm to dodge the limits of diverse factorization assaults by upgrading complications of the factorization handle by utilizing five prime numbers and a fake open key instead of the original key and imposter modulus in its place of the product of five prime numbers. The proposed algorithm generates keys a little more slowly than the other two RSA algorithms (Rivest et al., 1978) and (Ivy et al., 2012) due to the usage of additional prime numbers and the difficulty of factorization preparation. For encryption and unscrambling, the suggested calculation takes less time than RSA (Ivy et al., 2012), but it costs more than RSA (Rivest et al., 1978). Since the suggested calculation employs five prime numbers instead of RSA's two prime numbers, it takes longer to encrypt data and decrypt it than RSA (Rivest et al., 1978). But since security comes first, the longer encryption and decryption time is acceptable.