Security and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms

The RC-5 algorithm is an algorithm with the encryption method using the symmetric method and processing in the form of a cipher block, the same keywords are used for the encryption and decryption processes. The testing and analysis phase consists of a). Testing the execution time of the key generation process (set up key) b). Testing the success of the encryption and decryption process on the client-server integration method c). Testing the success of the encryption and decryption process using the file operation method d). Comparison of overhead/file size before and after passing through the system. The testing phase and execution time analysis are carried out when using the file operation method where the test will be divided into 3 parts, namely the execution time for the key setup process, the encryption process, and the decryption process. Testing the success of the encryption and decryption process on the client-server integration method is divided into 2 parts, namely testing the encryption process and the decryption process. In testing the encryption process, the characters that will be sent to the server will be encrypted first with a key to becoming a ciphertext in the form of integer data. The test results obtained are 1). The execution time for key generation (set up key) is very fast, around 9-10 ns. 2). In the encryption and decryption process, the execution time depends on the size of the plaintext file. The larger the plaintext file size, the longer the execution time. Where for a file with a size of 1 kb requires an execution time of 50.6 ms in the encryption process. 3). There is no difference between the size of the file before entering encryption and after decryption. Where for files with a size of 500 bytes before entering the encryption process, a file of 500 bytes will be generated from the decryption process.

Since the existing RSA Algorithm needs long key sizes, requires big memory spaces and also a long execution time, it seems necessary to make some changes or taking some necessary precautions during the implementation of RSA in order to provide maximum security level. In this paper, three experiments were developed in order to examine the execution time of the processes of encryption and decryption and comparing the results together to elicit the improved points and discussing them. Moreover, some programming techniques will be used in order to speed up the process of encryption or decryption. The results indicate that the execution time of encryption process was improved by 14% in experiment 3 by using some techniques to speed up the process, the decryption process was improved as well by 22%.

The rapid The main problem in the misuse of data used in crime is the result of a lack of file security. This study proposes a data security method to protect document files using the Advanced Encryption Standard (AES) algorithm combined with the Vigenere Cipher. This research carried out 2 processes, namely the encryption process and the decryption process. The encryption process will be carried out by the AES algorithm and then encrypted again with the Vigenere Cipher algorithm. The experiments show that the proposed method can encrypt files properly, where there are changes in the value of the document file and the encrypted file cannot be opened and the description results do not cause changes to the original file. The results of this study are that the system is able to work properly so as to produce file encryption and decryption using the AES method combined with the Vigenere Cipher. In document files, the largest difference in encryption and decryption time is 8 seconds, while in image files the difference in encryption and decryption time is 17 seconds. This longest time difference is generated by large files.

In modern edge scenarios, the security of sensor networks plays a pivotal role in ensuring the safe communication of IoT data. Therefore, deploying encryption algorithms among edge devices is of paramount importance. However, most existing research predominantly emphasizes the efficiency of data transmission while often overlooking critical aspects of data integrity and confidentiality. The communication between sensor nodes and from sensors to end nodes necessitates additional robust security measures.This paper presents an enhanced approach to the RSA and AES algorithms, tailored for deployment on low-energy IoT devices commonly found in edge environments. The improved AES algorithm transitions from a single-threaded encryption and decryption process to a three-threaded design, reducing the ten-round operation to seven rounds to enhance both speed and energy efficiency. The enhanced RSA algorithm replaces the traditional dual-prime system with a triple-prime system, increasing the number of primes while reducing the bit length of each prime. This modification optimizes computational efficiency and strengthens security.Furthermore, we investigate the feasibility of integrating the RSA and AES algorithms and propose a novel RSA-AES hybrid algorithm MRA. This fusion approach leverages the strengths of both algorithms, encrypting the AES key using the improved RSA algorithm to bolster data security while maintaining efficient transmission.Performance evaluations of the RSA-AES hybrid algorithm demonstrate its exceptional capability in securing data transmission within edge scenarios,and the security of this hybrid algorithm is analyzed. The experimental results highlight that this algorithm not only ensures robust data security but also achieves high transmission efficiency, offering a reliable and practical solution for secure communication in edge environments.

In this paper, fault detection scheme is introduced to improve the security and reliability of the NTRU in realistic environments, such as operating over a network. As the NTRU will be working in real networks, which have their own set of transient errors, handling such errors in analyzing the NTRU becomes a must. A single transient error occurring during the NTRU encryption (or decryption) process will likely result in a large number of errors in the encrypted/decrypted data. Such faults must be detected before sending data to avoid the transmission and use of erroneous data. Concurrent fault detection is important not only to protect the encryption/decryption process from random faults, but it will also protect the decryption circuitry from an attacker who may maliciously inject faults in order to find the secret key. We first describe the effects that faults may have on NTRU security while operating over a network by analyzing the propagation of such faults to the outputs. We then present two fault detection schemes: The first is a redundancy-based scheme while the second uses an error detection code. The latter present fault detection schemes by using an error detecting code, using one parity bit. We will add the parity bits to the polynomials and disable the device output when any of these parity checks are violated. This fault detection scheme has more than 99% coverage fault detection in the encryption process and in the first part in the decryption process. In the second part in the decryptionprocess, it has more than 67 % coverage fault detection. We can increase this ratio to high fault detection by adjusting the choices of the parameters of the NTRU network security system.

