Rivest-Shamir-Adleman Research Articles

Number theory based modern cryptography: RSA and Diffie-Hellman algorithms

Abstract. In the twenty-first century, the Internet has grown rapidly. Cryptography, with the protection of number theory as an important guarantee for the Internet, is critical to study, and algorithms must be updated to keep up with the evolution of the digital world. With the rapid spread of the Internet, security flaws in certain algorithms have been exposed, generating widespread alarm. This literature review focuses on the introductions of the Rivest-Shamir-Adleman (RSA) and Diffie-Hellman algorithms, integrating and summarizing previous research. The content of this literature review includes an introduction to algorithms and number theory, specific applications of these algorithms, and security issues associated with them. Finally, this literature review concludes that RSA and Diffie-Hellman are inefficient and insecure in some sectors of application, necessitating the use of alternative algorithms or the replacement of some unique encryption methods to achieve the desired level of safety.

Elliptic curve cryptography: Theory, security, and applications in modern network security

Abstract. Due to the swift advancement of Internet and computer technology in the 21st century, the demand for network security is increasing. Classic cryptographic algorithms like Rivest-Shamir-Adleman (RSA) and Digital Signature Algorithm (DSA) are insufficient in the face of modern network environments, while elliptic curve cryptography (ECC) has become a research hotspot due to its high security and high efficiency. The purpose of this paper is to discuss the theoretical basis, security analysis, and practical application cases of elliptic curve cryptography, to provide readers with a comprehensive understanding and trigger further research and thinking. This paper analyzes the theoretical basis of ECC, including group theory, domain theory, and the definition and properties of elliptic curves, and analyzes the application of ECC in combination with practical application cases, such as the SM2 algorithm. The article first introduces the concept of groups, the definition of domains, and the basic properties of elliptic curves. Then, the security of ECC is analyzed, especially the complexity of the Elliptic Curve Discrete Logarithm Problem (ECDLP) and the selection of key length. In addition, the security of ECC in practical applications is discussed, including digital signatures, key exchange protocols, and applications in blockchain technology. The results show that ECC provides comparable security to traditional public key algorithms at a short key length, and shows strong security and efficiency in practical applications. As technology progresses and new threats arise, research in ECC will also evolve.

A secure and privacy preserving model for healthcare applications based on blockchain-layered architecture

Blockchain is one of the emerging technologies that are applied in various fields and its application in Healthcare 4.0 is crucial to handle the vast amount of health records that are growing continuously everyday. This paper explores the application of blockchain technology-based layered architecture integrated with Interplanetary File System (IPFS) storage to provide a secure and robust sharing platform for healthcare system. A multilayer security is provided in the proposed system including a 128-bit Random Deoxyribonucleic Acid (DNA) encoding sequence with a modified version of the 128-bit Advanced Encryption Standard (AES) key expansion symmetric key technique is being used before storing the records in the IPFS storage, Rivest–Shamir–Adleman (RSA) 2048 digital envelope is used for secure transmission of symmetric keys, RSA 1024 is used for digital signature, and Secure Hash Algorithm 256-bit (SHA-256) is used for hashing the record files. Comparative analysis with existing state-of-the-art in blockchain-based E-healthcare system is discussed. The performance of various assessment metrics is evaluated, including encryption and decryption time for EHR records, mining time, record retrieval time, smart contract execution time and network latency. Additionally, a reputation-based filtering mechanism specifically designed in the proposed model to detect and mitigate the various attacks.

THE APPLICATION OF RSA CRYPTOGRAPHY TO PREVENT COUNTERFEITING IN THE BOOK PUBLISHING INDUSTRY

