ElGamal Research Articles

Forward and backward secure updatable ElGamal encryption scheme for cloud storage

Updatable encryption can support key/ciphertext update functionality, resist key compromise attacks, and be applicable to cloud storage. However, as a type of partitioning strategy, leakage sets or firewalls technique has been adopted by the existing updatable encryption schemes to build a relaxed security model, which forbids the adversary from querying the secret key at the challenge-equal epochs and hardly captures forward and backward security. In this paper, an enhanced security model can be built by considering a corruption oracle that allows any secret key query without requiring leakage sets. Then we utilize the indistinguishability obfuscation technique of the punctured program to construct an updatable ElGamal encryption scheme with no-directional key update and uni-directional ciphertext update. Furthermore, under the framework of the enhanced security model, the proposed scheme is proven to be IND-CPA. Finally, by comparison with the existing updatable encryption schemes, the proposed scheme eliminates leakage sets and firewalls, and can achieve both forward and backward security.

Superencryption of BASE 64 Algorithm and ELGAMAL Algorithm on Android Based Image Security

In the current era of globalization, the development of information technology is growing rapidly, there is a possibility that there will be data leaks when the process of exchanging information is carried out, then security becomes a very important aspect which will cause unwanted things, for example manipulation of images in the form of information systems. If this important information falls into the hands of the wrong person, it can be negative and can be detrimental to the image owner. So a security system is designed that functions to protect the data that is sent while maintaining its authenticity and authenticity. Various ways have been developed for data security, one of which is by using cryptography. Cryptography is the science of securing data by using data transformation so that the resulting data cannot be understood by other parties. This transformation can provide a solution to two data security problems, namely the problem of privacy and data authentication. Cryptographic techniques can be used to ensure data security, one of which can be utilized is encryption and description of data or in other words encoding data so that only the person concerned can understand the contents of the data. The proper use of information technology is very important to send private and confidential images to certain parties. These images are still in the form of PNG and JPG extensions, for this reason a security system is needed that can protect images that are transmitted through a communication network, one way that can be done to secure images is using the BASE 64 algorithm and the ELGAMAL algorithm.

Optimal ElGamal Encryption with Hybrid Deep-Learning-Based Classification on Secure Internet of Things Environment.

The Internet of Things (IoT) is a kind of advanced information technology that has grabbed the attention of society. Stimulators and sensors were generally known as smart devices in this ecosystem. In parallel, IoT security provides new challenges. Internet connection and the possibility of communication with smart gadgets cause gadgets to indulge in human life. Thus, safety is essential in devising IoT. IoT contains three notable features: intelligent processing, overall perception, and reliable transmission. Due to the IoT span, the security of transmitting data becomes a crucial factor for system security. This study designs a slime mold optimization with ElGamal Encryption with a Hybrid Deep-Learning-Based Classification (SMOEGE-HDL) model in an IoT environment. The proposed SMOEGE-HDL model mainly encompasses two major processes, namely data encryption and data classification. At the initial stage, the SMOEGE technique is applied to encrypt the data in an IoT environment. For optimal key generation in the EGE technique, the SMO algorithm has been utilized. Next, in the later stage, the HDL model is utilized to carry out the classification process. In order to boost the classification performance of the HDL model, the Nadam optimizer is utilized in this study. The experimental validation of the SMOEGE-HDL approach is performed, and the outcomes are inspected under distinct aspects. The proposed approach offers the following scores: 98.50% for specificity, 98.75% for precision, 98.30% for recall, 98.50% for accuracy, and 98.25% for F1-score. This comparative study demonstrated the enhanced performance of the SMOEGE-HDL technique compared to existing techniques.

Performance Analysis of Two Famous Cryptographic Algorithms on Mixed Data

