Rivest-Shamir-Adleman Algorithm Research Articles

Proposal Framework to Light Weight Cryptography Primitives

Due to manufacturing cost and portability limitations, the computing power, storage capacity, and energy of the Internet of Things (IoT) hardware are still slowly developing. From above, the proposed security system based on encryption must consider the resources, time, memory used, and the lifespan of related sensors. In addition, some applications need simple encryption, especially after the emergence of IoT and the Web of Things (WoT). Providing solutions suitable for resource-constrained devices can be achieved by using lightweight cryptography. In this paper, building a framework that includes proposals for producing lightweight security algorithms for cryptography primitives was highly recommended. For the block cipher, some suggestions have been applied to an example of block encryption, Advance Encryption Standard 128 (AES-128), to produce lightweight AES-128. For lightweight stream cipher, the system applied the proposals on Ronald Rivest Cryptography algorithms (RC4). Rivest–Shamir–Adleman (RSA) algorithm is used to produce a lightweight asymmetric cipher by key partition and using the Chinese Remainder Theorem (CRT) in the decryption process to produce a lightweight RSA algorithm. Several proposals have been used for hash functions, the most important of which is reducing the number of rounds and simplifying the functions in SHA-256. Depending on the proposed framework, all the produced lightweight algorithms passed the National Institute of Standards and Technology (NIST) statistical tests for test randomness. The produced algorithms showed better processing time than standard algorithms, less memory usage for a lightweight version of each standard algorithm, and higher throughput than standard algorithms.

Comparative Analysis of RSA and NTRU Algorithms and Implementation in the Cloud

The emergence of cloud computing platforms makes it easier to connect and collaborate globally without setting up additional infrastructures such as servers and data centers. This causes the emergence of threats to data security against digital information. This security threat can be overcome by cryptography. Examples of cryptographic algorithms are RSA and NTRU. The main concern that arises in this research is how to perform a comparative analysis between asymmetric cryptographic algorithms, RSA (Rivest-Shamir-Adleman) and NTRU (Nth-Degree Truncated Polynomial Ring) algorithms and their implementation in cloud storage. Comparison of performance between the RSA and NTRU algorithms at security levels 80, 112, 128, 160, 192, and 256 bits by running 5 – 1000 data, the results obtained that the running time of the key generation process and encryption of the NTRU algorithm is more efficient than the RSA algorithm. Wiener's Attack test on the RSA algorithm and LLL Lattice Basis Reduction on the NTRU algorithm. NTRU algorithm has a more secure level of resilience, so that it can be said that the NTRU algorithm is more recommended for cloud storage security.

Secure multimedia data transfer using crypto and stegano algorithms

Recent developments in Steganalysis have made it difficult to secure personal content, messages, or digital images using steganography. Using Steganalysis can easily reveal the presence of hidden information in storage files. This paper presents a new Steganographic approach to communication between two individuals. The approach presented in this paper uses both Steganographic and cryptographic methods. Cryptography uses Rivest–Shamir–Adleman (RSA) and Steganography use image Steganography to hide data. It also uses the mutual authentication process to satisfy all services in the field of cryptography, i.e., access control, confidentiality, integrity, and authentication. In this way, it can store data more securely. Since it uses the RSA algorithm to protect the data again, it performs Steganography to hide the data in the image. Thus, any other person on the network cannot access the data present on the network. Only the sender and receiver can extract the message from the data.

Small Prime Divisors Attack and Countermeasure against the RSA-OTP Algorithm

One-time password algorithms are widely used in digital services to improve security. However, many such solutions use a constant secret key to encrypt (process) one-time plaintexts. A paradigm shift from constant to one-time keys could introduce tangible benefits to the application security field. This paper analyzes a one-time password concept for the Rivest–Shamir–Adleman algorithm, in which each key element is hidden, and the value of the modulus is changed after each encryption attempt. The difference between successive moduli is exchanged between communication sides via an unsecure channel. Analysis shows that such an approach is not secure. Moreover, determining the one-time password element (Rivest–Shamir–Adleman modulus) can be straightforward. A countermeasure for the analyzed algorithm is proposed.

Internet of Medical Things-Based Secure and Energy-Efficient Framework for Health Care.

