Asymmetric Cryptographic Algorithms Research Articles

A Survey on Symmetric and Asymmetric Cryptography Algorithms in information Security

A Survey on Symmetric and Asymmetric Cryptography Algorithms in information Security

Secure Transmission of Data through Electronic Devices using ECC Algorithm

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.

Flexible Architectures for Cryptographic Algorithms — A Systematic Literature Review

Symmetric and asymmetric cryptographic algorithms are used for a secure transmission of data over an unsecured public channel. In order to use these algorithms in real-time applications, many flexible hardware architectures have been proposed and implemented with multiple design constraints. Therefore, a systematic study is required to analyze various implementation approaches. This paper has focused on the identification and classification of recent research practices pertaining to the flexible hardware implementation of cryptographic algorithms. We have used Systematic Literature Review (SLR) process to identify 51 research articles, published during 2008–2017. The identified researches have been classified according to three design approaches: (1) crypto processor, (2) crypto coprocessor and (3) multicore crypto processor. Consequently, a comparative analysis of various cryptographic algorithms in terms of flexibility, throughput, area, power and implementation technology has been presented. A comprehensive investigation of flexible architectures for implementing cryptographic algorithms facilitates researchers and designers of the domain to select an appropriate design approach for a particular algorithm and/or application according to their needs.

A novel accelerated implementation of RSA using parallel processing

Past research has evidently proved that public key cryptosystems are usually slower than symmetric key cryptosystems due to the reason that they use one additional cryptographic key and different methods for encryption and decryption. RSA is one of the most common asymmetric key cryptography algorithms. Recent research has focused on speeding up RSA using various techniques. With the introduction of distributed computing, parallelization of algorithms enables them to run on multiple cores concurrently at a time. RSA consists of two resource intensive operations namely Modular Exponentiation of up to 1024-bit exponents and repeated calculation of Greatest common divisor. Thus, RSA lays the perfect base for application of Montgomery Reduction algorithm to optimize the Repeated Modular multiplication in exponentiation. In this paper we proposed a parallel scheme for RSA using a new parallel data structure known as Concurrent Indexed List of character blocks. The aim of our research was to improve the speed of RSA encryption and decryption using parallelism and also make it compatible with leading industry cryptography standards. We have simulated four different approaches namely both parallel and sequential with and without Montgomery. We have also integrated our parallel paradigm with renowned C++ Crypto library and achieved a speed-up of upto four times than sequential approach. Unlike any other previous approaches, our implementation got easily integrated with any external library and thus can be adopted by any other algorithmic scheme.

High-speed devices for modular reduction with minimal hardware costs

Asymmetric cryptosystems have an important advantage over symmetric systems, since only the public key is transmitted. However, asymmetric cryptographic algorithms have a lower speed compared to sy...

A hybrid cryptosystem based on zig-zag algorithm and Rivest Shamir Adleman (RSA) algorithm

The security issue is one of the most critical aspects of the message. Cryptography is a science based on a mathematical technique for security-related information with confidentiality, data integrity, and authentication. A hybrid cryptosystem works by combining symmetric and asymmetric algorithms. The purpose of using zig – zag algorithm and RSA algorithm is to cover the weakness of symmetric and asymmetric algorithm. Zig-zag Cipher is one of the classical cryptographic algorithms that use the technique of transposition. The method of inversion is utilizing the character permutation. The RSA algorithm is an asymmetric cryptographic algorithm that has used most frequently, and this is due to the reliability. The length of RSA keys in bits can be set, with the longer the bits, the more difficult to solve because of the difficulty of factoring the two huge numbers, but this has an impact on the more extended the decryption process. This research used to encrypt the message by zig-zag algorithm while the RSA algorithm encrypts the key of the zig-zag algorithm. The results of this research are the bigger size of the file, then the higher the size of the ciphertext. Based on the graph of the plaintext length against the processing time obtained the results of the length of the plaintext is directly proportional to the time and form of the linear graph. Encryption and decryption processes require different time durations. The encryption process takes longer time than decryption process.

A hybrid cryptosystem approach for data security by using triple DES algorithm and ElGamal algorithm

