Emerging DNA Cryptography based Encryption Schemes: A Review

Harishchandra Dubey; Rabindra Kumar Barik; Chittaranjan Pradhan; Pratyusa Mukherjee

doi:10.1504/ijics.2022.10036907

Text Encryption based on Huffman Coding and ElGamal Cryptosystem

Recent Patents on Engineering ◽

10.2174/1872212114999200917144000 ◽

2020 ◽

Vol 14 ◽

Author(s):

Khoirom Motilal Singh ◽

Laiphrakpam Dolendro Singh ◽

Themrichon Tuithung

Keyword(s):

Data Transfer ◽

Huffman Coding ◽

Large Integer ◽

Text Data ◽

Storage Devices ◽

Scientific World ◽

Elgamal Cryptosystem ◽

Encryption Schemes ◽

Transfer Operation ◽

And Performance

Background: Data which are in the form of text, audio, image and video are used everywhere in our modern scientific world. These data are stored in physical storage, cloud storage and other storage devices. Some of it are very sensitive and requires efficient security while storing as well as in transmitting from the sender to the receiver. Objective: With the increase in data transfer operation, enough space is also required to store these data. Many researchers have been working to develop different encryption schemes, yet there exist many limitations in their works. There is always a need for encryption schemes with smaller cipher data, faster execution time and low computation cost. Methods: A text encryption based on Huffman coding and ElGamal cryptosystem is proposed. Initially, the text data is converted to its corresponding binary bits using Huffman coding. Next, the binary bits are grouped and again converted into large integer values which will be used as the input for the ElGamal cryptosystem. Results: Encryption and Decryption are successfully performed where the data size is reduced using Huffman coding and advance security with the smaller key size is provided by the ElGamal cryptosystem. Conclusion: Simulation results and performance analysis specifies that our encryption algorithm is better than the existing algorithms under consideration.

Download Full-text

Public-Key Encryption

10.1093/oso/9780198788003.003.0005 ◽

2017 ◽

Author(s):

Keith M. Martin

Keyword(s):

Elliptic Curve ◽

Public Key Cryptography ◽

Public Key ◽

Public Key Encryption ◽

Hybrid Encryption ◽

Public Key Cryptosystems ◽

Encryption And Decryption ◽

Encryption Schemes ◽

Hard Problems ◽

Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

Download Full-text

A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes

The Journal of Supercomputing ◽

10.1007/s11227-021-03826-0 ◽

2021 ◽

Author(s):

Saeid Esmaeilzade ◽

Nasrollah Pakniat ◽

Ziba Eslami

Keyword(s):

Homomorphic Encryption ◽

Oblivious Transfer ◽

Encryption Schemes ◽

Generic Construction

Download Full-text

Non-Linear Hopped Chaos Parameters-Based Image Encryption Algorithm Using Histogram Equalization

Entropy ◽

10.3390/e23050535 ◽

2021 ◽

Vol 23 (5) ◽

pp. 535

Author(s):

Karim H. Moussa ◽

Ahmed I. El Naggary ◽

Heba G. Mohamed

Keyword(s):

Image Encryption ◽

Initial Conditions ◽

Signal To Noise Ratio ◽

Chaotic Map ◽

Histogram Equalization ◽

Encryption Algorithm ◽

Multimedia Contents ◽

Encryption Schemes ◽

Change Intensity ◽

Increasing Demand

Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes.

Download Full-text