scholarly journals PARALLELIZATION OF RSA CRYPTOGRAPHIC ALGORITHM BASED ON CUDA TECHNOLOGIES

2021 ◽  
Vol 82 (2) ◽  
pp. 5-9
Author(s):  
Lesia Mochurad ◽  
◽  
Yurii Kryvenchuk ◽  
Svyatoslav Yatsyshyn ◽  
◽  
...  
Keyword(s):  
Numerical Experiments ◽  
Public Key ◽  
The Public ◽  
Average Value ◽  
Advantages And Disadvantages ◽  
Parallel Implementations ◽  
Cryptographic Algorithm ◽  
Cuda Technology ◽  
Encryption And Decryption ◽  
Sequential Implementation

The paper examines the efficiency of the application of CUDA technologies for the parallelization of the cryptographic algorithm with the public key. The speed of execution of several implementations of the algorithm is compared: sequential implementation on the CPU and two parallel implementations – on the CPU and GPU. A description of the public key algorithm is presented, as well as properties that allow it to be parallelized. The advantages and disadvantages of parallel implementations are analyzed. It is shown that each of them can be suitable for different scenarios. The software was developed and several numerical experiments were performed. The reliability of the obtained results of encryption and decryption is confirmed. To eliminate the influence of external factors at the time of execution the algorithm was tested ten times in a row and the average value was calculated. Acceleration coefficients for message encryption and decryption algorithms were estimated based on OpenMP and CUDA technology. The proposed approach focuses on the possibility of further optimization through the prospects of developing a multi-core architecture of computer systems and graphic processors.

scholarly journals Secure Transmission of Data through Electronic Devices using ECC Algorithm

2019 ◽  
pp. 130-135
Author(s):  
G. Banu Priya ◽  
K. Dharani
Keyword(s):  
Electronic Devices ◽  
Public Key ◽  
The Public ◽  
Cryptographic Algorithm ◽  
Private Data ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Cryptographic Keys ◽  
Symmetric Key ◽  
Secure Transmission

In recent days securing the data while transferring through electronic devices from one end to the other has became a challenging task to both sender and the receiver. During the transmission of private data over the electronic devices may be hacked some times by the hackers. The data can be secured by using the cryptographic concept. This paper is about how the data are protected while transferring the data from one electronics devices to another using the ECC algorithm. Cryptographic algorithms plays an important role in securing the data against malicious attacks. The main goal of cryptography is not only to secure data from being hacked or attacked also it can be used for authentication of users. There are two types of cryptographic algorithms namely Symmetric key cryptographic algorithms and Asymmetric key cryptographic algorithms. Symmetric key cryptographic algorithm uses the only one key for both encryption and decryption process, where as Asymmetric cryptographic algorithm uses two different keys for encrypting and decrypting the messages. The public key is made publicly available and can be used to encrypt messages. The private key is kept secret and can be used to decrypt the received messages. Nowadays, many electronic devices like electronic phones, tablets, personal computers are in the workplace for transferring the data. Elliptical curve cryptography (ECC) is a public key encryption technique based on elliptic curve theory that can be used to create privacy, integrity and confidentiality, faster, smaller, and more efficient cryptographic keys.

scholarly journals Implementation of Rivest Shamir Adleman Algorithm (RSA) and Vigenere Cipher In Web Based Information System

2018 ◽  
Vol 31 ◽  
pp. 10007 ◽  
Author(s):  
Aryanti Aryanti ◽  
Ikhthison Mekongga
Keyword(s):  
Data Security ◽  
Data Encryption ◽  
Public Key ◽  
Test Results ◽  
File Size ◽  
Web Based ◽  
The Public ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
The Moment