The Internet of Medical Things (IoMT) is a collection of medical equipment and software that can help patients get better care. The purpose of this study is to improve the security of data collected through remote health monitoring of patients utilizing Constrained Application Protocol (CoAP). Asymmetric cryptography techniques may be used to assure the security of such sensor networks. For communication between different IoMT devices and a remote server, the safe CoAP is compatible with the Datagram Transport Layer Security (DTLS) protocol for creating a secure session using existing algorithms such as Lightweight Establishment of Secure Session. The DTLS layer of CoAP, in contrast, has shortcomings in key control, session establishment, and multicast message exchange. As a consequence, for IoMT communication, the creation of an efficient protocol for safe CoAP session establishment is needed. Thus, to solve the existing problems related to key management and multicast security in CoAP, we have proposed an efficient and secure communication technique to establish a secure session key between IoMT devices and distant servers using lightweight Energy-Efficient and Secure CoAP Elliptic Curve Cryptography (E2SCEC2). The advantage of using E2SCEC2 over other identification methods such as Rivest-Shamir-Adleman (RSA) is its compact key size, which allows it to use a smaller key size. This article also compares these algorithms on parameters such as time spent generating keys, signature generation, and verification of E2SCEC2 and RSA algorithms, as well as energy consumption and radio duty cycle, to see if they are compatible in constrained environments.

High-Security Sequence Design for Differential Frequency Hopping Systems

Differential frequency hopping (DFH) technique is widely used in wireless communications by exploiting its capabilities of mitigating tracking interference and confidentiality. However, electronic attacks in wireless systems become more and more rigorous, which imposes a lot of challenges on the DFH sequences designed based on the linear congruence theory, fuzzy and chaotic theory, etc. In this article, we investigate the sequence design in DFH systems by exploiting the equivalence principle between the G-function algorithm and the encryption algorithm, in order to achieve high security. In more details, first, the novel G-function is proposed with the aid of the Government Standard algorithm and the Rivest–Shamir–Adleman algorithm. Then, two sequence design algorithms are proposed, namely, the G-function-assisted sequence generation algorithm, which takes the full advantages of the symmetric and asymmetric encryption algorithms, and the high-order G-function-aided sequence generation algorithm, which is capable of enhancing the correlation of the elements in a DFH sequence. Moreover, the security and ergodicity performance of the proposed algorithms are analyzed. Our studies and results show that the DFH sequences generated by the proposed algorithms significantly outperform the sequences generated by the reversible hash algorithm and affine transformation in terms of the uniformity, randomness, complexity, and the security.

Enhanced RSA key encryption application for metering data in smart grid

Purpose Digitizing of the electrical power grid promotes the advantages of efficient energy management alongside the possibilities of major vulnerabilities. A typical inadequacy that needs critical attention to ensure the seamless operation of the smart grid system remains in the data transmission between consumer premises smart devices and the utility centres. Many researches aim at establishing security protocols to ensure secure and efficient energy management resulting in perfect demand–supply balance. Design/methodology/approach In this paper, the authentication of the smart meter data has been proposed with enhanced Rivest–Shamir–Adleman (RSA) key encryption using an efficient way of generating large prime numbers. The trapdoor one-way function applied in the RSA algorithm makes it almost impossible for the reverse engineering attempts of cracking the key pair. Findings The algorithm for generating prime numbers has been tested both with the convention method and with the enhanced method of including a low-level primality test with a first few hundred primes. The combination of low-level and high-level primality tests shows an improvement in execution time of the algorithm. Originality/value There is a considerable improvement in the time complexities when using the combination method. This efficient generation of prime numbers can be successfully applied to the smart meter systems, thereby increasing the strength and speed of the key encryption.

A Modified RSA Algorithm Using Machine Learning and DNA Cryptography Techniques

