Rivest-Shamir-Adleman Algorithm Research Articles

Implementation of Cryptography Using the RSA (Rivest-Shamir-Adleman) Algorithm in Encoding Text Messages and Documents

Cryptography can be used in prevent data, one of the preventive measures is by encoding messages. Cryptography is the study of encoding messages or ways of data protection. In encoding the content of messages, there is an algorithm conventionally used nowadays, the RSA (Rivest-Shamir-Adleman) algorithm. The RSA algorithm is a method that has two different keys for each encryption and decryption process but is still interrelated to maintain security in processing the data. In finding the key, the RSA algorithm utilizes the rule of prime number. The larger the prime number used as a key, the harder it is to find a large number as a factor. This research describes the process of encrypting text messages, the content of documents using the RSA algorithm, and the key generation process. Those processes are done by converting plaintext into ciphertext using ASCII code, which is 256 long, and using PKCS (Public Key Cryptography Standards) is the encryption process on the RSA algorithm. This study uses Pyhton programming language to implement the RSA algorithm on text messages and documents. As a recommendation to the subsequent studies, it is proper to use algorithms or other programming languages to secure messages.

Implementation of QR Code Attendance Security System Using RSA and Hash Algorithms

The quick response (QR) code-based attendance application contributes to reducing paper usage and attendance input errors. However, in its implementation process, the QR-code-based attendance at a Bandung school demonstrates weaknesses. Absent students can fake their attendance for themselves or friends. This type of attack is known as fake QR code generation. This research proposes a security authentication system using the Rivest–Shamir–Adleman (RSA) encryption algorithm and the secure hash algorithm 1 (SHA-1) to secure QR code-based attendance applications from fake QR code generation attacks. The RSA algorithm encrypts QR code data to maintain privacy, while the SHA-1 algorithm ensures data integrity. Based on this method, the mutual authentication process between the QR code data generated by the student and the attendance reading application by the teacher can be established. The results obtained from a series of tests showed that the security system in the student attendance recording application that had been implemented at Madrasah Aliyah (MA) Al-Mukhlishin could detect and prevent fake QR code generation attacks. The test was conducted by changing the impact of the key length on RSA-1024 bits and RSA-2048 bits. The results showed that in RSA-1024 bits, energy consumption of 0.14 J and time of 1.66 s is more efficient than that in RSA-2048 bits, with energy consumption of 0.19 J and time of 2.09 s. Interestingly, if a higher level of security is required, the key length should be increased at the expense of some energy and time efficiency.

An improved secured cloud data using dynamic rivest-shamir-adleman key

<span>Encryption methods had been widely used for secure data transmission and communication in both public and private organizations against intruders. Rivest-shamir-adleman (RSA) encryption algorithm is one of the most popular and efficient encryption schemes that has been in used for decades. Due to technological advancement and innovation, there is a threat to this algorithm. It is believed that introduction of quantum computer will break RSA algorithm easily. In view of this, it is pertinent to research into how RSA algorithm could be strengthened against all adversaries. This research aim at protecting client/server communication and file sharing by generating dynamic public and private keys. The proposed method was implemented in visual basic.net 2008. The result shows that dynamic keys do not affect the performance of the system and it is capable of protecting communication and file sharing between client/server. As the key generated keeps changing at an interval, it will difficult for most advance computer to factor any of the keys before another key is generated. This is the basis of the security of the proposed system.</span><br /><em></em>

A comparative Analysis of AES and RSA algorithms and their integrated application

Cryptography holds a significant place in the realm of information technology, safeguarding sensitive information from unauthorized access. This discourse centers on two prevalent cryptographic algorithms: AES (Advanced Encryption Standard) and RSA (Rivest-Shamir-Adleman). While AES falls under the category of symmetric cryptography, RSA is a part of asymmetric cryptography. The papers objective lies in furnishing readers with an insightful exploration of both algorithms, delving into their respective strengths and weaknesses. A comprehensive examination reveals the intricate details of their operation, highlighting the security aspects and potential vulnerabilities. Understanding the fundamental distinctions and the operational mechanics of AES and RSA contributes to an enhanced perception of their application in diverse cryptographic contexts. Beyond this, the paper delves into the synergistic utilization of AES and RSA, presenting an innovative approach to reinforcing information security. This integration leverages the unique advantages of both algorithms, mitigating their individual limitations and bolstering the security framework. In essence, a balanced perspective on AES and RSA, along with their collaborative application, furnishes a robust foundation for informed cryptographic choices, fortifying the safeguarding of sensitive data against emerging security threats.