Data security and confidentiality is one of the most important aspects of information systems at the moment. One attempt to secure data such as by using cryptography. In this study developed a data security system by implementing the cryptography algorithm Rivest, Shamir Adleman (RSA) and Vigenere Cipher. The research was done by combining Rivest, Shamir Adleman (RSA) and Vigenere Cipher cryptographic algorithms to document file either word, excel, and pdf. This application includes the process of encryption and decryption of data, which is created by using PHP software and my SQL. Data encryption is done on the transmit side through RSA cryptographic calculations using the public key, then proceed with Vigenere Cipher algorithm which also uses public key. As for the stage of the decryption side received by using the Vigenere Cipher algorithm still use public key and then the RSA cryptographic algorithm using a private key. Test results show that the system can encrypt files, decrypt files and transmit files. Tests performed on the process of encryption and decryption of files with different file sizes, file size affects the process of encryption and decryption. The larger the file size the longer the process of encryption and decryption.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

scholarly journals Discrete Sliding Mode Control for Chaos Synchronization and Its Application to an Improved El-Gamal Cryptosystem

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 843 ◽  
Author(s):  
Pei-Yen Wan ◽  
Teh-Lu Liao ◽  
Jun-Juh Yan ◽  
Hsin-Han Tsai
Keyword(s):  
Chaos Synchronization ◽  
Sliding Mode ◽  
Encryption Algorithm ◽  
Public Key ◽  
Public And Private ◽  
The Public ◽  
Encryption And Decryption ◽  
Asymmetric Encryption ◽  
Improved Design ◽  
Discrete Sliding Mode Control

This paper is concerned with the design of an improved El-Gamal cryptosystem based on chaos synchronization. The El-Gamal cryptosystem is an asymmetric encryption algorithm that must use the public and private keys, respectively, in the encryption and decryption processes. However, in our design, the public key does not have to appear in the public channel. Therefore, this proposed improved El-Gamal cryptosystem becomes a symmetric-like encryption algorithm. First, a discrete sliding mode controller is proposed to ensure the synchronization of master and slave chaotic systems; next, a novel improved El-Gamal cryptosystem is presented. In the traditional El-Gamal cryptosystem, the public key is static and needs to be open which provides an opportunity to attack. However, in this improved design, due to the chaos synchronization, the public key becomes dynamic and does not appear in public channels. As a result, drawbacks of long cipher text and time-consuming calculation in the traditional El-Gamal cryptosystem are all removed. Finally, several performance tests and comparisons have shown the efficiency and security of the proposed algorithm.

Key Management

2011 ◽  
pp. 88-113
Author(s):  
Chuan-Kun Wu
Keyword(s):  
Secret Sharing ◽  
Key Management ◽  
Key Agreement ◽  
Public Key ◽  
Key Escrow ◽  
The Public ◽  
Cryptographic Algorithm ◽  
Diffie Hellman ◽  
Public Networks ◽  
Active Attacks

In secure communications, key management is not as simple as metal key management which is supposed to be in a key ring or simply put in a pocket. Suppose Alice wants to transmit some confidential information to Bob over the public networks such as the Internet, Alice could simply encrypt the message using a known cipher such as AES, and then transmit the ciphertext to Bob. However, in order to enable Bob to decrypt the ciphertext to get the original message, in traditional cipher system, Bob needs to have the encryption key. How to let Alice securely and efficiently transmit the encryption key to Bob is a problem of key management. An intuitive approach would be to use a secure channel for the key transmission; this worked in earlier years, but is not a desirable solution in today’s electronic world. Since the invention of public key cryptography, the key management problem with respect to secret key transmission has been solved, which can either employ the Diffie-Hellman key agreement scheme or to use a public key cryptographic algorithm to encrypt the encryption key (which is often known as a session key). This approach is secure against passive attacks, but is vulnerable against active attacks (more precisely the man-in-the-middle attacks). So there must be a way to authenticate the identity of the communication entities. This leads to public key management where the public key infrastructure (PKI) is a typical set of practical protocols, and there is also a set of international standards about PKI. With respect to private key management, it is to prevent keys to be lost or stolen. To prevent a key from being lost, one way is to use the secret sharing, and another is to use the key escrow technique. Both aspects have many research outcomes and practical solutions. With respect to keys being stolen, another practical solution is to use a password to encrypt the key. Hence, there are many password-based security protocols in different applications. This chapter presents a comprehensive description about how each aspect of the key management works. Topics on key management covered by this chapter include key agreement, group-based key agreement and key distribution, the PKI mechanisms, secret sharing, key escrow, password associated key management, and key management in PGP and UMTS systems.