RSA (Rivest Shamir Adleman) is an asymmetric algorithm used for encryption and decryption of data to ensure security through a communication channel. RSA algorithm is preferred over symmetric algorithms as it employs asymmetric keys for encryption and decryption. In this work, RSA optimization is attempted at three stages: key generation, data encryption, and data decryption. Key generation is implemented using the Gradient descent algorithm and Newton's method. Prime numbers required in key generation, data encryption, and data decryption are generated using GPU computations using OpenCL and CPU as the host providing a heterogeneous platform. The second and third stages namely data encryption and data decryption are implemented using the DNA cryptographic techniques and gray coding. The modified RSA designed as depicted above uses a low-key length of 8 bits and is validated for performance through avalanche effect, encryption simulation time, and decryption simulation time. The modified RSA algorithm is further verified by analyzing the chosen ciphertext attack time mathematically for various key lengths from 8 to 2048. The increase in attack time is around 93% for a key length of 8 bits and 78% for 15 bits for a key length of 2048 it increases by 100%.

An optimised homomorphic CRT-RSA algorithm for secure and efficient communication

Secure and reliable exchange of information between devices is crucial for any network in the current digital world. This information is maintained on storage devices, routing devices, and communication over the cloud. Cryptographic techniques are used to ensure the secure transmission of data, ensuring the user’s privacy by storing and transmitting data in a particular format. Using encryption, only the intended user possessing the key can access the information. During data or essential transmission, the channel should be secured by using robust encryption techniques. Homomorphic Encryption (HE) techniques have been used in the past for this purpose. However, one of the flaws of the conventional HE is seen either in its slow transmission or fast key decryption. Thus, this paper proposes an optimized Homomorphic Encryption Chinese Remainder Theorem with a Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm to overcome this challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys for efficient communication and security. In addition, the performance of the HE-CRT-RSA algorithm was evaluated in comparison with the classical RSA algorithm. The result of the proposed algorithm shows performance improvement with reduced decryption time. It is observed that the proposed HE-CRT-RSA is 3–4% faster than the classical Rivest-Shamir-Adleman (RSA). The result also suggests that HE-CRT-RSA effectively enhances security issues of the cloud and helps to decrease the involvement of intruders or any third party during communication or inside the data/server centers.

RSA encrypted FSK RF transmission powered by an innovative microwave technique for invulnerable security

Ensuring the secure communication is the prime concern for all kinds of data communication infrastructure. Several data encryption techniques are in use for secure communication. There is a scope for further improvement in the security level, as well as for the received signal quality. The selection of a proper combination of encryption and modulation techniques can improve the overall effectiveness of both the security level and the received signal quality. The combination of asymmetric cryptography (here use RSA (Rivest–Shamir–Adleman) algorithm) algorithm with the proposed reflex klystron-based frequency shift keying (FSK) modulation technique provides a high level of secure communication system. The performance of the proposed technique is experimentally verified. The conventional FSK modulation technique operates in the low-frequency band, but the proposed FSK modulation technique is powered by high-power microwave devices, which operate in the X band. The experimental result has been demonstrated and successfully verified for secured communication using the X band.

Disease Classification with E-Report Generation, Authentication and Encryption

The assortment of data analysis on the origin of diseases and consequences of mortality is essential to keep track of death rates caused due to diseases. Thus, the classification of diseases is very crucial. Cancer is one of the huge and major diseases of concern in the world. Machine learning is extensively implemented in the medical field in the anticipation of medical errors and early revelation of diseases. Along with the implementation of technology in medical field there is need for authentication to safeguard the privacy rights of patient’s health information. Thus, in this paper, revelation of disease using CNN (Convolutional Neural Networks) algorithm is achieved along with authentication and automatic generation of e-medical report which is further encrypted using RSA (Rivest, Shamir, Adleman) algorithm to overcome the breach of information while being shared from one hospital to another.

High speed data encryption technique with optimized memory based RSA algorithm for communications

PurposeThe privacy of the information is a major challenge in the communication process. In the present modern generation, the cryptography plays a vital role in providing security for data, such as text, images and video while transmitting from source to destination through internet or intranet. The Rivest-Shamir-Adleman (RSA) is an asymmetric key cryptographic system, where the security of the method works on the strength of the key.Design/methodology/approachIn an asymmetric key crypto system, a pair of keys is generated one public key for encryption and one private key for decryption. The major challenge of implementing the RSA is the power function which becomes tedious and time consuming as the exponential value increases. The Chinese remainder theorem proves to be the best for data encryption when it comes to execution time of the algorithm. The proposed novel RSA algorithm with lookup table (LUT) is an extension to the Chinese remainder algorithm, which works better for image and video in terms of time complexity.FindingsThis paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods.Originality/valueThis paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods.