Digital image is digital pictures on a two-dimensional plane which consists of pixels, where every pixels has Red, Green, Blue (RGB) with varying intensity depending on the image. In this thesis digital image is encrypted using hybrid algorithm Vigenere and RSA. Vigenere algorithm is a symmetric key algorithm which is a variety from Caesar algorithm where the similarity is in both of them are based on shifting the index of alphabet letters. RSA algorithm are based on the difficulty of factorizing large numbers that have 2 and only 2 factors (Prime numbers). The encryption process starts with getting the RGB intensity of each pixels from the image, then the RGB values are encrypted using Vigenere algorithm, after that RSA Algorithm encrypt those values, the values of RSA Algorithm encryption are limited so the value can be within the intervals of RGB values and the after limitation the values after being limited become the RGB values in the encrypted image. The decryption process is the inverse of encryption process, which enables the encrypted image to become the initial image before encryption. The program for encrypting and decrypting image are made using Java programming language with Netbeans IDE 8.2 software. The result of this implementation on image file donbass.jpg with the length of Vigenere key of 5 those are k1=144, k2=166 , k3=38 , k4=204 , k5=98, and RSA Algorithm keys are n=2201, e=1139, d=59, the results from the encrypted image is a visually very different image from the initial image. While in the decryption process, the encrypted image is able to be decrypted back to the initial image.

A new LabVIEW simulation design was applied to provide a comparison study among several types of the most common symmetric and asymmetric encryption algorithms. Also, the comparison with advanced encryption package program was made. The results showed that the new LabVIEW simulation design had advantages in several points, where the evaluated time required for the encryption and decryption processes will be lesser than it values using advanced encryption package program.In this work, the symmetric encryption algorithms were used: AES (Advanced Encryption Standard), DES (Data Encryption Standard), 3DES (Triple Data Encryption Standard) and RC2 (Rivest Cipher) algorithms, while the asymmetric encryption algorithm used was the RSA (Rivest-Shamir-Aldeman) algorithm. The comparison had been achieved using different sizes of text files with different key sizes. The final results proved that the LabVIEW simulation design is better than the Advanced Encryption Package because it increased the algorithm’s performance by 65% in terms of speed and throughput, and for the algorithms’ comparison, the final results showed the effectiveness of AES algorithm over the other algorithms in terms of speed and throughput for the encryption and decryption processes.

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutation-based AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems.

RSA has two keys, namely public key and secret key. RSA bases its encryption and decryption process on the concepts of prime numbers and modulo arithmetic. Both encryption and decryption keys are integers. The encryption key is not kept secret and given to the public (so called the public key), but the key for decryption is confidential (private key). To find the decryption key, it is done by factoring an integer into its prime factors. Therefore to strengthen the security of the RSA algorithm it is necessary to process the key making by factoring an integer into its prime factors in general. Because this is so common, a key modification to the RSA algorithm needs to be done. Modifications are carried out by using another algorithm that uses random numbers. By entering random numbers, it is considered able to eliminate the possibility of an attacker guessing the results by knowing the algorithm. One of these algorithms is the Blum Blum Shub Algorithm (BBS) algorithm. The purpose of using the Blum Blum Shub (BBS) algorithm is to make the key more difficult to guess, making it difficult for cryptanalysts to read the message or information. Based on the results of the above analysis that the RSA algorithm can be used for key formation by using the Blum Blum Shub algorithm as a key used in the RSA algorithm

The computational complexity study of algorithms is highly germane to the design and development of high-speed computing devices. The whole essence of computation is principally influenced by efficiency of algorithms; this is more so the case with the algorithms whose solution space explodes exponentially. Cryptographic algorithms are good examples of such algorithms. The goal of this study is to compare the computational speeds of RSA and ElGamal cryptographic algorithms by carrying out a survey of works done so far by researchers. This study has therefore examined some of the results of the studies already done and highlighted which of the RSA and ElGamal algorithms performed better under given parameters. It is expected that this study would spur further investigation of the behaviour of cryptographic structures in order to ascertain their complexity and impact on the field of theoretical computer science. The experimental results of many of the papers reviewed showed that RSA cryptographic algorithm performs better as regards to energy usage, time complexity and space complexity of text, image and audio data during encryption process while some studies showed that ElGamal performs better in terms of time complexity during decryption process.

File transfer by using a smartphone has some security issues like data theft by irresponsible parties. To improve the quality of data security systems on smartphones, in this research the integration of AES 256 bit algorithm by using MD5 hashing is proposed. The use of MD5 aims to increase the key strength of the encryption and decryption process of document files. The test results show that the proposed method can increase the key strength of the encryption and decryption process in the document file. Encryption and decryption time by using AES and MD5 combination is faster than using AES only on *.txt file type and reverse results for *.docx, *.xlsx, *.pptx and *.pdf file files.