The Internet is the communication path used in data exchange. Nevertheless, the delivery process is often experienced disturbance caused by outsiders who are not interested. In addressing the security disorder and abuse, then used cryptographic techniques. This research method using Hybrid cryptography with the aim to cover each other’s weaknesses between symmetric and asymmetric cryptographic algorithms. The algorithms used in this research is a symmetric algorithm Triple DES (Data Encryption Standard) and ElGamal asymmetric algorithms. Triple DES is the development of the algorithm DES. Triple DES needs three keys with the length of each 56 bits to perform encryption and decryption. Messages to be encrypted is a message that has the extension *.txt. ElGamal algorithm requires the public key, and private key, as well as the ElGamal algorithm, will also perform the encryption against key Triple DES. The public key used during encryption and private keys used during the process of decryption key Triple DES. As for the results of this research is the larger the size of the message then the longer time it takes to perform the Triple DES algorithm encryption and decryption. Time needed encryption algorithm Triple DES and ElGamal for longer than the time it takes to do the decryption. After the encryption process, the number of characters in the ElGamal algorithm becomes larger.

RESTRICTION OF UNAUTHORIZED ACCESS IN RADIO SYSTEMS WITH BROADCAST DATA TRANSMISSION

Introduction: The usage of broadcast radio systems is associated with the possibility of organizing continuous radio access zones with a limited number of transmission points and a considerable number of subscribers (information consumers). However, radio broadcasting systems have specific features of unauthorized access restriction related to the spatial electromagnetic accessibility of radio channels and the absence of a reverse information channel. Purpose: Developing principles for key information distribution and for the control over selective access of subscribers to the data transmitted in broadcast radio systems of various purposes, taking into account the restrictions imposed by the broadcasting mode of transmission. Method: Modification of the unauthorized access restriction methods used in radio broadcast systems, based on a combination of symmetric and asymmetric crypto algorithms. Results: The analysis of the existing approaches to unauthorized access restriction in broadcast radio systems has shown that the restrictions imposed by the peculiarities of these systems often make it difficult or impossible to apply various network protocols of protected data exchange commonly used in computer networks. We substantiate the principles (presence of two or more levels of key information; possibility to replace all the key information; ways to control the access to the system) and a way to restrict unauthorized access to the radio channels of broadcast systems, based on the combined use of symmetric and asymmetric crypto algorithms. As the symmetric part, you can use block or stream ciphers. As algorithms for the asymmetric part, elliptic curves are recommended, as they have the best cryptographic and speed characteristics as compared to other types of asymmetric cryptographic algorithms. Practical relevance: The proposed unauthorized access restriction method can be used to organize secure data exchange and selective control over the access to data transmitted in broadcast radio systems of various purposes.

Algorithms and Security Concern in Blockchain Technology: A Brief Review

The Blockchain is an ingenious and remarkable invention. This technology created the backbone of a new type of internet. It was originally designed for the digital currency, Bitcoin, in which you can send digital money to anyone, even a stranger. Originally, it transmits bitcoin. It is considered as a revolutionary technology. Blockchain helps in creating the record whose authenticity can be verified by the entire community. To make centralized and distributed systems it stores the data over a network of computers, which anyone can use this system, no central organization or person owns a system. It contains a number of blocks that contain data. The database of Blockchain is not stored at a single location, it is an open source database which can be accessed by anyone and it is easily verifiable. No one owns the blockchain technology. As the block chain’s nature is distributed, there must be a simple way by which all the nodes reach an agreement; Consensus agreement is a way by which all the participants agree on the contents of the blockchain. Here we will tell you about the basic principles and characteristics of the Consensus Algorithms so that you can decide which of the algorithm the best one to work with is. In this paper, we will research on the number of technical aspects of Blockchain technology, the pace in which this technology is booming and most importantly its implementation on the Bitcoin cryptocurrency which has totally revolutionized the financial infrastructure of the World. Along with this, we will also consider a number of security concerns, challenges and other technical vulnerabilities associated with the Bitcoin technology. The decentralized mechanism, distributed mechanism, scripted mechanism and the mechanism of the password related to Blockchain has opened a new view on the rapidly developing internet technology. There is no need for participants or any third party who are needed to be known to each other. The responsibility is included in the recording, transmission and the activities regarding transferring the storage by distributed technology. That is how the assurance is guaranteed by keeping these aloof from tampering and forged. With the assistance of asymmetric cryptographic algorithm, each and every participant can reach towards consensus on the information of the blockchain. The blockchain technology has the potential to play a key role in case of the information security technology. Hence, in this paper we will also cover the impact of blockchain will ensure the expansion in the sphere of information security.