This study aims to develop a book publishing information system that can assist lecturers in publishing their academic works more efficiently and securely. The system implements the Rivest-Shamir-Adleman (RSA) cryptographic algorithm to protect book data from unauthorized access, as well as to prevent counterfeiting and copyright infringement. With the encryption applied, only authorized parties can access sensitive information. The implementation of this system has proven to increase efficiency in the book publishing process, reduce administrative obstacles, and enhance authors' confidence in the security of the system. It is expected that this system will boost academic productivity and maintain the integrity of lecturers' intellectual works.

Elliptic curves cryptography for lightweight devices in IoT system

The Internet of Things (IoT) is revolutionizing industries by connecting billions of devices, ranging from home appliances to industrial machines, to the internet. This transformation enables unprecedented automation, data collection, and process optimization. However, the widespread adoption of IoT also introduces significant security challenges, especially for lightweight devices with limited computational power and energy resources. Ensuring secure communication and data integrity in such constrained environments is critical. This paper explores and compares the performance of implemented algorithms within IoT devices. A comparison between Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) implementations is made to identify a lightweight, secure, and efficient solution for IoT environments. Our results indicate that ECC outperforms RSA in terms of memory requirements, overall energy consumption, key sizes, signature generation time, key generation and execution time, and decryption time in a resource-constrained environment. However, RSA performs better in signature verification and encryption.

A Hybrid System Based on Three Levels to Hide Information using JPEG Color Images

Nowadays, due to the circulation of information among people, information security has become an important requirement to protect information from hacking. Many techniques have been discovered to protect this information and maintain its confidentiality from hacking, the most prominent of which are cryptography and steganography techniques. In this paper, a hybrid system based on three levels to hide information using Joint Photographic Experts Group (JPEG) color images, where this system works in both processes sender and receiver. The sender process at the first level uses a mixing of the Advanced Encryption Standard (AES) and Rivest Shamir Adleman (RSA), while at the second level uses a Fuzzy Stream Algorithm (FSA) adds a higher complexity and eliminates the non-linearity of the encrypted information. The third level is to hide encrypted information using the Least Significant Bit (LSB) technique, while the receiver process, performs the reverse process of three levels. This system provides high information embedding capability and the inability to perceive hidden information, the system was evaluated based on criteria like Peak Signal Noise Ratio (PSNR), Mean Square Error (MSE), Structure Similarity (SSIM), and correlation, which were characterized by high and good rates. The study was compared with modern steganography techniques.

Enhancing E‐Healthcare Data Privacy Through Efficient Dual Signature on Twisted Edwards Curves Encryption Decryption

ABSTRACTThis article introduces a scheme designed to ensure the integrity and privacy of e‐healthcare data. The proposed scheme combines a dual signature approach with EdDSA (Edwards‐curve Digital Signature Algorithm). It is important to note that while dual signatures may appear similar to double signatures, they differ significantly. Dual signatures involve coupling two distinct values of diverse natures to securely anonymise them to various entities. Recent research has demonstrated that elliptic curve cryptography (ECC) is better suited for resource‐constrained or lightweight devices than RSA (Rivest–Shamir–Adleman). EdDSA, an enhancement of ECDSA, offers efficient and affordable signature generation. However, EdDSA signature verification is a computationally intensive task that may not be feasible for e‐healthcare devices. Nevertheless, edge computing devices lack operational constraints and can easily handle this verification process. These characteristics make our proposal an elegant, robust, and efficient strategy for securing e‐healthcare systems and addressing the challenges of integrity and privacy. Results show that the proposed algorithm performs better in terms of key generation, signing time, verification time, encryption/decryption time and overall time as compared to the state‐of‐the‐art.

Post-Quantum Delegated Proof of Luck for Blockchain Consensus Algorithm

