scholarly journals Study A Public Key in RSA Algorithm

2020 ◽  
Vol 5 (4) ◽  
pp. 395-398
Author(s):  
Taleb Samad Obaid
Keyword(s):  
Private Information ◽  
Original Data ◽  
Prime Numbers ◽  
Public Key ◽  
The Internet ◽  
Sensitive Information ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Main Disadvantage ◽  
Encryption Decryption

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.

scholarly journals RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol

2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto
Keyword(s):  
Prime Number ◽  
Instant Messaging ◽  
Prime Numbers ◽  
Public Key ◽  
Key Generation ◽  
Security Testing ◽  
Rsa Algorithm ◽  
Computer Resource ◽  
Encryption And Decryption ◽  
Private And Public

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.

scholarly journals A Comprehensive Review of Cryptographic Algorithms

2021 ◽  
Vol 9 (12) ◽  
pp. 1750-1756
Author(s):  
Kinjal Raut
Keyword(s):  
Personal Information ◽  
Hash Functions ◽  
The Internet ◽  
Sensitive Information ◽  
Comprehensive Review ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Encryption Decryption ◽  
Symmetric Key Cryptography

Abstract: The internet has revolutionized advancements, it’s conveniences and uses come at the price of new perils. To be safe from being the victim of fraud, theft and other damage security and vigilance is critical. Cryptography plays an important role in securing information and communications using a set of rules, it ensures the integrity of our data. It maintains confidentiality by protecting the privacy of personal information stored in enterprise systems. Hence Encryption is the only way to ensure that your information remains secure while it is stored and being transmitted. Cryptographic Algorithms mathematically maintain the integrity, confidentiality and authenticity of sensitive information by preventing data disclosure, data tampering and repudiation. The three main types of cryptography are Symmetric Key Cryptography, Asymmetric Key Cryptography and Hash Functions. In this Paper, several important algorithms used for encryption and decryption are defined and analysed, the algorithms are DES, AES, ECC, RSA, MD5 Keywords: Cryptography, Encryption, Decryption, AES, DES, ECC, RSA, Blowfish, MD5

Design Of Hybrid Cryptography With Vigenere Cipher And RSA Algorithm On IOT Data Security

2020 ◽  
Vol 8 (4) ◽  
pp. 475
Author(s):  
Maria Okta Safira ◽  
I Komang Ari Mogi
Keyword(s):  
System Architecture ◽  
Data Security ◽  
Data Encryption ◽  
Public Key ◽  
Secret Message ◽  
Secret Key ◽  
Rsa Algorithm ◽  
Tcp Protocol ◽  
Public Keys ◽  
Encryption And Decryption

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. 

scholarly journals 3 Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog

2018 ◽  
Vol 1 (1) ◽  
pp. 6
Author(s):  
Rehan Shams ◽  
Fozia Hanif Khan ◽  
Umair Jillani ◽  
M. Umair
Keyword(s):  
Communication System ◽  
Prime Numbers ◽  
Key Generation ◽  
Random Generation ◽  
Primality Testing ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Number Of Cycles ◽  
Testing Algorithm ◽  
Secured Communication

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.

scholarly journals Encryption and Decryption of data using Elliptical Curve Cryptography

2019 ◽  
Vol 8 (9) ◽  
pp. 1141-1144
Keyword(s):  
Performance Metrics ◽  
Personal Information ◽  
Public Key Cryptography ◽  
Original Data ◽  
Public Key ◽  
Key Generation ◽  
Plain Text ◽  
Private Key ◽  
Encryption And Decryption ◽  
Pixel Value

Aadhaar database is the world's largest biometric database system. The security of Aadhaar database plays a major role. In order to secure such huge database, an encryption and decryption algorithm has been proposed in this paper. Elliptic Curve Cryptography (ECC) is a public key cryptography which is used to provide high security to those databases. The Aadhaar database contains individual personal information as well as their biometric identities. ECC is widely used for providing security to all kinds of data. ECC has smaller key size, fast computation, high throughput compared to other cryptographic algorithms. The data’s present in database are converted into their corresponding Pixel or ASCII values. After that the encryption process is done with the help of public key, private key, generation points and plain text. After the encryption process, the encrypted coordinates can be mapped with the generated points and from that corresponding ASCII value for text, pixel value for image can be retrieved. Then, the alphabet which is corresponding to ASCII will be displayed so that the cipher text can be viewed. This encrypted data is stored in the database. In order to retrieve the original data decryption process using ECC is carried out. In decryption process, receiver’s private key and cipher coordinates which is retrieved from encryption process are used. Therefore, the personal details of an individual can be retrieved with the presence of that particular person who only knows that private key. So, the hackers will not be able to retrieve the database of any individual just by knowing their Aadhaar ID. The proposed work is implemented in the MATLAB software. The Performance metrics like PSNR, Similarity, Correlation Coefficient, NPCR and UACI has been done for analysis.