Lifetime enhancement in wireless sensor networks using binary search tree based data aggregation

Energy efficient data aggregation is a key solution to enhance the lifetime of wireless sensor networks since sensor nodes are battery-powered and deployed in remote environments. This article explore a two-hop data aggregation tree construction algorithm using binary search tree to reduce the total energy consumption of sensor nodes in wireless sensor networks. An adaptive and hybrid routing algorithm for simultaneous data aggregation and exploit the data correlation between nodes using the two-hop data aggregation tree framework is proposed. Routes are chosen based on the shortest response time for the broadcasting request to minimize the total energy expended by the network. This paper also proposes a high secure asymmetric key cryptography algorithm to provide the secure data communication among the network. The data aggregation function that is used in the proposed routing algorithm enhances the lifetime of sensor network by resolving the delay, collision and security issues. Simulations results show that the binary tree based data aggregation can appreciably reduces the total energy consumption and resolves the maximum data aggregation issues in wireless sensor network.

Super-Encryption Cryptography with IDEA and WAKE Algorithm

The security and confidentiality of information becomes an important factor in communication, the use of cryptography can be a powerful way of securing the information, IDEA (International Data Encryption Algorithm) and WAKE (Word Auto Key Encryption) are some modern symmetric cryptography algorithms with encryption and decryption function are much faster than the asymmetric cryptographic algorithm, with the combination experiment IDEA and WAKE it probable to produce highly secret ciphertext and it hopes to take a very long time for cryptanalyst to decrypt the information without knowing the key of the encryption process.

Hybrid cryptosystem implementation using fast data encipherment algorithm (FEAL) and goldwasser-micali algorithm for file security

On the process of exchanging files, security is indispensable to avoid the theft of data. Cryptography is one of the sciences used to secure the data by way of encoding. Fast Data Encipherment Algorithm (FEAL) is a block cipher symmetric cryptographic algorithms. Therefore, the file which wants to protect is encrypted and decrypted using the algorithm FEAL. To optimize the security of the data, session key that is utilized in the algorithm FEAL encoded with the Goldwasser-Micali algorithm, which is an asymmetric cryptographic algorithm and using probabilistic concept. In the encryption process, the key was converted into binary form. The selection of values of x that randomly causes the results of the cipher key is different for each binary value. The concept of symmetry and asymmetry algorithm merger called Hybrid Cryptosystem. The use of the algorithm FEAL and Goldwasser-Micali can restore the message to its original form and the algorithm FEAL time required for encryption and decryption is directly proportional to the length of the message. However, on Goldwasser- Micali algorithm, the length of the message is not directly proportional to the time of encryption and decryption.

Combination of Rivest-Shamir-Adleman Algorithm and End of File Method for Data Security

Data security is one of the crucial issues in the delivery of information. One of the ways which used to secure the data is by encoding it into something else that is not comprehensible by human beings by using some crypto graphical techniques. The Rivest-Shamir-Adleman (RSA) cryptographic algorithm has been proven robust to secure messages. Since this algorithm uses two different keys (i.e., public key and private key) at the time of encryption and decryption, it is classified as asymmetric cryptography algorithm. Steganography is a method that is used to secure a message by inserting the bits of the message into a larger media such as an image. One of the known steganography methods is End of File (EoF). In this research, the cipher text resulted from the RSA algorithm is compiled into an array form and appended to the end of the image. The result of the EoF is the image which has a line with black gradations under it. This line contains the secret message. This combination of cryptography and steganography in securing the message is expected to increase the security of the message, since the message encryption technique (RSA) is mixed with the data hiding technique (EoF).

Efficiency of 128-bit Encryption and Decryption Process in Elgamal Method Using Elliptic Curve Cryptography (ECC)

Cryptography is a growing science of data security. The integrity of a data is an important thing to keep the secrets contained in the data. In this research will be visualized the efficient quantities that use elliptic curves and do not use them. The Elgamal method is an asymmetric cryptographic algorithm whose complexity of processes. It is especially for digital signatures. This research will discuss about the use of ECC to optimize and streamline the Encryption and Decryption process in particular 128-bit Elgamal method. The hope is that by using elliptic curves the timing of the encryption and decryption process can run faster in the computation of Elgamal Method.

