Modified ElGamal Elliptic Curve Cryptosystem using Hexadecimal Representation (original) (raw)
Related papers
Implementation of Text Encryption using Elliptic Curve Cryptography
Procedia Computer Science, 2015
Elliptic Curve Cryptography has been a recent research area in the field of Cryptography. It provides higher level of security with lesser key size compared to other Cryptographic techniques. A new technique has been proposed in this paper where the classic technique of mapping the characters to affine points in the elliptic curve has been removed. The corresponding ASCII values of the plain text are paired up. The paired values serve as input for the Elliptic curve cryptography. This new technique avoids the costly operation of mapping and the need to share the common lookup table between the sender and the receiver. The algorithm is designed in such a way that it can be used to encrypt or decrypt any type of script with defined ASCII values.
An Enhanced Elliptic Curve Cryptosystem for Securing Data
International Journal of Computer Applications, 2018
The purpose of this research is to enhance the cryptographic system called the Elliptic Curve. Elliptic Curve cryptosystem (ECC) is a technique of public-key encryption, which is rooted on the arithmetical construction of elliptic curves over finite fields. Elliptic Curve Cryptographic System necessitates smaller keys compared to non-ECC cryptography to offer equal security. The security of RSA is based on the computational task of considering extensive numbers leading to an increase in encryption computation time, slower connection of the SSL handshake and increase in CPU usage during handshakes. Therefore, there should be a new way of solving this problem, which is ECC encryption. Elliptic curves are effective for digital signatures, key agreement, generators, pseudo-random and other related tasks. The first phase of the project involves understanding the key exchange of Diffie-Hellman and applying the properties of the Elliptic Curves. It is terminated with key facts that the Elliptic Curve Cryptography has a shorter key length, saves bandwidth, which facilitates key generation during the encryption/decryption of data, also the assurance of faster encryption and decryption, and notwithstanding its efficiency and efficacy in small devices.
A SURVEY OF ELLIPTIC CURVE CRYPTOGRAPHY USING CHARACTER CONVERSION METHOD
In the recent years, elliptic curve cryptography (ECC) has gained widespread exposure and acceptance and has already been include in many security standards. It is widely recognized that data security will play a central role in the design of future IT system. Elliptic key cryptography recently gained lot of attention in industries when we talk about security. This paper discusses the basic operation how ECC is more secure than other public key cryptosystems and also how security can be enhanced in ECC by using Character-Conversion-Method.
TELKOMNIKA (Telecommunication Computing Electronics and Control)
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.
TELKOMNIKA Telecommunication Computing Electronics and Control, 2018
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.
An implementation of ElGamal elliptic curves cryptosystems
Circuits and Systems, 1998. …, 1999
Concept of public key cryptography was first introduced by Difie and Hellman in 1976 which using discrete logarithm problem as base of dificulty. In 1985, T. ElGamal proposed public key cyptosystem scheme based on discrete logarithm problem. Elliptic curve cryptosystems were first proposed in 1985 independently by Neil Koblitz and Victor Miller. Elliptic curve cryptosystems are unique in using elliptic curve groups for arithmetic. This cryptosystem based on discrete logarithm problem in the group of points of an elliptic curve defined over a finite field. The discrete logarithm problem in an elliptic curve group appears to be much harder than the discrete logarithm problem in other groups. Hence elliptic curwes cyptosystem can match the security of other cryptosystems while wing smaller key. In this paper we will discuss a VLSI implementation of Elliptic Curves Cryptosystem for ElGamal encryption scheme.
Text Encryption with Improved Elliptic Curve Cryptography
Journal of Advances in Mathematics and Computer Science
The security of data encrypted with an encryption algorithm should be guaranteed such that it is never easy for a third party to recover the message from the encrypted data. To this effect, ECC has been a reliable option. However, the base equation that defines the security of Elliptic Curve Cryptography (ECC) is in the form of a linear equation with one unknown which is easy to solve. The ease with which this equation can be solved is a weak point in the algorithm. Thus, the aim of this research work is to improve the security of ECC by improving the nature of its base linear equation. Elliptic curve arithmetic was used to develop the improved model. The encryption process was specifically targeted and improved from single to double encryption using separate encryption constant for each round of encryption. Simulation was done using a 256 bits key size on selected number of character inputs. Java programming language was used to simulate the model on Net Beans IDE. Results of the r...
On Elliptic Curves Cryptography Council for Innovative Research INTRODUCTION
2013
Elliptic curve cryptography is an asymmetric key cryptography. The points on two dimensional elliptic curve are used for declaration of data encryption & decryption. It include public key generation on the elliptic curve and private key generation to decrypt the data. The present paper deals with an overview of Elliptic curve cryptography (ECC) and its implementation through coordinate geometry for data encryption. We introduce a new approach in the form of cardan's method to find points on X axis at elliptic curve over finite field and form public key cryptographic system and finally we define two dimensional alphabetic table and description in the form of algorithm to use it for plain text encryption.
A Detailed Study of Elliptic Curve Cryptography Algorithm and Its Performance.
International Journal of Engineering Sciences & Research Technology, 2013
In this paper, we propose a detailed study of Elliptic Curve Cryptography Algorithm and its performance..ECC can be used with fewer keys to give more security, high speed in a less bandwidth. While these advantages make ECC propose for mobile devices, they can provide computational burden on secure web servers. In resource constrained system, Elliptic Curve Cryptography is a promising alternative for public algorithms, because it provides similar level of security with proposed shorter keys than conventional integer based public key algorithm. ECC over binary field is taken up with special interest because the operation in binary filed operation, are thought to be more in space and efficient in time. However, the software implementation of ECC over binary field are still slow, especially on low end processors, which are used in small computing devices such as sensors node, mobile phone, etc. This proposed paper, studied the Cryptography algorithms and software implementation of ECC. Firstly, while implementing ECC with software, the choice of some architectural parameters like word size may affect the choice of algorithms or not, has been examined. Also, identification of software for low-end processors has been done. In addition, this paper has examined several implements to the instruction that architecture of an 8 bit processor and studied their impact on the performance of ECC with other algorithms. ECC is well is well suited for high speeds, lower power consumption, bandwidth savings, storage efficiencies, smaller certificates and it reduces computational time and also the amount of data transmitted and stored, and strong security for low-power devices in wireless networks.
IJERT-An Implementation Of Elliptic Curve Cryptography
International Journal of Engineering Research and Technology (IJERT), 2013
https://www.ijert.org/an-implementation-of-elliptic-curve-cryptography https://www.ijert.org/research/an-implementation-of-elliptic-curve-cryptography-IJERTV2IS1419.pdf The internet is slowly becoming an increasingly dangerous mode of communication for all forms of highly sensitive data. The increased dependency by individuals, institutions and corporations over the Internet to carry out critical business processes have provided a playing field for the intruders to carry out different attacks on the system and on the network. The security to critically confidential information such as personal identity information, credit card details, online transactions and e-commerce is the need of the hour which depends on top of cryptography. It is thought that RSA is a very secure cryptography algorithm and almost all software products provide advanced data encryption are designed over it. The bit length for RSA has increased over the years to make the encryption very tough, which increases the processing time and storage requirement is the real concern for today. The objective of this paper is to propose an alternative algorithm for cryptography based on mathematical objects known as elliptic curves. The proposed algorithms provide a better security with shorter bit length than RSA. Hence elliptic curve cryptography is the only solution today where better security can be achieved with a smaller key size thereby reducing the processing overhead.