The rapid development of digital data sharing has made information security a crucial concern in data communication. The information security system heavily relies on encryption methods. These algorithms employ strategies to increase data secrecy and privacy by obscuring the information, which only those parties who have the accompanying key can decode or decrypt. Nevertheless, these methods also use a lot of computational resources, including battery life, memory, and CPU time. So, to determine the optimal algorithm to utilize moving forward, it is necessary to assess the performance of various cryptographic algorithms. Therefore, this study evaluates two well-known cryptographies (RSA and ElGamal) using mixed data such as binary, text, and image files. CPU internal clock was used to obtain the time complexity used by both algorithms during encryption and decryption. The algorithms used CPU internal memory to obtain memory usage during the encryption and decryption of mixed data. Evaluation criteria such as encryption time, decryption time, and throughput were used to compare these encryption algorithms. The response time, confidentiality, bandwidth, and integrity are all factors in the cryptography approach. The results revealed that RSA is a time-efficient and resourceful model, while the ElGamal algorithm is a memory-efficient and resourceful model.

A Comparative Study of RSA and ELGAMAL Cryptosystems

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.

On the (In)Security of ElGamal in OpenPGP

Roughly four decades ago, Taher ElGamal put forward what is today one of the most widely known and best understood public key encryption schemes. ElGamal encryption has been used in many different contexts, chiefly among them by the OpenPGP email encryption standard. Despite its simplicity, or perhaps because of it, in reality there is a large degree of ambiguity on several key aspects of the cipher. Each library in the OpenPGP ecosystem seems to have implemented a slightly different "flavor" of ElGamal encryption. While-taken in isolation-each implementation may be secure, we reveal that in the interoperable world of OpenPGP, unforeseen cross-configuration attacks become possible. Concretely, we propose different such attacks and show their practical efficacy by recovering plaintexts and even secret keys.

Secure Role Based Access Control Data Sharing Approach and Cloud Environment

the primary objective of cloud storage is to maintain data integrity, which involves implementing measures to prevent unauthorized access and ensuring that data can be regenerated if mishandled. To achieve this, a proxy server will be assigned the task of protecting and restoring data in case of unauthorized modifications. Users' data will be stored in both public and private areas of the cloud, with only public data being accessible to users and private data being kept more secure. Cloud storage offers users various redundancy configurations to balance performance and fault tolerance, with data availability being critical in distributed storage systems, especially when node failures are common in real-life scenarios. In this research, a proposed aes 128 encryption algorithm and role-based access control (rbac) scheme are explored to provide secure data storage and sharing, as well as a secure user access policy. Additionally, a backup server approach is used as a proxy storage server for ad hoc data recovery for all distributed data servers. The experiment's analysis is proposed in both public and private cloud environments, utilizing keywords such as rbac, elgamal encryption scheme, proxy key generation, advanced encryption standard (aes), and more

A Novel Digital Signature Scheme for Advanced Asymmetric Encryption Techniques

Digital signature schemes are practical mechanisms for achieving message integrity, authenticity, and non-repudiation. Several asymmetric encryption techniques have been proposed in the literature, each with its proper limitations. RSA and El Gamal prove their robustness, but are unsuitable in several domains due to their computational complexity. Other asymmetric encryption schemes have been proposed to provide a cloud homomorphic encryption service, where the researchers focused only on how to ensure the homomorphic property. This paper proposes a new digital signature scheme dedicated to a family of encryption techniques. The proposal consists of two parts: the first focused on the secret key, and the second focused on the public key. Signature validity checking was performed by multiplying these two parts to reform again the sender’s public key, then comparing the result with the decrypted message. The validation of the decrypted message guarantees data integrity, where the signer public key is used to ensure authenticity. The proposed scheme takes a shorter execution time for the entire signature operation, including signing and verification, compared to other modern techniques. The analysis showed its robustness against private key recovery and forgery attacks. The implementation results of the proposed scheme showed promising performance in terms of complexity and robustness. The results confirmed that the proposed scheme is efficient and effective for signature generation and verification.