The advancements in quantum computing and the potential for polynomial-time solutions to traditional public key cryptography (i.e., Rivest–Shamir–Adleman (RSA) and elliptic-curve cryptography (ECC)) using Shor’s algorithm pose a serious threat to the security of pre-quantum blockchain technologies. This paper proposes an efficient quantum-safe blockchain that incorporates new quantum-safe consensus algorithms. We integrate post-quantum signature schemes into the blockchain’s transaction signing and verification processes to enhance resistance against quantum attacks. Specifically, we employ the Falcon signature scheme, which was selected during the NIST post-quantum cryptography (PQC) standardization process. Although the integration of the post-quantum signature scheme results in a reduction in the blockchain’s transactions per second (TPSs), we introduce efficient approaches to mitigate this performance degradation. Our proposed post-quantum delegated proof of luck (PQ-DPoL) combines a proof of luck (PoL) mechanism with a delegated approach, ensuring quantum resistance, energy efficiency, and fairness in block generation. Experimental results demonstrate that while post-quantum cryptographic algorithms like Falcon introduce larger signature sizes and slower processing times, the PQ-DPoL algorithm effectively balances security and performance, providing a viable solution for secure blockchain operations in a post-quantum era.

CoinFA: an efficient coin mixing scheme with flexible amounts

Abstract Coin mixing is an efficient anonymization technology of cryptocurrency used to eliminate the linkability of transaction parties by hiding their addresses in an anonymous set. However, a common weakness with most existing coin mixing schemes is that the amount of mixed coins must be the same for all requests within a mixing cycle, otherwise it is easy for an attacker to restore the linkability of transaction parties. In this paper, we design a stage-payable puzzle solution mechanism, named CoinFA, which reverses the control of the requesting amounts to the users for flexible mixing amounts. In our design, the payee (with an output address) first requests a puzzle from the mixers and the latter are the only ones who know the solution of the puzzle. If the payee solves the puzzle successfully, he can be rewarded with the corresponding Bitcoins. The payer (allowed to have multiple input addresses) then requests the solution by paying in installments. We achieve better security by weakening the rights of the involved third parties, while the hierarchical structure allows our solution to have better efficiency and robustness. We perform a security analysis on CoinFA based on the standard Rivest-Shamir-Adleman (RSA) assumption and Elliptic Curve Digital Signature Algorithm unforgeability. We also analyze the performance of CoinFA by comparing it with two related schemes, and the results show that our CoinFA scheme has a greater advantage when the mixing amount is relatively small.

Advancing cryptographic security: a novel hybrid AES-RSA model with byte-level tokenization

As cyberattacks are getting more complex and sophisticated, stringent, multi-layered security measures are required. Existing approaches often rely on tokenization or encryption algorithms, both of which have drawbacks. Previous attempts to ensure data security have primarily focused on tokenization techniques or complex encryption algorithms. While these methods work well on their own, they have proven vulnerable to sophisticated cyberattacks. This research presents new ways to improve data security in digital storage and communication systems. We solve data security issues by proposing a multi-level encryption strategy that combines double encryption technology along with tokenization. The first step in the procedure is a byte-level byte-pair encoding (BPE) tokenizer, which tokenizes the input data and adds a layer of protection to make it unreadable. After tokenization, data is encrypted using Rivest–Shamir–Adleman (RSA) to create a strong initial level of security. To further enhance security, data encrypted with RSA has an additional layer of encryption applied using the advanced encryption standard (AES) method. This article describes how this approach is implemented in practice and shows how it is effective in protecting data at a higher level than single-layer encryption or tokenization systems.

Secure and efficient data storage with Rivest Shamir Adleman algorithm in cloud environment

Cloud computing rapidly is a prerequisite and releases resources with minimal management effort. The surfacing of the cloud has significantly distorted the general insight into infrastructure, software services, and development models. In contrast to single-key encryption models based on public or private keys (PKs), hybrid encryption systems combine encryption methods using symmetric or asymmetric methods. Various hybrid algorithms fail to meet users’ expectations regarding data security and cannot prevent all security risks. The secure and efficient data storage and retrieval (SEDSR) algorithm was developed for scalable key management between the content owner, cloud user, and service providers in an un-trusted cloud environment. In the implementation, the SEDSR combines the Rivest Shamir Adleman (RSA) algorithm 4096 key length with a primary symmetric key method to provide adequate and compact security with optimal retrieval systems in the cloud. Based on the experimental evaluation, the SEDSR minimizes 1.7 seconds of encryption times (ET) and 1.5 seconds of decryption time (DT) and improves by 34% throughput (TRP) compared to existing parameters.