Performance Evaluation Of Cloud Based Elliptic Curve Cryptographic Digital Signature E-Voting System For The Conduct Of Election In Nigeria

ABSTRACT Elections in Nigeria are characterized with poor voters’ turnout. One of the reasons attributed to this is the insecurity of the votes of the electorates. To resolve this, scholars have adopted various mechanisms and technologies, for example, the use of Rivest-Shamir-Adleman (RSA), Advanced Encryption StandardAES) and Elliptic Curves Cryptography (ECC). While these have added value to the body of knowledge in the conduct of elections in Nigeria, However, literature reveals that issue of insecurity of votes of electorate is still a current debate. The reason attributed to this, is due to the poor performance in terms of their key size, key strength and encryption time. This is addressed by using a Cloud based Elliptic Curve Cryptographic Digital signature (ECCDS) E-Voting system. The concept of the proposed system is to automatically encrypts, signs, decrypts votes and verifies the signed votes. The system is built on a hybridized security algorithms, these are; The ECC and Digital Signature Algorithm. This has a smart contractor that protect electorate votes against integrity modification in the cloud environment. The prototype demonstration is conducted during the students’ union election in Adekunle Ajasin University where the University ICT department is used as the cloud based network Infrastructure center. Three evaluation metrics are used. These are the key size, key strength and encryption time. The evaluation metrics shows a better performance of RSA, AES and ECC systems over the ECCD when considering the encryption time. The ECC and AES also perform better using the key size. For example, we recorded 167 bits for ECCDS, while RSA, AES and ECC algorithms recorded 163, 1024 and 64 bits respectively from one of the experiments under the key size. However, the beauty and the strength of good security system is the decryption time which is the key strength. From the experiment conducted using Key strength as the metric, we observed that ECCDS key strength is higher than that of AES, ECC and RSA. It means that it will take longer time for any intruder to decrypt the system when using the ECCDS model. This satisfy both the electorates and Electoral commission request and is very reliable and produces effective results. Keywords: E-voting, Integrity, Elliptic Curve, Cryptography, Digital Signature. CISDI Journal Reference Format Akingbesote. A.O., Babatobi, F.J. & Akinwumi, D. A. (2023): Performance Evaluation Of Cloud Based Elliptic Curve Cryptographic Digital Signature E-Voting System For The Conduct Of Election In Nigeria. Computing, Information Systems, Development Informatics &Allied Research Journal. Vol 13No 2, Pp 1-.14. Availableonlineathttps://www.isteams.net/cisdijournal. dx.doi.org/10.22624/AIMS/CISDI/V14N3P1

An Efficient and Secure Fog Based Routing Mechanism in IoT Network

The Internet of Things (IoT) networks are the most prone to internal as well as external attacks in addition to energy consumption problems. Conventional security solutions are not able to address these issues effectively due to the limited resources of sensor nodes participating in IoT communications. In this work, an Efficient and Secure Fog Based Routing Mechanism (ESFRM) is proposed to protect the network from faulty internal as well as external attacks. Every node participating in IoT communications calculates the comprehensive trust value of the next intermediate node which is the addition of direct trust, indirect trust and energy trust values before forwarding the data. This comprehensive trust value is then compared with the comprehensive threshold trust value to decide whether the particular node is a rogue node or a valid normal node. Further, an enhanced RSA (Rivest, Shamir, Adleman) algorithm is implemented to provide three levels of data security from Cluster Head (CH) to fog node, from fog node to cloud server and directly from CH to cloud server. For this purpose, an efficient CH selection technique is also proposed in this work. The proposed methodology is compared with the Secure Energy-efficient Fog-based Routing (SEFR) protocol and Trust-aware Secure Routing Protocol (TSRP). The evaluation results show that the proposed ESFRM outperforms the conventional schemes with respect to energy consumption, malicious node detection and transmission rate.

Moulded RSA and DES (MRDES) Algorithm for Data Security

