ElGamal cryptosystem with embedded compression-crypto technique

International Journal of Computing and Engineering

Purpose: In this research, a comparative analysis of the RSA and ELGAMAL algorithms is presented using their encryption and decryption speed with different key sizes. ElGamal and RSA are two popular public-key cryptographic algorithms that depend on the mathematical difficulty of computing discrete logarithms in finite fields and factoring large integers, respectively. Methodology: In this study, the speed at which messages of various sizes can be encrypted and decrypted using various key sizes is used to gauge how well these algorithms work. Findings: RSA usually outperforms ElGamal in terms of encryption and decryption speed, according to the results. However, as the key sizes grow, the performance gap between the two algorithms narrows. Unique Contribution to Theory, Policy and Practice: These findings can aid in selecting the appropriate algorithm and key size for different applications that require secure communication and data encryption.

International Journal of Computer Applications, 2020

An increase in network technology development has its own downside; thus as more connections are established with various global computer networks daily, the more exposed the connected systems are to unauthorized access, thus making security of data very important to address. Internet based transaction applications such as internet banking, online shopping, etc., involves sharing of very sensitive information between two or more parties that should be confidential. This requires very secure end-to-end connections that will ensure the data integrity, confidentiality, authenticity, etc. Cryptography is one of the most reliable and best, if not the best way to keep sensitive data from unauthorized users. This implies a good cryptosystem that maximizes security of the information been transferred and minimizes a substantial amount of delay time is needed. This is dependent on the particular cryptosystem one chooses to secure information. Also of the two known types of cryptosystems, the best in security is asymmetric cryptosystems, which uses two different keys; one for encryption and the other for decryption, whiles symmetric cryptosystems use the same key for both encryption and decryption. The essential features of asymmetric cryptosystems that determines their efficiency and security are; encryption computation time, decryption computation time, performance, encryption throughput, decryption throughput, throughput, randomness, key length and Operation per Instruction (O/I). This research seeks to examine these properties of some asymmetric cryptosystems and subsequently develop a proposed cryptosystem that is more secure and efficient. The results of this research clearly demonstrate that, the proposed cryptosystem has better results for all the properties stated above.

Technical Report of National Institute of Science and Technology (NIST), India, Summer Research Program, 2013 , 2013

To overcome the problems faced in symmetric key algorithms, people have chosen Asymmetric Key algorithms for communication. Communication with Asymmetric algorithms will give us transmission of information without exchanging the key. Public-key cryptography refers to a cryptographic system requiring two separate keys, one of which is secret and one of which is public. Public-key cryptography is widely used. It is an approach used by many cryptographic algorithms and cryptosystems. It underpins such Internet standards as Transport Layer Security (TLS), PGP, and GPG. RSA and Diffie–Hellman key exchange are the most widely used public key distribution systems, while the Digital Signature Algorithm is the most widely used digital signature system. In this report we are mainly concentrating on some asymmetric algorithms which are mostly used. They are RSA cryptosystem and ElGamal Cryptosystem. It also gives brief mathematical explanations. The RSA algorithm is the most commonly used encryption and authentication algorithm and is included as part of the Web browsers from Microsoft and Netscape.RSA is an algorithm for public-key cryptography that is based on the presumed difficulty of factoring large integers, the factoring problem.. The RSA algorithm involves three steps: key generation, encryption and decryption. In this we mainly concentrate on algorithms for Primality Testing, Extended Euclidian’s algorithm, Modular Exponentiation solving algorithm, etc. ElGamal System is a public-key cryptosystem based on the discrete logarithm problem. It consists of both encryption and Signature algorithms. ElGamal encryption is used in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. ElGamal encryption consists of three components: the key generator, the encryption algorithm, and the decryption algorithm. In this we concentrate on the algorithms Cyclic Groups, Modular Exponentiation solving algorithms etc.

2013

Rivest-Shamir-Adleman (RSA) cryptosystem is a well known asymmetric cryptosystem and it has been applied in a very wide area. Many researches with different approaches have been carried out in order to improve the security and performance of RSA cryptosystem. The enhancement of the performance of RSA cryptosystem is our main interest. In this paper, we propose a new method to increase the efficiency of RSA by shortening the number of plaintext before it goes under encryption process without affecting the original content of the plaintext. Concept of simple Continued Fraction and the new special relationship between it and Euclidean Algorithm have been applied on this newly proposed method. By reducing the number of plaintext-ciphertext, the encryption-decryption processes of a secret message can be accelerated.

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.

Indian Journal of Science and Technology, 2015

Data encryption is an important issue and widely used in recent times to protect the data over internet and ensure security. One of the mostly used in public key cryptographies is the Elliptic Curve Cryptography (ECC). A new modified method has been proposed to encrypt / decrypt data using ECC in this paper. This modification converts each character of the plaintext message to its hexadecimal ASCII value of two digits, then separates the value into two values. After that, the transformation is performed on each value into an affine point on the Elliptic Curve E. This transformation is used to modify ElGamal Elliptic Curve Cryptosystem (EGECC) to encrypt / decrypt the message. In modified method, the number of doubling and adding operations in the encryption process has been reduced. The reduction of this number is a key point in the transformation of each character into an affine point on the EC. In other words, the modified method improved the efficiency of the EGECC algorithm. Moreover, using the hexadecimal ASCII value makes EGECC more secure and complicated to resist the adversaries.