A Novel Homomorphic Encryption based RSA Algorithm for Machine Learning

In today's internet world the use of Machine Learning as A Service (MLaaS) is increasing day by day especially automated Machine Learning. In which users upload their dataset and auto Machine Learning (ML) will develop models after studying dataset. Due to this, the risk of compromising of privacy of users is also high. So, to secure data on a cloud a new approach is present in this paper. In which, we have been using homomorphic encryption (HE) based Rivest Shamir Adleman (RSA) algorithm to encrypt the data and Azure automated ML is used to develop models. Three different datasets are first encrypted by using the Homomorphic Encryption (HE) based Rivest Shamir Adleman (RSA) algorithm and then uploaded to the Azure automated Machine Learning (ML) platform. The accuracy of machine learning models developed using encrypted data is compared with machine learning models developed using unencrypted datasets.

An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.

Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods

Abstract Extra-reductions occurring in Montgomery multiplications disclose side-channel information which can be exploited even in stringent contexts. In this article, we derive stochastic attacks to defeat Rivest-Shamir-Adleman (RSA) with Montgomery ladder regular exponentiation coupled with base blinding. Namely, we leverage on precharacterized multivariate probability mass functions of extra-reductions between pairs of (multiplication, square) in one iteration of the RSA algorithm and that of the next one(s) to build a maximum likelihood distinguisher. The efficiency of our attack (in terms of required traces) is more than double compared to the state-of-the-art. In addition to this result, we also apply our method to the case of regular exponentiation, base blinding, and modulus blinding. Quite surprisingly, modulus blinding does not make our attack impossible, and so even for large sizes of the modulus randomizing element. At the cost of larger sample sizes our attacks tolerate noisy measurements. Fortunately, effective countermeasures exist.

Quantum logistic image encryption algorithm based on SHA-3 and RSA

This study proposes a quantum logistic image encryption algorithm based on the Rivest–Shamir–Adleman (RSA) and secure hash (SHA-3) algorithms. First, the asymmetric encryption algorithm RSA is used to randomly generate key pairs with private key and public key. A fixed matrix is then produced to confuse the plain image by additive modular operation and get preprocessed image. Second, the preprocessed image is computed by the hash function SHA-3 to obtain the plain message that is then stored secretly. Using RSA algorithm, the cipher message can be obtained corresponding to the plain message. After combining both the plain and cipher messages, the initial conditions of the quantum logistic map are calculated using a new mathematical model. Random keystream can then be generated from the quantum logistic map. Third, the keystream is further employed to cyclically confuse row and column pixels in the preprocessed image with different directions. Then, diffusion operations to odd row and odd column are carried out followed by even row and column, respectively. Finally, the cipher image can be reconstructed by both inverse cyclic confusion and inverse diffusion to each row and column. The test results show that the algorithm has strong plaintext sensitivity and key sensitivity as well as an enhanced ability to resist various cryptographic attacks. Therefore, the proposed algorithm is suitable for secure communication of network image in conjunction with a public cryptosystem.

Enhancement in data security and integrity using minhash technique

Data <span>encryption process and key generation techniques protect sensitive data against any various attacks. This paper focuses on generating secured cipher keys to raise the level of security and the speed of the data integrity checking by using the MinHash function. The methodology is based on applying the cryptographic algorithms rivest-shamir-adleman (RSA) and advanced encryption standard (AES) to generate the cipher keys. These keys are used in the encryption/decryption process by utilizing the Pearson Hash and the MinHash techniques. The data is divided into shingles that are used in the Hash function to generate integers and in the MinHash function to generate the public and the private keys. MinHash technique is used to check the data integrity by comparing the sender’s and the receiver’s encrypted digest. The experimental results show that the RSA and AES algorithms based on the MinHash function have less encryption time compared to the normal hash functions by 17.35% and 43.93%, respectively. The data integrity between two large sets is improved by 100% against the original algorithm in terms of completion time, and 77% for small/medium data and 100% for large set data in terms of memory utilization.</span>