In the recent days transmission of large amount of data through online is very prominent. Security is necessary while transmitting large amount of data. Since the data may belost or hacked at some point of transmission. Normally there are three important factors interms of security. They are key generation, encryption and decryption. There are two types of crypto system namely symmetric cryptosystem and asymmetric cryptosystem. There are many publicly available cryptosystems. It may lead the intruders to view the original message sent by the sender using all the possible keys. In order to provide secure transmission of data, a novel encryption algorithm is proposed by analyzing all the existing algorithms. The existing Rivest–Shamir–Adleman (RSA) and Data encryption standard (DES) algorithm are moulded together rto produce the proposed MRDES encryption algorithm. The performance of the proposed Moulded RSA and DES is higher than the existing encryption algorithms and provides higher data security.

Performance Comparison between RSA and El-Gamal Algorithms for Speech Data Encryption and Decryption

This article presents a performance comparison of two known public key cryptography techniques namely RSA (Rivest–Shamir–Adleman) and El-Gamal algorithms to encrypt/decrypt the speech signals during transferring over open networks. Specifically, this work is divided into two stages. The first stage is enciphering-deciphering the input speech file by employing the RSA method. The second stage is enciphering-deciphering the same input speech file by employing the El-Gamal method. Then, a comparative analysis is performed to test the performance of both cryptosystems using diverse experimental and statistical analyses for the ciphering and deciphering procedures like some known speech quality measures: histogram, spectrogram, correlation, differential, speed performance and noise effect analyses. The analyses outcomes reveal that the RSA and El-Gamal approaches are efficient and adequate for providing high degree of security, confidentiality and reliability. Additionally, the outcomes indicate that the RSA speech cryptosystem outperforms its counterpart the El-Gamal speech cryptosystem in most of ciphering/deciphering speech performance metrics.

Enriching Information Security via Hybrid of New Expand Rivest Shamir Adleman and Data Encryption Standard Cryptosystem

Cryptography system gives security services ability to protect information from people who are authorized to use it. This research introduces elevated information security system via hybrid of new expand Rivest Shamir Adleman (RSA) and data encryption standard (DES) cryptosystem using appropriate standard lgorithms. An Expand Algorithm (ERSA) algorithm Key cryptosystem based on nth large prime number system was introduced. Then a hybrid between the Expand Algorithm (ERSA) with Data Encryption Standard (DES) was applied using four randomly selected variables, each generated from large factor of “N” prime numbers. The information undergoes a cypher text-decryption process which provides strong security and uphold high information confidentiality and integrity of data. Results showed that the use of ERSA and DES algorithm reduced the key generation period and its complexity analysis of encryption and decryption are stronger, unlike the application of traditional RSA algorithm.

A Secure Method for Data Storage and Transmission in Sustainable Cloud Computing

Cloud computing is a technology that provides secure storage space for the customer’s massive data and gives them the facility to retrieve and transmit their data efficiently through a secure network in which encryption and decryption algorithms are being deployed. In cloud computation, data processing, storage, and transmission can be done through laptops and mobile devices. Data Storing in cloud facilities is expanding each day and data is the most significant asset of clients. The important concern with the transmission of information to the cloud is security because there is no perceivability of the client’s data. They have to be dependent on cloud service providers for assurance of the platform’s security. Data security and privacy issues reduce the progression of cloud computing and add complexity. Nowadays; most of the data that is stored on cloud servers is in the form of images and photographs, which is a very confidential form of data that requires secured transmission. In this research work, a public key cryptosystem is being implemented to store, retrieve and transmit information in cloud computation through a modified Rivest-Shamir-Adleman (RSA) algorithm for the encryption and decryption of data. The implementation of a modified RSA algorithm results guaranteed the security of data in the cloud environment. To enhance the user data security level, a neural network is used for user authentication and recognition. Moreover; the proposed technique develops the performance of detection as a loss function of the bounding box. The Faster Region-Based Convolutional Neural Network (Faster R-CNN) gets trained on images to identify authorized users with an accuracy of 99.9% on training.

Moulded RSA and DES (MRDES) Algorithm for Data Security