scholarly journals Implementing RSA for Wireless Sensor Nodes

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 2864 ◽  
Author(s):  
Utku Gulen ◽  
Abdelrahman Alkhodary ◽  
Selcuk Baktir
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Public Key Cryptography ◽  
Sensor Nodes ◽  
Public Key ◽  
Wireless Sensor ◽  
Acceleration Techniques ◽  
Cryptographic Algorithm ◽  
Window Method ◽  
Encryption And Decryption

As wireless sensor networks (WSNs) become more widespread, potential attacks against them also increase and applying cryptography becomes inevitable to make secure WSN nodes. WSN nodes typically contain only a constrained microcontroller, such as MSP430, Atmega, etc., and running public key cryptography on these constrained devices is considered a challenge. Since WSN nodes are spread around in the field, the distribution of the shared private key, which is used in a symmetric key cryptographic algorithm for securing communications, is a problem. Thus, it is necessary to use public key cryptography to effectively solve the key distribution problem. The RSA cryptosystem, which requires at least a 1024-bit key, is the most widely used public key cryptographic algorithm. However, its large key size is considered a drawback for resource constrained microcontrollers. On the other hand, RSA allows for extremely fast digital signature generation which may make it desirable in applications where messages transmitted by sensor nodes need to be authenticated. Furthermore, for compatibility with an existing communication infrastructure, it may be desirable to adopt RSA in a WSN setting. With this work, we show that, in spite of its long key size, RSA is applicable for wireless sensor networks when optimized arithmetic, low-level coding and some acceleration algorithms are used. We pick three versions of the MSP430 microcontroller, which is used widely on wireless sensor network nodes, and implement 1024-bit RSA on them. Our implementation achieves 1024-bit RSA encryption and decryption operations on MSP430 in only 0 . 047 s and 1 . 14 s, respectively. In order to achieve these timings, we utilize several acceleration techniques, such as the subtractive Karatsuba-Ofman, Montgomery multiplication, operand scanning, Chinese remainder theorem and sliding window method. To the best of our knowledge, our timings for 1024-bit RSA encryption and decryption operations are the fastest reported timings in the literature for the MSP430 microcontroller.

scholarly journals Modified Key Generation in RSA Algorithm

2019 ◽  
Vol 8 (2) ◽  
pp. 5311-5315
Keyword(s):  
Public Key ◽  
Key Generation ◽  
The Public ◽  
Rsa Algorithm ◽  
Private Key ◽  
Asymmetric Cryptography ◽  
Encryption And Decryption

RSA Algorithm is one of the widely used asymmetric cryptography. But with several conducts of the different studies, factorization attack based on the value of modulo ‘n’ and based on the public key, the value of the private key is vulnerable. With this, the study modified the RSA Algorithm based on modulo and the public key. The modulo transformed into a new value that produced a compound result in the factorization process. At the same time, the public key has been modified by choosing randomly from collected values and transformed to a different value making it a better-hidden private key. The two algorithms compared in terms of factorization, encryption and decryption, and speed. The modification of the RSA Algorithm based on modulo and public key produced a new two-tier scheme in terms of factorization, and encryption and decryption process. The new scheme in the result is resistant to factorization and has a new scheme of private key hiding.

scholarly journals Quantum Key Distribution Based-on Refraction and Polarization Entanglement

2020 ◽  
Vol 8 (6) ◽  
pp. 2911-2918
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Public Key ◽  
Entangled State ◽  
Key Generation ◽  
Secret Key ◽  
The Public ◽  
Encryption And Decryption ◽  
Refraction Factor

