scholarly journals Elements of RSA Algorithm and Extra Noising in a Binary Linear-Quadratic Transformations During Encryption and Decryption of Images

Author(s):  
Anatoliy Kovalchuk ◽  
Nataliia Lotoshynska
2020 ◽  
Vol 5 (4) ◽  
pp. 395-398
Author(s):  
Taleb Samad Obaid

To transmit sensitive information over the unsafe communication network like the internet network, the security is precarious tasks to protect this information. Always, we have much doubt that there are more chances to uncover the information that is being sent through network terminals or the internet by professional/amateur parasitical persons. To protect our information we may need a secure way to safeguard our transferred information. So, encryption/decryption, stenographic and vital cryptography may be adapted to care for the required important information. In system cryptography, the information transferred between both sides sender/receiver in the network must be scrambled using the encryption algorithm. The second side (receiver) should be outlook the original data using the decryption algorithms. Some encryption techniques applied the only one key in the cooperation of encryption and decryption algorithms. When the similar key used in both proceeds is called symmetric algorithm. Other techniques may use two different keys in encryption/decryption in transferring information which is known as the asymmetric key.  In general, the algorithms that implicated asymmetric keys are much more secure than others using one key.   RSA algorithm used asymmetric keys; one of them for encryption the message, and is known as a public key and another used to decrypt the encrypted message and is called a private key. The main disadvantage of the RSA algorithm is that extra time is taken to perform the encryption process. In this study, the MATLAB library functions are implemented to achieve the work. The software helps us to hold very big prime numbers to generate the required keys which enhanced the security of transmitted information and we expected to be difficult for a hacker to interfere with the private information. The algorithms are implemented successfully on different sizes of messages files.


2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto

This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.


2020 ◽  
Vol 8 (4) ◽  
pp. 475
Author(s):  
Maria Okta Safira ◽  
I Komang Ari Mogi

In this paper two methods are used, namely the vigenere cipher method and the RSA method. The vigenere cipher method is an example of a symmetric algorithm, while RSA is an example of an asymmetric algorithm. The combination of these two methods is called hybrid cryptography which has the advantage in terms of speed during the encryption process. Each process, which is encryption and decryption, is carried out twice, so that security can be ensured. In the process of forming the key used the RSA method. In the encryption process using public keys that have been generated before when the key is formed. This public key is used in sending data to the recipient of a secret message where this key is used for the data encryption process. The Secret key is kept and will be used during the decryption process. There is a system architecture that describes how clients and servers communicate with each other over the internet using the TCP protocol where the client here is an IoT device and the server is a server. 


2018 ◽  
Vol 1 (1) ◽  
pp. 6
Author(s):  
Rehan Shams ◽  
Fozia Hanif Khan ◽  
Umair Jillani ◽  
M. Umair

A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption. This procedure also requires random generation of prime numbers, therefore, we are proposing an efficient fast Primality testing algorithm to meet the requirement for generating the key in RSA algorithm. We use right-to-left-binary method for the exponent calculation. This reduces the number of cycles enhancing the performance of the system and reducing the area usage of the FPGA. These blocks are coded in Verilog and are synthesized and simulated in Xilinx 13.2 design suit.


2020 ◽  
Vol 2 (1) ◽  
pp. 13
Author(s):  
Nur Cayo Hendro Wibowo ◽  
Khotibul Umam ◽  
Albadru Muh Izul Khaq ◽  
Favian Agung Rizki

<p align="center"><em>Cryptography is a branch of mathematics. Asymmetric algorithms such as RSA, including the type of cryptography that is more widely used to be implemented in everyday life because it has an algorithm that is not easy to be misused by others. However, the encryption and decryption process of RSA requires quite a long time. For this reason, RSA - CRT emerged. In this study a time comparison between the RSA algorithm and the RSA-CRT Base On Computer is done. The purpose of this study was to determine the execution time of the RSA-CRT algorithm using PHP.</em></p><p><em>This research uses the Research and Development or R&amp;D method, with the R&amp;D method created by the product development RSA-CRT algorithm application from UIN Walisongo Semarang based on computer. Based on the data analysis, the conclusion is that although the manual calculation of the RSA-CRT algorithm takes longer than the others in this case RSA. But have a faster time when using PHP.</em></p><p align="center"> </p>


2019 ◽  
Vol 8 (4) ◽  
pp. 2797-2800

visual cryptography system proposed a image encryption and decryption method. In the proposed method Red, Green, Blue color images using visual cryptography. In existing system is working for share created, it is encrypted separately by using visual secret share creation (VSS) algorithms. The proposed work is original images share1 and ahare2 created XOR-Based visual cryptography. This proposed schemes share1 encryption and share2 encryption included in RSA algorithm. The share1 and ahare2 decryption process is enable secret image sharing and then stacking. The proposed system is value calculate the PSNR and MSE formula and then image security using NPCR and UACI formula. The visual cryptography existing work to compare the proposed work and better results quality of RGB color images. The color image encryption and decryption using RSA algorithm and matlab coding.