In the recent days transmission of large amount of data through online is very prominent. Security is necessary while transmitting large amount of data. Since the data may belost or hacked at some point of transmission. Normally there are three important factors interms of security. They are key generation, encryption and decryption. There are two types of crypto system namely symmetric cryptosystem and asymmetric cryptosystem. There are many publicly available cryptosystems. It may lead the intruders to view the original message sent by the sender using all the possible keys. In order to provide secure transmission of data, a novel encryption algorithm is proposed by analyzing all the existing algorithms. The existing Rivest–Shamir–Adleman (RSA) and Data encryption standard (DES) algorithm are moulded together rto produce the proposed MRDES encryption algorithm. The performance of the proposed Moulded RSA and DES is higher than the existing encryption algorithms and provides higher data security.

Computer cyberspace security mechanism supported by cloud computing.

To improve the cybersecurity of Cloud Computing (CC) system. This paper proposes a Network Anomaly Detection (NAD) model based on the Fuzzy-C-Means (FCM) clustering algorithm. Secondly, the Cybersecurity Assessment Model (CAM) based on Grey Relational Grade (GRG) is creatively constructed. Finally, combined with Rivest Shamir Adleman (RSA) algorithm, this work proposes a CC network-oriented data encryption technology, selects different data sets for different models, and tests each model through design experiments. The results show that the average Correct Detection Rate (CDR) of the NAD model for different types of abnormal data is 93.33%. The average False Positive Rate (FPR) and the average Unreported Rate (UR) are 6.65% and 16.27%, respectively. Thus, the NAD model can ensure a high detection accuracy in the case of sufficient data. Meanwhile, the cybersecurity situation prediction by the CAM is in good agreement with the actual situation. The error between the average value of cybersecurity situation prediction and the actual value is only 0.82%, and the prediction accuracy is high. The RSA algorithm can control the average encryption time for very large text, about 12s. The decryption time is slightly longer but within a reasonable range. For different-size text, the encryption time is maintained within 0.5s. This work aims to provide important technical support for anomaly detection, overall security situation analysis, and data transmission security protection of CC systems to improve their cybersecurity.

A secure IoT based healthcare framework using modified RSA algorithm using an artificial hummingbird based CNN

AbstractRecently, a wide variety of real‐world problems are solved via cloud computing, deep learning, machine learning, artificial intelligence, and the Internet of Things (IoT). These methodologies are concerned with different areas like smart cities, agriculture, transportation systems, and healthcare systems. The existing researchers focused on the health care monitoring application along with IoT and cloud computing. It met several shortcomings in case of computational complexity, cost, time, and improper health care data storage and so forth. To overcome these challenges, the novel IoT‐enabled secure healthcare monitoring model is proposed in this study. At first, several sensors are deployed in the human body thereby collecting patients' data with respect to vital parameters like body temperature deviation. The patient's health record dataset consists of 10 attributes namely phone numbers, marital status, address, age, name, heartbeat rate, oxygen level, smoking, temperature, and blood pressure. The data size reduction and normalization are performed in the IoT medical sensor dataset which contains the redundant or irrelevant attributes that are eliminated during pre‐processing. The artificial hummingbird (AHB) algorithm‐based convolutional neural network (AHB‐CNN) model performs both feature extraction and classification of cancer disease. The AHB‐CNN model classifies whether the patient is prone to cancer or not based on the sensor input collected. The received results are then sent to the hospital management for analysis. The Rivest‐Shamir‐Adleman (RSA) encryption method is mostly used in this study due to the major benefits it gives in terms of asymmetric encryption, ease of use, simpler deployment, and high security associated with factoring large prime numbers. A modified RSA algorithm is used in this article which uses the double encryption‐decryption process and “n” prime numbers to enhance the security of the conventional RSA algorithm. The data is always encrypted during transit before being stored in the cloud or for further processing. Depending upon the experimental consequences, the proposed method established superior performances compared to other state‐of‐art techniques.

An efficient dynamic access control and security sharing scheme using blockchain