On A Novel Security Scheme for The Encryption and Decryption Of 2×2 Fuzzy Matrices with Rational Entries Based on The Algebra of Neutrosophic Integers and El-Gamal Crypto-System

On A Novel Security Scheme for The Encryption and Decryption Of 2×2 Fuzzy Matrices with Rational Entries Based on The Algebra of Neutrosophic Integers and El-Gamal Crypto-System

Performance Comparison between RSA and El-Gamal Algorithms for Speech Data Encryption and Decryption

This article presents a performance comparison of two known public key cryptography techniques namely RSA (Rivest–Shamir–Adleman) and El-Gamal algorithms to encrypt/decrypt the speech signals during transferring over open networks. Specifically, this work is divided into two stages. The first stage is enciphering-deciphering the input speech file by employing the RSA method. The second stage is enciphering-deciphering the same input speech file by employing the El-Gamal method. Then, a comparative analysis is performed to test the performance of both cryptosystems using diverse experimental and statistical analyses for the ciphering and deciphering procedures like some known speech quality measures: histogram, spectrogram, correlation, differential, speed performance and noise effect analyses. The analyses outcomes reveal that the RSA and El-Gamal approaches are efficient and adequate for providing high degree of security, confidentiality and reliability. Additionally, the outcomes indicate that the RSA speech cryptosystem outperforms its counterpart the El-Gamal speech cryptosystem in most of ciphering/deciphering speech performance metrics.

DEVELOPMENT OF HYBRID ENCRYPTION METHOD USING AFFINE CIPHER, VIGENERE CIPHER, AND ELGAMAL ALGORITHM TO SECURE TEXT MESSAGES IN DATA COMMUNICATION SYSTEM

With the development of technological advances in this day and age, it definitely requires a security system on messages and data. The way to maintain the security of data, messages or information requires a branch of science in its application, one of which is the algorithm or cryptography method. In its application, it requires more than one stage of the security process, because data security can be done by combining methods in its security techniques. This research aims to develop encryption methods using Affine Cipher, Vigenere Cipher, and ElGamal Algorithm to secure text messages. Affine cipher, Vigenere cipher and ElGamal are cryptography that can encrypt and decrypt text messages. Encryption is changing the message or plaintext into an unreadable message or ciphertext, on the other hand, decryption changes the ciphertext or message that initially cannot be read into a message that can be read or plaintext back in its original form. The result of this research is the development stage by doing three encryption and decryption processes. For the first encryption process using Affine Chiper which produces the initial ciphertext, then re-encrypted using Vigenere Cipher, then the previous encryption results are carried out ElGamal encryption which produces the final ciphertext. Conversely, the decryption process is first on ElGamal, then Vigenere Cipher, and finally Affine Cipher whose decryption results in plaintext back in the form of the initial text message. So that by developing and combining three algorithm methods can increase the security of information and text messages.

An optimal and efficient data security technique through crypto-stegano for E-commerce.

E-Commerce or Electronic commerce is the buying and selling of goods and services in which any commercial transactions through wireless electronic devices such as hand-held computers (tablets), mobile phones or laptops is conducted anytime & anywhere via Internet technology. But, E-Commerce transactions or services are suffered by many attacks such as Man in the Middle attack, eavesdropping attacks, and etc. due to the lack of secured security infrastructure. Here, data security is one of the ways to keep the confidential information secure through E-Commerce transactions. In this connection, we have proposed an optimal and efficient data security with the combination of Elgamal cryptosystem and LSB image steganography technique for E-Commerce. In our proposed work, at the merchant side, Elgamal encryption technique is used to protect sensitive information during E-Commerce transactions from intruders and LSB image steganography process is also applied to hide generated Elgamal encrypted data and produce a stego-image (steganography image). Then, DCT (Discrete Cosine Transform) technique through autoencoder is imposed on stego-image to make an optimal image to increase the throughput of the work. After that, the produced optimal image with cipher text is sent to the customer end. At the customer end, first, stego-image is extracted from the optimal image using LSB retrieval process. Then, Elgamal decryption process is used to retrieve the original data and secure the E-Commerce transactions in efficiently. Based on the experiment, we have plotted the performance metrics such as MSE, PSNR and SSIM on the work and entropy of the optimal image is also calculated with respect to the sample image. Thereby, a high level performance metrics is obtained in our proposed work.