Improvement of the quadratic sieve method on the basis of the extended factor base and using available quantity of B – smooth numbers

In information and telecommunication systems, RSA algorithms are often used to solve information security problems. At the core of the cryptostability of the most popular today asymmetric cryptographic algorithm RSA is the complexity of the factorization of large integers. Quadratic sieve method is the best for factorization of integers under 110 decimal digits or so. The most time consuming part of the algorithm of a quadratic sieve is the sieving process. The size of the factor base is one of the key parameters that determine the effectiveness of the sieving algorithm. Too large factor base requires the search for a large number of B–smooth numbers, which increases the total execution time of the algorithm. When the size is less than necessary, it will not be possible to find a sufficient number of B–smooth numbers. In this paper, the method for determining and applying a sufficient size of B–smooth numbers with doubling the factor base size in comparison with the basic algorithm of a quadratic sieve is proposed. With the expansion of the factor base, the number of N numbers increases, which can be decomposed into factors by the quadratic sieve method. It is also noted that its increase leads to an increase in computational complexity, since it is advisable to find a greater number of B–smooth numbers. However, when conducting numerical experiments, where the size of the factor base increased twice, it turned out that using the proposed algorithm, the time necessary to find a sufficient number of B-smooth numbers, on the contrary, decreased.

FPGA based asymmetric crypto system design

In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypting the encrypted message. Asymmetric algorithms are more secure and difficult, to decrypt the message unless hacker acquires the knowledge of private key. A new Asymmetric algorithm with Error Detection and Correction mechanism is proposed that can reduce hardware, and improves decryption time and security. Proposed Asymmetric algorithm uses the few properties of: RSA, Diffie-Hellman and ElGamal Algorithms. Performance of asymmetric algorithms is compared with proposed algorithm, which is designed using Verilog HDL. Algorithms are synthesized, simulated, implemented using Vivado and targeted for Artix-7 XC7A100T-1CSG324Carchitecture.Chipscope Pro logic analyzer-Virtual Input Output core is binded to design for hardware debugging, to monitor and capture the output signals at selected specified state by applying random input stimuli at runtime in Nexys4 DDR FPGA Board.

A Proposal of Loose Asymmetric Cryptography Algorithm

Although traditional asymmetric algorithm along with its implementations are successful in keeping important documents confidential, it uses only one private key. This research proposes the loose asymmetric (LA) algorithm to satisfy requirement of generating many access keys. Each access key is granted to only one user. This demand is real because a group of members needs to retrieve same documents but each member requires confidentiality in access. Because implementation of LA algorithm is complicated, I also propose two schemes of how to deploy LA algorithm. The research is a proposal because I do not make experiment on LA algorithm yet.

Light Weight Asymmetric Cryptographic Algorithm for Financial Transactions through Mobile Application

Light Weight Asymmetric Cryptographic Algorithm for Financial Transactions through Mobile Application

Aplikasi Pengamanan Data Gambar Dengan Menerapkan Algoritma Vigenere Chiper

The security and confidentiality of data is very important considering the rapid development of technology at this time which allows the emergence of new techniques that are misused by certain parties that can threaten security from data that are considered insignificant.
 Cryptography is a field of science to maintain image security. Cryptography has been implemented in many ways. The way it works is to change the original data that can be understood / read by humans (plaintext) to other forms that cannot be understood / read by humans (ciphertext). The process of transforming plaintext into chiperteks is termed encryption. While the process of returning a chipertext message to plaintext is termed decryption.
 Vigenere Cipher is an asymmetric cryptographic algorithm, where the key used to encrypt is different from the one used to decrypt. Vigenere Cipher is a cryptographic algorithm that uses letters and numeric values. Vigenere Cipher requires three steps in the process, namely key generation, encryption, and decryption. The process of encryption and decryption is almost the same process.

Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

SummarySensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most‐heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for 6.25% of the scalars. This gain can sometimes reach 100% in some cases. After this significant reduction of the scalar k, we present a fast precomputation algorithm in a distributed scalar multiplication on kP to avoid storage of precomputation points, which requires extra memory.