Journal of Discrete Mathematical Sciences and Cryptography

The ElGamal cryptosystem is one of the most widely used public-key cryptosystems that depends on the difficulty of computing the discrete logarithms over finite fields. Over the years, the original system has been modified and altered in order to achieve a higher security and efficiency. In this paper, a generalization for the original ElGamal system is proposed which also relies on the discrete logarithm problem. The encryption process of the scheme is improved such that it depends on the prime factorization of the plaintext. Modular exponentiation is taken twice during the encryption; once with the number of distinct prime factors of the plaintext and then with the secret encryption key. If the plaintext consists of only one distinct prime factor, then the new method is similar to that of the basic ElGamal algorithm. The proposed system preserves the immunity against the Chosen Plaintext Attack (CPA).

Third International Conference on Control, Automation and Systems Engineering (CASE 2013)

Abstract— Smart Computing provides ease of use in term of mobility in the low power computing devices such as smartphone, tablet and experimental board (e.g. RaspberryPi). Low power constraint and low computation capability require a lightweight security system and networking protocol. This paper presents an analysis of ElGamal encryption system for securing data communication through the computer. The objectives of this paper are to study ElGamal algorithm in 32-bit integer computation and to implement data encryption using the ElGamal algorithm using 32-bit integers. ElGamal is a continuation of Diffie-Hellman key exchange algorithm. However, ElGamal encryption system uses asymmetric key encryption and decryption. ElGamal uses a public key to encrypt and private a key to decrypt messages where private key and public key are different. An experiment was conducted to evaluate the maximum number of integers that can be computed in 32 bit computer system using standard 32 bit GCC compiler in Debian 6. Furthermore, an exploration of computing capabilities and performance measurement of the ElGamal algorithm using C language is presented in this paper.

International Journal of Information and Communication Technology, 2018

In this paper, we propose a new and practical variant of ElGamal encryption which is secure against every passive and active adversary. Under the hardiness of the decisional Diffie-Hellman assumption, we can prove that the proposed scheme is secure against an adaptive chosen ciphertext attacks in the standard model. Such security verifies not only the confidentiality but also verifies the integrity and the authentication of communications. We display that the modified scheme furthermore achieves anonymity as well as strong robustness.

2017

Data security is of utmost importance in today’s world. Especially when the data is travelling through an insecure communication network. Cryptography addresses the necessary elements for secure communication such as privacy, confidentiality, key exchange, authentication and non-repudiation. There are symmetric key encryption techniques which use only one key for both encryption and decryption of the data. . On the other hand, there are asymmetric key based algorithms which use a pair of keys, one for encryption, and the other for decryption, whose security is higher as compared to the symmetric. In this paper a hybrid asymmetric cryptosystem algorithm will be implemented which combine the methods RSA and El-gamal. The hybrid cryptosystem that improve the security and performance will be based on encryption time , decryption time and throughput.

2015

Cryptography is generated to create secure data transmission over networks. The algorithm chosen for cryptography should satisfy the conditions of authentication, confidentiality, integrity and non-repudiation. Recent years have witnessed the phenomenal growth of RSA. We design an algorithm to merge both enhanced RSA algorithm and El-Gamal algorithm to provide user with a higher level of data security. The enhanced RSA algorithm enables faster encryption and decryption process and generating public and private key faster than the original RSA. The Enhanced RSA Cryptosystem is based on Integer Factorization Problem (IFP), while the El-Gamal Cryptosystem is based on Discrete Logarithm Problem (DLP). This model works on the basis of combining IFP and DLP. The weaknesses of RSA algorithm when we use two prime‟s number are the following points which are used to break the algorithm in most cases. These weaknesses are: (a) Small encryption exponent, if you use a small exponent like e=3 and...

2009

Due to more overhead of asymmetric cryptosystems, traditionally, the symmetric cryptosystem is used to encrypt long messages. In case of symmetric cryptosystems, it creates the problem of key management. So to encrypt long messages, we usually, take the help of both symmetric and asymmetric cryptosystems. In this paper, we proposed an asymmetric cryptosystem for encrypting long messages, which is not only efficient but also secure. In consideration of the aspect of efficiency and computation, our proposed scheme uses elliptic curve cryptosystem.

Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

ElGamal public key encryption scheme has been designed in the 80's. It is one of the first partial homomorphic encryption and one of the first IND-CPA probabilistic public key encryption scheme. A linear version has been recently proposed by Boneh et al. In this paper, we present a linear encryption based on a generalized version of ElGamal encryption scheme. We prove that our scheme is IND-CPA secure under linear assumption. We design a generalized ElGamal scheme from the generalized linear. We also run an evaluation of performances of our scheme. We show that the decryption algorithm is slightly faster than the existing versions.

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.

Indian Journal of Computer Science and Engineering

ElGamal algorithm is public key cryptosystem and a signature scheme in the speed of the procedures for generating and verifying signatures. An implementation of ElGamal scheme for Laplace Transform Cryptosystem is proposed and it is executed using a .NET program. The time analysis is, compared with existing algorithms. The comparison reveals that the proposed cryptosystem enhances the data security and password security. The statistical tools are use for the planned scheme and accessible algorithms. They are, analyzed graphically.