Comparative Analysis of Ciphertext Enlargement on Generalization of the ElGamal and Multi-factor RSA

Information and communication security has become more crucial and has become a new problem in relation to security, accessibility, data management, and other information policy challenges as a result of how easy it is for all users to use communication media. One of the fields of science that has a technique or art for disguising the data sent by the sender to the recipient with the aim of maintaining the confidentiality of the data is called cryptography. In determining better cryptographic algorithms for data security systems, in addition to considering strength, key length and ciphertext enlargement are also important factors to consider. Therefore, in this study, we attempted to compare the ciphertext magnification of the generalization of the ElGamal and multi-factor RSA algorithms by utilizing the same key length. Generalization of the ElGamal and Multi-factor RSA are both asymmetric algorithms that have public and private key pairs for encryption and decryption. However, at the level of security, the RSA algorithm is based on the difficulty of finding large integer factors into two prime factors. In contrast to the ElGamal algorithm, security is based on the difficulty of calculating the discrete logarithm of a large prime modulus. The results of the comparison algorithm carried out are represented in the form of a table containing the plaintext, key length, and size of the data.

Distributed auditing protocol for untraceable transactions

Data integrity is a property that cloud service providers (CSPs) have focused on. The data integrity checking is assigned to third-party auditors (TPAs) to avoid invalid data storage in CSPs. Nevertheless, this type of mechanism is vulnerable to many threats, including insider/outsider adversaries. Moreover, several threats still exist with its presence, such as deleting, changing, or destroying the recorded data. The study presents a blockchain-based distributed auditing (BB-DA) protocol for auditing confidential/untraceable transactions in a distributed manner. The BB-DA protocol provides message/transaction confidentiality, user privacy, and security against privileged insider adversaries, who want to create disorder in the auditing process by refusing to sign/audit, and those who aim to do so in the BB-DA protocol will fail even if they cooperate. To provide message confidentiality and security against malicious insiders, the ElGamal cryptosystem is used in the BB-DA protocol, and to avoid destroying the submitted data (transactions) by CSPs, the blockchain is used as a distributed and immutable database in the BB-DA protocol. The Zerocoin is applied in the BB-DA protocol for providing user untraceability and anonymity. The security analysis of the BB-DA protocol proves that the offered protocol is secure against the key-only, known message, and chosen message attacks. Additionally, the analysis indicates that it provides security against malicious insiders who want to learn any knowledge about corresponded transactions or break users’ anonymity. The paper’s comparison and evaluation show that the BB-DA offers more features and is more efficient than other auditing protocols.

Privacy-Preserving Data Aggregation with Dynamic Billing in Fog-Based Smart Grid

As the next-generation grid, the smart grid (SG) can significantly enhance the reliability, flexibility as well as efficiency of electricity services. To address latency and bandwidth issues during data analysis, there have been attempts to introduce fog computing (FC) in SG. However, fog computing-based smart grid (FCSG) face serious challenges in security and privacy. In this paper, we propose a privacy-preserving data aggregation scheme that supports dynamic billing and arbitration, named PPDB. Specifically, we design a four-layer data aggregation framework which uses fog nodes (FNs) to collect and aggregate electricity consumption data encrypted under the ElGamal cryptosystem and employ distributed decryption to achieve fine-grained access and bills generation based on real-time prices. In addition, we introduce a trusted third party to arbitrate disputed bills. Detailed security analysis proves that the proposed PPDB can guarantee the confidentiality, authentication and integrity of data. Compared with related schemes, the experimental results show that the communication overhead of our scheme is reduced by at least 38%, and the computational efficiency in the billing phase is improved by at least 40 times.