Compiler ◽  
2014 ◽  
Vol 3 (1) ◽  
Author(s):  
Muttaqin Muttaqin ◽  
Haruno Sajati ◽  
Nurcahyani Dewi Retnowati

Chatting application is an application which used for communication through local network or internet. It can use to make communication to be effective and easy to use but there are several shortage in delivery information process is data security when communication is going on. Using chrypthography with modification Rivest Shamir adleman (RSA) algorithm in encryption process and decryption on packet data which transmited is one of security system which can used in this application then the security of data packet secured. Result from implementation of chatting application which apply chrypthography with modification Rivest Shamir adleman (RSA) algorithm have done in local network and internet able to run smoothly and have done by several testing cases based on certain scenario.  Whereas process testing encryption  and decryption using tools wireshark.


2019 ◽  
Vol 8 (2) ◽  
pp. 6142-6147

Encryption and Decryption schemes based on applications of Laplace Transforms are unable to provide more security to communicate the information. Rivest, Shemir, Adleman (RSA) Cryptosystem is popular public-key algorithm. This paper provides the conditions that give rise to the RSA Cryptosystem based on the Laplace Transform techniques. The modified RSA cryptosystem is explained with an algorithm. The proposed algorithm is implemented using a high level program and time complexity of the proposed algorithm is tested with RSA cryptosystem algorithms. The comparison reveals that the proposed algorithm enhances the data security as compare with RSA cryptosystem algorithms and application of Laplace Transform for cryptosystem scheme. The statistical analysis for the proposed and existing algorithms is provided


Cloud Security is a technique of safeguarding applications, infrastructures and data involved in cloud computing. Cloud security uses a set of technologies, policies and controls to protect data and application from unauthorized access. RSA encryption and decryption algorithm is presented here for cloud security. The cloud can access the data only after receiving the user’s encrypted message using RSA algorithm. However, while transmitting the encrypted message more bandwidth is consumed as the message is transmitted over wireless channel. To minimize the bandwidth, the encrypted message is transmitted into a number of encoded bits and the cloud service provider can append the bits and recover the original message. The performance results for RSA algorithm and the RSA algorithm using Fountain Code are simulated. The results show that the energy, end-to-delay are minimized while using Fountain Code RSA algorithm. In addition, the packet loss ratio decrease and the packet delivery ratio increase.


JURTEKSI ◽  
2019 ◽  
Vol 6 (1) ◽  
pp. 1-10
Author(s):  
Sebastian Suhandinata ◽  
Reyhan Achmad Rizal ◽  
Dedy Ongky Wijaya ◽  
Prabhu Warren ◽  
Srinjiwi Srinjiwi

Abstract:Computer data security relies on preventing data theft from irresponsible parties by using cryptography method. Some cryptography algorithms have good and poor performance in encrypting and decrypting data depending on the key types. Therefore the purpose of this research is to measure the performance of the hybrid algorithm, consisting a symmetric keyBlowfish algorithm and an asymmetric key RSA algorithm, in encrypting and decrypting multiple types of data such as documents, photos, audios, and videos. The result is the performance of the hybrid algorithm is almost on par with Blowfish and provides a more secure data encryption and decryption by taking advantage of RSA algorithm. The average encryption performance of hybrid algorithm is 0.85s on document, 1.06s on photo, 3.38s on audio, and 15.56s on video. While the average decryption performance of hybrid algorithm is 1.01s on document, 1.38s on photo, 4.3s on audio, and 27.56s on video.            Keywords:Hybrid cryptography, Data security, Performance, Blowfish, RSA  Abstrak:Keamanan data komputer berhubungan dengan pencegahan dari pencurian data oleh pihak yang tidak bertanggung jawab, salah satu cara pengamanan data komputer yaitu dengan teknik kriptografi. Beberapa metode kriptografi memiliki performa yang baik dan buruk tergantung dengan tipe kuncinya. Maka dari itu, tujuan dari penelitian ini adalah mengukur tingkat kecepatan kriptografi hybrid, terdiri dari algoritma simetris Blowfish dan algoritma asimetris RSA, dengan beberapa tipe data seperti dokumen, foto, audio dan video. Hasil dari penelitian ini adalah algoritma hybrid memiliki performa yang tidak jauh berbeda dari algoritma Blowfish dan membuat proses enkripsi dan dekripsi data lebih aman dengan keunggulan dari algoritma RSA. Rata-rata kecepatan enkripsi algoritma hybrid untuk dokumen 0,85 detik, gambar 1,06 detik, audio 3,38 detik, dan video 15,56 detik. Sedangkan rata-rata kecepatan dekripsi algoritma hybrid untuk dokumen 1,01 detik, gambar 1,38 detik, audio 4,3 detik, dan video 27,56 detik. Kata kunci:Kriptografihybrid, Keamanan data, Performa, Blowfish, RSA 


Sign in / Sign up

Export Citation Format

Share Document