A Quantum-Resistant Identity Authentication and Key Agreement Scheme for UAV Networks Based on Kyber Algorithm

Unmanned aerial vehicles (UAVs) play a critical role in various fields, including logistics, agriculture, and rescue operations. Effective identity authentication and key agreement schemes are vital for UAV networks to combat threats. Current schemes often employ algorithms like elliptic curve cryptography (ECC) and Rivest–Shamir–Adleman (RSA), which are vulnerable to quantum attacks. To address this issue, we propose LIGKYX, a novel scheme combining the quantum-resistant Kyber algorithm with the hash-based message authentication code (HMAC) for enhanced security and efficiency. This scheme enables the mutual authentication between UAVs and ground stations and supports secure session key establishment protocols. Additionally, it facilitates robust authentication and key agreement among UAVs through control stations, addressing the critical challenge of quantum-resistant security in UAV networks. The proposed LIGKYX scheme operates based on the Kyber algorithm and elliptic curve Diffie–Hellman (ECDH) key exchange protocol, employing the HMAC and pre-computation techniques. Furthermore, a formal verification tool validated the security of LIGKYX under the Dolev–Yao threat model. Comparative analyses on security properties, communication overhead, and computational overhead indicate that LIGKYX not only matches or exceeds existing schemes but also uniquely counters quantum attacks effectively, ensuring the security of UAV communication networks with a lower time overhead for authentication and communication.

Advancing IoT security with flame: A hybrid approach combining fuzzy logic and artificial lizard search optimization

The increasing usage of Internet of Things (IoT) devices has created a need for secure and efficient solutions to protect sensitive data from unauthorized access. However, the complicated and massive structure of IoT systems poses various security risks and challenges, especially in dynamic scenarios with high signaling overhead caused by subscriber mobility. So, in this paper, a Fuzzy-based Lightweight Authentication and Management of Encryption approach called ‘FLAME’ is proposed to solve the decentralized lightweight group key management problem by measuring the degree of security using fuzzy logic (FL) based on various factors like device and user behavior, network conditions, and resource availability. For effective key-based authentication, adopted an Artificial Lizard Search Optimization (ALSO) based RSA (Rivest, Shamir, Adleman) algorithm that generates private and public keys based on security evaluation outcome. The publishers and subscribers obtain encryption keys from the group key manager based on their security level, and dissemination is optimized by the ALSO algorithm. By leveraging the FL and ALSO based RSA algorithm, the system offers secure communication with limited utilization and protects confidential data in IoT environments. According to the analysis, results signify that the FLAME approach has a faster key generation, dissemination, and revocation time compared to existing approaches, along with reduced overhead during key management operations, and increased attack detection capacity of 98.7 %.

IoV-BCFL: An intrusion detection method for IoV based on blockchain and federated learning

In recent years, Internet of Vehicles (IoV) is in a booming stage. But at the same time, the methods of attack against IoV such as Denial of Service (DoS) and deception are great threats to personal and social security. Traditional IoV intrusion detection usually adopts a centralized detection model, which has the disadvantages of untimely detection results and is difficult to protect vehicle privacy in practical applications. Meanwhile, centralized computation requires a large amount of vehicle data transmission, which overloads the wireless bandwidth. Combined the distributed computing resources of Federated Learning (FL) and the decentralized features of blockchain, an IoV intrusion detection framework named IoV-BCFL is proposed, which is capable of distributed intrusion detection and reliable logging with privacy protection. FL is used for distributing training on vehicle nodes and aggregating the training models at Road Side Unit (RSU) to reduce data transmission, protect the privacy of training data, and ensure the security of the model. A blockchain-based intrusion logging mechanism is presented, which enhances vehicle privacy protection through Rivest-Shamir-Adleman (RSA) algorithm encryption and uses Inter Planetary File System (IPFS) to store the intrusion logs. The intrusion behavior can be faithfully recorded by logging smart contract after detecting the intrusion, which can be used to track intruders, analyze security vulnerabilities, and collect evidence. Experiments based on different open source datasets show that FL achieves a high detection rates on intrusion data and effectively reduce the communication overhead, the smart contract performs well on evaluation indicators such as sending rate, latency, and throughput.