Cryptography is the specialty of encoding and decoding messages and exists as extended as the individuals have doubted from one another and need secure correspondence. The traditional techniques for encryption naturally depend on any among public key or secret key approaches. In general, the public key encryption depends on two keys, for example, public key and private key. Since encryption and decryption keys are different, it isn't important to safely distribute a key. In this approach, the difficult of the numerical issues is assumed, not demonstrated. All the security will be easily compromised if proficient factoring algorithms are found. In secret key encryption two clients at first create secret key, which is a long string of arbitrarily selected bits and safely shares between them. At that point the clients can utilize the secret key along with the algorithms to encryption and decryption information. The procedures are complicated and also planned such a way that every bit of output is based on every bit of input. There are two fundamental issues with secret key encryption; first one is that by breaking down the openly known encoding algorithms, it gets simpler to decrypt the message. The subsequent one is that it experiences key-conveyance issue. As a result of the ongoing improvements in quantum processing and quantum data hypothesis, the quantum computers presents genuine difficulties to generally utilized current cryptographic strategy. The improvement of quantum cryptography beat the deficiencies of old style cryptography and achieves these huge accomplishments by using the properties of infinitesimal articles, for example, photon with its polarization and entangled state. In this paper, Polarization by refraction based quantum key distribution (PR-QKD) is proposed for quantum key generation and distribution. The proposed work considers three basis of polarization such as rectilinear (horizontal and vertical), circular (left-circular and right-circular), ellipse (left-ellipse and rightellipse) and refraction factor. This quantum key can be used for secure communication between two users who are spatially separated and also offer intrusion detection ability to detect attackers. The theoretical approach and conceptual results are discussed in this paper.

scholarly journals Comparative Analysis of RSA and ElGamal Cryptographic Public-key Algorithms

2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Comparative Analysis ◽  
Deterministic Algorithm ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Probabilistic Algorithm ◽  
Discrete Logarithms ◽  
The Public ◽  
Private Key ◽  
Encryption And Decryption

An asymmetric algorithm is an encryption technique that uses different keys on the process of encryption and decryption. This algorithm uses two keys, public key, and private key. The public key is publicly distributed while the private key is kept confidentially by the user and this key is required at the time of the decryption process. RSA and ElGamal are two algorithms that implement a public key cryptosystem. The strength of this algorithm lies in the bit length used. The degree of difficulty in RSA lies in the factorization of large primes while in ElGamal lies in the calculation of discrete logarithms. After testing, it is proven that RSA performs a faster encryption process than ElGamal. However, ElGamal decryption process is faster than RSA. Both of these algorithms are cryptographic public-key algorithms but have functions in different ways. RSA is a deterministic algorithm while ElGamal is a probabilistic algorithm.

scholarly journals IMPLEMENTATION OF THE RSA CRYPTOGRAPHIC ALGORITHM IN THE QR-CODE ANDROID-BASED BUILDING PERMIT CHECKING APPLICATION

2021 ◽  
Vol 15 (1) ◽  
pp. 74
Author(s):  
Darsanto Faiz ◽  
Rio Andriyat Krisdiawan ◽  
Dias Eka Prayuda
Keyword(s):  
Prime Numbers ◽  
Public Key ◽  
Qr Code ◽  
The Public ◽  
Building Permits ◽  
Rsa Algorithm ◽  
Building Permit ◽  
Cryptographic Algorithm ◽  
One Stop ◽  
Integrated Service

The investment office and one-stop integrated service (DPMPTSP) of Kuningan regency issues various kinds of permits, one of which is a building permit (IMB) issued by the investment office and one-stop integrated service on the applicant's side. Research is motivated by the vulnerability of counterfeiting permits that have been granted by the investment service and one-stop integrated services. The purpose of this research is to create a system or information technology that can help to make it easier to check building permits, one of which is by using QR-Code technology. This system can scan code that has been encrypted with the RSA algorithm so that the code created is not easily faked or read with similar applications. RSA Cryptography Algorithm, an algorithm used to encrypt and decrypt data. The RSA algorithm itself is an asymmetric algorithm, so it has a public key and a private key. RSA has a basic encryption and decryption process in the concepts of prime numbers and modulo arithmetic. The decryption and encryption keys are both integers. The encryption key is not kept secret and is known to the public so that the encryption key is also known as the public key, but the key for decryption is secret.Keywords: DPMPTSP, QR-Code, RSA Cryptrographic Algorithm

Sign in / Sign up

Export Citation Format

Share Document