BFIM: Performance Measurement of a Blockchain Based Hierarchical Tree Layered Fog-IoT Microservice Architecture

Fog computing complements cloud computing by removing several limitations, such as delays and network bandwidth. It emerged to support Internet of Things (IoT) applications wherein its computations and tasks are carried out at the network's edge. Heterogeneous IoT devices interact with different users throughout a network. However, data security is a crucial concern for IoT, fog and cloud network ecosystems. Since the number of anonymous users increases and new identity disclosures occur within the IoTs, it is becoming challenging to grow mesh networks to deliver end to end communications, as the extended IoT networks resemble a mesh architecture. To reinforce data security over IoTs, we deploy a microservice-based blockchain mechanism for fogs, which works as a decentralized client-server network medium (i.e., secured end device-based communication). We implement a blockchain equipped security scheme to be used with a fog-IoT hierarchical tree-based overlay mesh architecture to address and develop the network performance issues. In this study, we consider encryption and decryption delays from IoT and fog-integrated parts to monitor data records and compare them through the developed security scheme. The blocks of a blockchain offer the desired execution results mainly in terms of the algorithmic efficiency, which correlates with the existing algorithms, namely the Advanced Encryption Standard (AES), the Rivest Shamir Adleman (RSA), and the Data Encryption Standard (DES). Our `BFIM' scheme has an enhanced task scheduling capacity and a more efficient throughput than the AES, DES, RSA resource deliverables (i.e., tasks). Our comprehensive performance evaluation implies that the Blockchain-based Fog IoT Microservice (i.e., BFIM) architecture provides a task delivery efficiency of 78.79% (i.e., task deliverable) and a service delivery efficiency of 83.24% (i.e., task scheduling). The `BFIM' also has an overall process delivery efficiency of 75% (i.e., time delay, throughput) in the fog layer, rather than a central cloud layer running the AES, DES, and RSA algorithms.

A new DNA coding and hyperchaotic system based asymmetric image encryption algorithm.

In this paper, an asymmetric image encryption algorithm based on DNA coding and hyperchaotic system is designed. Unlike other image encryption schemes, for example, sharing of same private keys between sender and receiver, and fixed rules with simple operation, three stages are studied as follows to deal with these problems. Firstly, to eliminate the possible risk of key transmission and management, the initial values of the hyperchaotic system are generated for ahead by the RSA (Rivest-Shamir-Adleman) algorithm and the plain image, in which the sum of odd rows, even rows, odd columns, and even columns are computed respectively to extra the plain message from the plain image as input of RSA algorithm. Then, a mathematical map is established to transform all of them into initial values of the hyperchaotic system. Secondly, the pixel level permutation is performed to confuse the image according to the chaotic sequences generated. Finally, to solve the problem of fixed rules with simple operations in current DNA based image encryption algorithms, dynamical DNA encryption is designed to diffuse the permuted image. The process of DNA encryption includes DNA coding, DNA operation and DNA decoding. In particular, DNA rules are selected according to chaotic sequences dynamically, rather than fixed rules with simple operation. Theoretical analysis and numerical simulations show that the proposed algorithm is secure and reliable for image encryption.

WITHDRAWN: IOT-HARPSECA: A SECURE DESIGN AND DEVELOPMENT SYSTEM OF ROADMAP FOR DEVICES AND TECHNOLOGIES IN IOT SPACE

Abstract As the Internet of Services (IoT) is emerging in all ways it is essential to make the road map for securing in all ways. The framework was designed in the novel IoT Hardware Platform Security Advisor (IoT-HarPsecA) where the framework was evaluated. Based on this framework it is designed in all the ways and implemented in hardware as well as software. But this proposed work is an extension to that by implementing more security by including the concept of a digital signature. By implementing the digital signature concept it is aware of the intermediate intruders. If they modified the data or messages which are sent then the signature will be invalidated suggesting that the message is subjected to modification. Thus the security is maintained. There are many available schemes. One among them is the RSA (Rivest–Shamir–Adleman) algorithm. By implementing the concepts like key generation, key distribution the security was adopted.