scholarly journals Enhancing the Data Security by Using RSA Algorithm with Application of Laplace Transform Cryptosystem

2019 ◽  
Vol 8 (2) ◽  
pp. 6142-6147
Keyword(s):  
Statistical Analysis ◽  
Laplace Transform ◽  
Data Security ◽  
Time Complexity ◽  
Public Key ◽  
Rsa Cryptosystem ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
The Laplace Transform ◽  
High Level

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

scholarly journals Digital Identity

2020 ◽  
Vol 7 (4) ◽  
pp. 246-252
Author(s):  
Majeed Mohamed Fareed Majeed ◽  
Abdurahman Adisaputera ◽  
Muhammad Ridwan
Keyword(s):  
Private Information ◽  
Financial Services ◽  
Virtual World ◽  
Daily Life ◽  
The Internet ◽  
Sensitive Information ◽  
Digital Environment ◽  
Digital Identity ◽  
Life Issues

With the penetration and spread of the Internet in our daily life, issues related to our identity on the Internet and their potential impacts on our lives, whether positive or negative, have become very important. We, as individuals, interact with a number of websites and services on the Internet that require an account (username and password) to access. These sites range from simple news sites that limit the number of articles that you can read anonymously in a certain period of time, to financial services or healthcare sites or others. Similar services on the Internet require that you know with certainty that you are definitely "you" before granting you access to any private information. Of course, we want them to confirm our identity before allowing access to this type of very sensitive information, which can be used to inflict harm. Take us in different ways if you fall into the wrong hands. The presence in the virtual world has formed the digital identity, and this digital identity has different effects on the morals and habits of the users in this virtual world. Because of the existence of a digital identity, you may also be exposed to some type of privacy crime. In this case, we must study and adapt to create patterns of coexistence and resilience in the digital environment.

scholarly journals Design and Implementation of RSA Algorithm using FPGA

2015 ◽  
Vol 14 (12) ◽  
pp. 6361-6367 ◽  
Author(s):  
Ari Shawkat Tahir
Keyword(s):  
Algorithm Design ◽  
Public Key ◽  
Transmission Channel ◽  
Clock Frequency ◽  
Rsa Algorithm ◽  
Cryptographic Algorithm ◽  
Hardware Resource ◽  
Encryption Decryption ◽  
Modular Operation ◽  
Secure Transmission

RSA cryptographic algorithm used to encrypt and decrypt the messages to send it over the secure transmission channel like internet.  The RSA algorithm is a secure, high quality, public key algorithm. In this paper, a new architecture and modeling has been proposed for RSA public key algorithm, the suggested system uses 1024-bit RSA encryption/decryption for restricted system. The system uses the multiply and square algorithm to perform modular operation. The design has been described by VHDL and simulated by using Xilinx ISE 12.2 tool. The architectures have been implemented on reconfigurable platforms FPGAs. Accomplishment when implemented on Xilinx_Spartan3 (device XC3S50, package PG208, speed -4) which confirms that the proposed architectures have minimum hardware resource, where only 29% of the chip resources are used for RSA algorithm design with realizable operating clock frequency of 68.573 MHz.

scholarly journals Analisis dan Implementasi Algoritma Asimetris Dual Modulus RSA (DM-RSA) pada Aplikasi Chat

2021 ◽  
Vol 5 (4) ◽  
pp. 768-773
Author(s):  
Aminudin ◽  
Ilyas Nuryasin
Keyword(s):  
Prime Numbers ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
The Public ◽  
Asymmetric Model ◽  
Rsa Algorithm ◽  
Private Key ◽  
Public Keys ◽  
Cryptographic Algorithms