This paper proposed enhancing the RSA algorithm through the use of additional third prime number in the composition of the public and private key. This will increase the factoring complexity of the variable (n), where the process of its analysis with the development of equipment and tools becomes much easier nowadays.The existence of three prime numbers will give the ability to the enhanced encryption method to increase the difficulty of factoring of the variable (n), as well as speed increasing in the process of encryption and decryption. To generate a variable (n) using the original RSA algorithm, which contributes generating the public and private key that have a number of 300 digits by using two primes number with 150 digits each. In this case the multiplication process will take longer than the time of generating the same variable (n) by using three prime numbers where each number with 100 digits.We have conducted experiments on a set of numbers randomly, as they proved that the Enhanced Method for RSA Cryptosystem Algorithm is faster than the original algorithm in encryption and decryption process and generating public and private key. Also it shows that the analysis of the variable (n) will take a long time in the Enhanced Method for RSA Cryptosystem Algorithm and this indicates the increasing complexity in the analysis method.

DNA Cryptography is one of new algortihm in cryptography that is used to encrypt the data by converting the DNA code into binary code. Encryption process is expected to produce a random and unreadable ciphertext. This research aims to determine the result of encryption frequency analysis of the ciphertext obtained from the encryption process using DNA Cryptography and Digraph Transformation algorithm. The formation of a symmetric key is carried out for the encryption and decryption process in DNA Cryptography, and modular arithmetic in Digraph Transformation algorithm. The encryption process produces ciphertext in the form of letters and symbols because if involves the use of an ASCII table. Frequency analysis is done by comparing the frequency of occurence of letters in the ciphertext with frequency of occurence of letters in English. The conclusion for this research is that the ciphertext looks random, not easy to read, and hard to guess. For the future work, researcher can change the choice of binary code combinatory in DNA Cryptographic algorithms, increase the character vocabulary in the Digraph Transformation algorithm, and use various languages to code.

With the rapid development of computer network technology, information security has attracted increasing attention. Due to the characteristics of multi-dimensional operation and parallel processing capability, optical image encryption techniques have been receiving more and more attention. Since the well-known double random phase encoding technique was proposed, many other methods based on optical information processing means such as the use of optical transform, interference, and polarized light encoding, have been proposed for optical image encryption. However, recent researches have demonstrated that traditional optical encryption techniques are symmetric cryptosystems, in which decryption keys are identical to encryption keys and they have been found to be vulnerable to different types of attacks, such as known plaintext and chosen plaintext attacks. To overcome this shortcoming, asymmetric cryptosystems based on nonlinear phase-truncation techniques and phase retrieval algorithm have been proposed. Asymmetric cryptosystem is a cryptographic system in which encryption keys are different from decryption keys. The encryption keys are used as public keys which are disseminated widely, and the decryption keys are used as private keys which are known only to the authorized users. So, asymmetric cryptosystem can offer a higher-level security than symmetric cryptosystem. However, asymmetric cryptosystems based on phase retrieval algorithms require a lot of computational time, and asymmetric cryptosystems based on phase-truncated Fourier transforms have been found to be vulnerable to special attack. Therefore, in this paper, a novel asymmetric image encryption method is proposed by using the gyrator transform and vector operation. The original image is encrypted into two phase masks with vector operation. One is a random phase mask and the other is a phase mask related to the original image. In the encryption process, the random phase mask is used as a phase key and the other phase mask is transformed by gyrator transform. The transform result is performed by Fourier transform after being modulated by a phase distribution. The ciphertext is the amplitude of the above result. Compared with previous encryption schemes, the suggested method has two advantages. Firstly, we have proposed a new asymmetric encryption method based on the gyrator transform and vector operation. The decryption process is different from the encryption process. The gyrator transform and Fourier transform are used in the encryption process, while only the inverse operation of Fourier transform is employed in the decryption process. In addition, the decryption keys produced in the encryption process are different from the encryption keys. Therefore, the proposed scheme has high resistance against the conventional attacks. Secondly, the encrypted result is real-valued, which is convenient for display, transmission and storage.Numerical simulations illustrate the feasibility and effectiveness of the proposed encryption scheme.

In the recent days people use a variety of online software applications to move data from one location to another. To secure personal data from hackers, software or applications use cryptographicbased algorithms. The encryption and decryption processes are the foundation of the cryptographic algorithm, which will be carried out with the help of a key. Cryptographic algorithms employ automatic key generation that starts with the user’s password, whereas another generating key directly interprets the password. A symmetric algorithm uses the same key for both encryption and decryption. For key generation, symmetric algorithms use a second or subsidiary method. The password is protected using this key generation process from various key attacks. The key generation algorithm functions as an interpreter, transforming a password from a human-readable form to a machine-readable form. An increase in permutations and combinations helps to protect the password; additional characteristics are being added to the algorithm. To get around the restricted key bit size, this paper proposed the KEY SECURE-KEY (KSKEY) algorithm. However, increasing the key size is not a suitable way to encrypt data because multi-core processors in modern microprocessors are significantly increasing processingspeed.