This study seeks to understand the role of institutions and organizations that have used cloud service providers to store and share data as ensuring third-party access to storage is a major challenge to avoid data theft and unwanted access. Hence, in this paper, Blockchain-Based Data Access and Secure Sharing Method (BDASS) is introduced to enhance security processes related to personal data through data access control and secure sharing method, the proposed method uses blockchain aggregation, file system (IPFS), dynamic access control (DAC), and ciphertext-attribute-based encryption (CP-ABE) to enhance the security of personal data. To keep the owner safe, a blockchain-based DAC is designed. To keep data storage and sharing secure, the blockchain-based CP-ABE is designed. In this proposed methodology, the data owner encrypts the data they have stored in IPFS, thus enhancing data security, which has been improved with the help of CP-ABE regarding detailed access policy and data owner. Policy parameters are managed by the DAC. In the proposed methodology, the data owner uses the blockchain to control security and access to the data. Finally, the paper has come up with a set of findings in order to achieve data security and access control for the data owner through the blockchain-based approach. To evaluate the performance of the proposed method, MATLAB was used. The proposed technology also contrasts with existing technologies, such as the Blockchain-Based Security Sharing Scheme for Personal Data (BSSPD) as well as the Rivest-Shamir-Adleman Algorithm (RSA) and Elliptic Curve Cryptography (ECC).

Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map (3D-ILM), an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman (RSA) is presented in this paper. In the first stage, a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence, Lyapunov exponent, and Shannon entropy. In the second stage, combined with the public key RSA algorithm, a new key acquisition mathematical model (MKA) is constructed to obtain the initial keys for the 3D-ILM. Consequently, the key stream can be produced depending on the plain image for a higher security. Moreover, a novel process model (NPM) for the input of the 3D-ILM is built, which is built to improve the distribution uniformity of the chaotic sequence. In the third stage, to encrypt the plain image, a pre-process by exclusive OR (XOR) operation with a random matrix is applied. Then, the pre-processed image is performed by a permutation for rows, a downward modulo function for adjacent pixels, a permutation for columns, a forward direction XOR addition-modulo diffusion, and a backward direction XOR addition-modulo diffusion to achieve the final cipher image. Moreover, experiments show that the the proposed algorithm has a better performance. Especially, the number of pixels change rate (NPCR) is close to ideal case 99.6094%, with the unified average changing intensity (UACI) close to 33.4634%, and the information entropy (IE) close to 8.

Image encryption scheme based on blind signature and an improved Lorenz system

In this paper, a new improved Lorenz system (ImproLS) is designed with a better behavior due to a larger positive Lyapunov exponent. Then, an asymmetric image encryption scheme is presented based on blind signature and the ImproLS. First, the sender uses the public key from the receiver to produce the cipher keys in conjunction with the Rivest–Shamir–Adleman (RSA) algorithm. Then, a new mathematical model is established to convert both the plain keys and the cipher keys to generate the initial values for ImproLS. After doing preprocess to the secret plain image, its statistical characteristics is changed greatly. Then, by employing permutation and diffusion operations, the cipher image can be obtained and sent to the receiver and the signer. Second, the signer encrypts the digital signature image using Arnold transform in conjunction with the RSA algorithm, and applies the discrete wavelet transform (DWT) to the cipher image. The scrambled signature image is then embedded into the wavelet domain of cipher image blindly. Then, the cipher image containing signature is sent to the receiver for authentication. Third, the receiver uses the private key to check the signature and recover the cipher image. After comparing the decrypted images from both the sender and the signer, the receiver can judge the source of the secret plain image. Experimental results show that the information entropy is high and closer to the theoretical value. In addition, both unsigned and signed cipher images can effectively resist salt and pepper attack, and clipping attack.

Secure android IoT mobile and collaborative machine learning for controlling the management of enterprise

There is a need for increased security measures because of wide variety of android Internet of Thing (IoT) mobile devices that can communicate with each other via networks for controlling the management of enterprise. Elliptic Curve Deffie Hellman (ECDH) and Rivest Shamir Adleman (RSA) are used to secure data in android IoT phones in efficient manner. Android mobile can store a lot of data, including sensitive data. Protecting data saved on mobile has become a critical problem. In android IoT, Collaborative Machine Learning describes a method for collaboratively mining data, which makes it easier to manage and lowers cost of maintenance. To increase security in IoT phones, suggested system uses ECDH, RSA, and CML algorithms, which have been considered novelty of this method. RSA and ECDH are computed using time of decryption, encryption, and key generation. Conclusions show ECDH beats other alternatives like RSA. Finally, all users of the network have been tested.

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.