Enhancing the Security of Classical Communication with Post-Quantum Authenticated-Encryption Schemes for the Quantum Key Distribution

This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA.

Quantum Cryptography for Enhanced Data Security: A Comparative Survey of Data Encryption and Decryption of Error Correction

Data information security is a crucial concern that ought to be managed to help protect vital data. Cryptography is one of the conventional approaches for securing data and is generally considered a fundamental data security component that provides privacy, integrity, confidentiality, and authentication. In this paper, a comparative survey of Rivest-Shamir-Adleman (RSA) data security algorithm is proposed in order to compare their security strength. In doing so, we integrate traditional RSA and Gaussian Interpolation formulas to test their security level. The integration raised the security strength of RSA to the fifth degree,while the Gaussian First Forward Interpolation was used to encrypt the ASCII values of the message after which the traditional RSA was used to encrypt and decrypt the message in the second and third levels. Comparative data security analysis was performed using four different algorithms; RSA, SRNN, 2-Key pair algorithms, and the results showed that when the data size was small, the encryption and decryption times were lower for the proposed algorithm but higher when the data size was big. Thus the two public keys used and some mathematical relations made the eavesdropper not to get much knowledge about the key and therefore, unable to decrypt the message.

Enhancing healthcare in the digital era: A secure e-health system for heart disease prediction and cloud security

In the modern world, due to changing lifestyles, more people are infected by deadly diseases, especially heart disorders. An early prognosis is the only possible way of increasing survival rate. One of the key elements of this context is the healthcare digitalization that is carried out through Internet of Things (IoTs) and cloud computing. However, main issue in cloud with IoT is false diagnosis, which leads to cause a major impact on patient’s life. Moreover, data communication through cloud servers can be compromised by attackers due to security issues. Therefore, to overcome these issues, this paper proposes a novel secure e-healthcare system with dual objectives- accurate disease prediction and improved cloud security. A novel diagnosis approach ‘Hybrid Binary Particle Firefly Optimized Extreme Learning Machine classifier (HybBPF-ELM)’ to predict HD is designed, that recognize the subject with HD abnormality from the normal ones. The prediction accuracy and time efficiency of training process are improved by the adoption of a Hybrid Binary Particle Firefly Optimizer (HBPFO) through fine-tuning weight and bias of Extreme Learning Machine (ELM) classifier. Additionally, a new intelligent encryption and decryption framework ‘IEDF’ is introduced for cloud security. It combines four encryption algorithms, including Advanced Encryption Standard (AES), Data Encryption Standard (DES), Rivest- Shamir-Adleman (RSA), and Modified Blow Fish (MBF) to enhance cryptographic strength and key security. Along with this, an Automatic Sequence Encryption (ASC) for data block encryption is employed to ensure strong security and network performance. The integration of HD prediction module and cloud security framework within e-healthcare system assists healthcare experts in securely storing and transferring data for advanced diagnosis. The results show that our proposed system achieves an overall prediction accuracy of 99.36 % and less processing time for encryption and decryption of 127.55 s and 452.01 s at 2.2 GB file size respectively.

COMPARATIVE OF RIVEST-SHAMIR-ADLEMAN CRYPTOSYSTEM AND ITS FOUR VARIANTS USING RUNNING TIME AND MEMORY CONSUMPTION ANALYSIS