On a Novel Security Algorithm for the Encryption of 3×3 Fuzzy Matrices with Rational Entries Based on The Symbolic 2-Plithogenic Integers and El-Gamal Algorithm

Mathematical cryptography applies special properties of integers and number theory in encrypting and decrypting messages in our world which is increasingly in demand for information security, especially for social media and multimedia. The objective of this work is to generalize El-Gamal crypto algorithm to be applied by using symbolic 2-plithogenic integers instead of classical integers. Also, we apply the novel algorithm to the encryption and the decryption of square fuzzy matrices with rational entries, and fuzzy relations which can be represented as fuzzy matrices with rational entries. In addition, many examples with numerical data will be presented.

Security Model for Encrypting Uncertain Rational Data Units Based on Refined Neutrosophic Integers Fusion and El Gamal Algorithm

The objective of this paper is to introduce a novel security model for the encryption of uncertain rational data units represented as single-valued rational neutrosophic numbers by combining refined neutrosophic number theoretical concepts with the El Gamal public key crypto scheme. In addition, some applications on uncertain data units will be shown and illustrated.

A tutorial on using ElGamal cryptosystem and RC4-P1 cipher in a hybrid scheme

Digital document is a form of information that can be transmitted over a digital channel. Public key cryptosystem such as ElGamal may provide secure transmission of digital document. However, securing a large document in .docx extension, it is usually not efficient to use public key cryptosystem directly, since the ciphertext generated is usually much larger than the original document itself, making it difficult to transmit. In this research, this problem is avoided by using a scheme called hybrid cryptosystem. A combination of ElGamal algorithm and RC4-P1 cipher will be used to perform the hybrid cryptosystem scheme for data security. The RC4-P1 cipher is the latest variant of RC4 cipher and relatively shorter time to do the encryption and decryption process, but only by using single-key.

An Effective Hybrid Encryption Model using Biometric Key for Ensuring Data Security

Cybersecurity becomes a key concern in many applications as cybercrimes exploit system weaknesses. Cryptography helps protect sensitive data in everyday transactions and communications using passwords or tokens. However, the power of the encryption/decryption algorithms always depends on their ability to secure the data in any situation. This paper presents an effective hybrid encryption/decryption model that makes use of a biometric key along with an effective password to ensure data security. The biometric key utilised in the proposed model is generated from the fingerprint, which is a unique physical characteristic of an individual. The model initially encodes the data to be securely transmitted. The symmetric key encryption that makes use of a biometric key is applied over the encoded data. Another layer of defence is built by applying asymmetric key encryption to the encrypted data along with the details of the fingerprint. The Advanced Encryption Standard (AES) algorithm and Elgamal Encryption using Elliptical Curve Cryptography (E3C2) are used for symmetric and asymmetric encryptions. Experimental analysis is performed to analyse the model's computing speed and security and is compared with existing models and encoding/encryption techniques

Modifikasi Algoritma El-gamal Dengan Menerapkan Algoritma Kargers Min Cut Untuk Pembangkitan Kunci

El-gamal algorithm has two keys, namely public key and secret key. This algorithm has security that lies in the difficulty in calculating discrete algorithms. Both encryption and decryption keys are integers. El-gamal algorithm type asymmetric cryptography algorithm consists of two keys namely public key to encrypt while private key to decrypt. In El-gamal algorithms, distributed keys are public keys that are not required confidentiality while private keys remain stored or not distributed. Anyone who has a public key can do the encryption process but the result of that encryption can only be read by the person who has the private key. To increase the strength of the algorithm, the key used to perform the encryption and decryption process will be modified first using the randomization algorithm that is Karger Min Cut Algorithm. Karger Min Cut algorithm is a probabilistic random algorithm used to verify matrix multiplication. The purpose of using Kargers Min Cut algorithm is to make the resulting key more difficult to guess, making it difficult to read the message or information