The RSA algorithm is one of the cryptographic algorithms with an asymmetric model where the algorithm has two keys, namely the public key and the private key. However, as time goes on, these algorithms are increasingly exposed to security holes and make this algorithm vulnerable to being hacked by people who do not have authority. The vulnerability stems from the algorithm's public keys (e and n). The strength of the RSA algorithm is based on the difficulty of factoring two prime numbers that are generated during the key generation process, if these values ​​can be known using certain methods, the public key and private key values ​​will be found. Therefore, there are many studies that improvise the RSA algorithm, one of which is the Dual Modulus RSA (DM-RSA) algorithm. The algorithm uses four prime numbers which produce 2 modulus and 4 keys (2 public keys and 2 private keys). From the results of the Kraitchik factorization test, it was found that the DM-RSA algorithm was proven to be more resistant up to 2 times or even more than the standard RSA algorithm. This is evidenced by the fact that the value of n is 24 bits, the RSA algorithm can last up to 63204 ms (1 minute 22 seconds) while the Dual Modulus RSA algorithm lasts up to 248494123 ms (142 minutes 47 seconds).  

A Simple and Secure Credit Card-Based Payment System

2010 ◽  
pp. 834-842
Author(s):  
Chi Po Cheong
Keyword(s):  
Private Information ◽  
Credit Card ◽  
Financial Institution ◽  
Payment System ◽  
The Internet ◽  
Sensitive Information ◽  
Payment Systems ◽  
Credit Card Number ◽  
Card Number ◽  
Card Payment

Credit card is the most popular payment method used in Internet shopping. The idea of credit card payment is to buy first and pay later. The cardholder can pay at the end of the statement cycle or they can pay interest on the outstanding balance. Therefore, there are many credit card-based electronic payment systems (EPSs) that have been developed to facilitate the purchase of goods and services over the Internet such as CyberCash (VeriSign), iKP (Bellare, Garary, Hauser, et al, 1995), SET (Visa and MasterCard, 1997), CCT (Li & Zhange, 2004), and so forth. Usually a credit card-based EPS involves five parties: cardholder, merchant, acquirer bank, issuer bank, and financial institution. Internet is an open system and the communication path between each other is insecure. All communications are potentially open for an eavesdropper to read and modify as they pass between the communicating endpoints. Therefore, the payment information transmitted between the cardholder and the merchant through Internet is dangerous without a secure path. SSL (Zeus Technology, 2000) is a good example to secure the communication channel. Besides the issue of insecure communication, there are a number of factors that each participant must consider. For example, merchant concerns about whether the credit card or the cardholder is genuine. There is no way to know the consumer is a genuine cardholder. As a result, the merchant is incurring the increase in losses due to cardholder disputes and frauds. On the other hand, cardholders are worried about the theft of the privacy or sensitive information such as the credit card number. They don’t want any unauthorized usage of their credit cards and any modification to the transaction amount by a third party. These security issues have deterred many potential consumers from purchasing online. Existing credit card-based EPSs solve the problems in many different ways. Some of them use cryptography mechanisms to protect private information. However, they are very complicated, expensive, and tedious (Xianhau, Yuen, Ling, & Lim, 2001). Some EPSs use the Certificate Authority (CA) model to fulfill the authentication, integrity, and nonrepudiation security schemes. However, each participant requires a digital certificate during the payment cycle. These certificates are issued by independent CAs but the implementation and maintenance cost of this model is very high. In addition, the validation steps of Certificate-based systems are very time-consuming processes. It requires access to an online certificate server during the payment process. Moreover, the certificate revocation list is a major disadvantage of the PKI-based certification model (The Internet Engineering Task Force). The cardholder’s certificate also includes some private information such as the cardholder’s name. The requirement of a cardholder’s certificate means software such as e-Wallet is required to be installed on the cardholder’s computer. It is the barrier for the cardholder to use Certificatebased payment systems. To solve this problem, Visa Company has developed a new payment system called Verified by Visa (VbV) (http:www/visa-asia.com/ ap/sea/merchants/productstech/vbv_implementvbv. shtml). However, sensitive information such as credit card number is still passed to the merchant. Therefore, the cardholder is not protected by the system.

Sign in / Sign up

Export Citation Format

Share Document