The Rivest-Shamir-Adleman (RSA) algorithm, known for its slow single-precision multiplication (spm) and overall running time, is not commonly employed to encrypt user data directly. As a result, several researchers have developed various RSA-based cryptosystems to enhance the algorithm's performance while maintaining security. This paper presents a comparative analysis of different variants of the RSA cryptosystem, focusing on five specific cryptosystems: RSA, Somsuk-RSA, Modified-RSA (MRSA), Easy Simple Factoring-RSA (ESF-RSA), and Phony-RSA. The methodology involves evaluating the theoretical running time and memory usage through single-precision multiplication (spm) measurements, while the actual running time is estimated using Maple programming. The research has two primary objectives. Firstly, they examined each algorithm of the RSA variants and analysed them according to the proposed methodology. Secondly, to determine which cryptosystem consumes the most time and memory for key generation, encryption, and decryption. The results indicate that ESF-RSA and RSA are the fastest in terms of key generation, ESF-RSA is the quickest for encryption, and Phony-RSA excels in decryption speed. Additionally, ESF-RSA demonstrates the lowest memory usage, whereas MRSA requires the highest memory allocation for all processes.

Secure map-based crypto-stego technique based on mac address

Steganography and cryptography are spy craft cousins, working differently to achieve the same target. Cryptography is perceptible and observable without understanding the real content, while steganography hides the content so that it is not perceptible or observable and without producing noticeable changes to the carrier image. The challenge is finding the right balance between security and retrievability of embedded data from embedding locations without increasing the required embedded information. This paper proposes a secure map-based steganography technique to enhance the message security level based on the sender and recipient mac addresses. The proposed technique uses rivest-shamir-adleman (RSA) to encrypt the message, then embeds the cipher message in the host image based on the sender and recipient media access control addresses (mac addresses) exclusive or operation "XOR" results without increasing the required embedded information for the embedding location map. The proposed technique is evaluated on various metrics, including peak signal-to-noise ratio (PSNR) and embedding capacity, and the results show that it provides a high level of security and robustness against attacks without an extra location map. The proposed technique can embed more data up to 196.608 KB in the same image with a PSNR higher than 50.58 dB.

A BlockChain-Based IoT Data Securing and Sharing System for Attendance Management

Objective: An Internet of Things (IoT) network has constraints on power consumption, processing power and security of end devices in the network. On the other hand, blockchain technology has some difficulties in storage capacity, data privacy, the ability to revoke consent, energy usage, scalability, and speed. To overcome the individual limitations of these two technologies, we integrate these two to propose a new design with an intention to authenticate, secure and share data pertaining to attendance system. In this present work the primary implementation details of our proposed work regarding coding are analyzed and a straightforward solution is offered by using indexing. Methods: Through our proposed work we introduce a multifaceted authentication system for user device substantiation, a Public Key Infrastructure (PKI) and RSA (Rivest-Shamir-Adleman) based blockchain implementation for data sharing and a rule-based access control scheme used for accessing data. Findings: The system can work with unidirectional and bidirectional IoT networks, and the data is stored on blockchain, providing more security to the data generated on the IoT network. Blockchain technology is utilized to offer a solution for certain problems encountered within a widespread network. Furthermore, a multi-factor authentication scheme is introduced and a rule-based access control scheme to access the data. Novelty: The blockchain is emerging which can be used to decentralize management and protect sensitive data. In a blockchain based attendance system, no administrative authority is permitted to modify or erase data. The individual who adds a data entry to the blockchain cannot later deny their involvement in the action. On the blockchain, all of the data and history are accessible to every participant. The blockchain based attendance system needs to offer a database that can be trusted, secure, and impossible to manipulate. Keywords: Blockchain (BC), Internet of Things (IoT), Student Attendance Management (SAM), User Authentication Key (UAK), Data Sharing