Application of Linear and Non Linear Modified 3D Cellular Automata Rules in Cryptography for Improved Security of Transmitted Data

2014 ◽  
Vol 573 ◽  
pp. 600-604
Author(s):  
K. Latha ◽  
S. Amirthalingam
Keyword(s):  
Cellular Automata ◽  
Data Encryption ◽  
Internet Security ◽  
Data Encryption Standard ◽  
Advance Encryption Standard ◽  
Cipher Text ◽  
Keywords Internet ◽  
Encryption And Decryption ◽  
Using Data ◽  
Made In

Internet is the prime vehicle to disseminate information from one place to another. Providing security to data is a major issue in transmitting data. One way of providing security to the data is encryption and decryption. Normal encryption is the way of changing the plaintext into cipher text using encryption and decryption algorithm and key. Literature reported different methods for encryption. An attempt is made in this paper to propose a modified encryption and decryption process performed with modified cellular automata rules. Cellular automata is idealized parallel processing machine which depends upon the cell value which is updated based on updating rule, which involves the cell and other cell values in a particular neighbourhood .Discrete references were made in the literature on the application of cellular automata rules. However lot more work remains to be done in this area. An attempt is made in this paper to provide encryption and decryption with cellular automata rules, using Data Encryption Standard (DES) and Advance Encryption Standard (AES) algorithms. They are operated at various stages, with the number of stages involved in sequential and cellular automata operating parallel. The major contribution of present work is, to develop methodology for identifying and application of 1D and 2D cellular automata rules and to fix the issues and challenges there in. A modified cellular automata set of rules are considered to develop 3D cellular automata rules for improved safety. Further a comparison is provided between existing 1, 2D automata rules versus the modified 3D cellular automata rules with respect to certain parameters. Keywords : Internet, Security, Cipher text, Plaintext, Cell value.

scholarly journals APPLICATION OF CRYPTOGRAPHY WITH DATA ENCRYPTION STANDARD (DES) ALGORITHM IN PICTURE

2020 ◽  
Vol 4 (2) ◽  
pp. 9
Author(s):  
Angga Aditya Permana ◽  
Desi Nurnaningsih
Keyword(s):  
Block Cipher ◽  
Data Encryption ◽  
Third Party ◽  
Original Text ◽  
Symmetric Cryptography ◽  
Data Confidentiality ◽  
Data Encryption Standard ◽  
The Third ◽  
Encryption And Decryption ◽  
The One

Cryptography is the science of maintaining data confidentiality, where the original text (plaintext) is encrypted using an encryption key to be ciphertext (text that has been encrypted). In this case cryptography secures data from a third party so that the third party cannot know the original contents of the data because the one who holds the key for encryption and decryption is only the sender and receiver. There are several cryptographic methods that are commonly used, one of which is DES or Data Encryption Standard. DES is included in the key-symmetric cryptography and is classified as a block cipher type

scholarly journals 4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(pq)

2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh
Keyword(s):  
Boolean Functions ◽  
Galois Field ◽  
Data Encryption ◽  
First Century ◽  
Additive Constant ◽  
Substitution Box ◽  
Data Encryption Standard ◽  
Substitution Boxes ◽  
Early Twenty ◽  
Encryption And Decryption

Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The S-Box of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(28) adding an additive constant in early twenty first century. In this paper Substitution Boxes have been generated from Irreducible or Reducible Polynomials over Galois field GF(pq). Binary Galois fields have been used to generate Substitution Boxes. Since the Galois Field Number or the Number generated from coefficients of a polynomial over a particular Binary Galois field (2q) is similar to log2q+1 bit BFs. So generation of log2q+1 bit S-Boxes is possible. Now if p = prime or non-prime number then generation of S-Boxes is possible using Galois field GF (pq ), where q = p-1.

scholarly journals Security and Privacy Issues of IoT at Fog Layer Architecture

2021 ◽  
Author(s):  
Vinay Michael
Keyword(s):  
Data Encryption ◽  
Security And Privacy ◽  
Delivery Ratio ◽  
User Privacy ◽  
Sensitive Data ◽  
Limited Bandwidth ◽  
Cipher Text ◽  
Computational Overhead ◽  
Encryption And Decryption ◽  
Encryption Decryption

Abstract Internet of Things (IoT) based applications and systems are gaining attention in the recent days because of their vast benefits such as efficient utilization of resources, enhanced data collection, improved security, lesser human efforts and reduced time. Security of sensitive data in IoT based fog environments is inevitable to prevent those data to be misused by the attackers. In this study, we present an improved hybrid algorithm termed as HQCP-ABE (Hybrid Quantum key Cipher text Policy Attribute based Encryption with Cipher text update) that integrates highly effective algorithms such as CP-ABE, Quantum key cryptography and cipher text update. The proposed algorithm eliminates the need of costly pairing during decryptions and efficiently performs data encryption, decryption and user authorization. The proposed protocol is demonstrated to be highly efficient in terms of encryption and decryption while compared to other existing methods. It also achieves lesser packet loss, reduced control overheads, reduced computational overhead during encryption and decryption processes, lesser delay, improved security, packet delivery ratio, throughput, network lifetime with limited bandwidth and user privacy. We further considered energy consumption in this study. The proposed HQCP-ABE method is demonstrated using ns3 simulation and compared with existing CP-ABE and PA-CPABE methods.

IMPLEMENTASI ALGORITMA ADVANCED ENCRYPTION STANDARD DAN TRIPLE DATA ENCRYPTION STANDARD UNTUK MENGAMANKAN CITRA DIGITAL

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Mahadi Winafil ◽  
Sinar Sinurat ◽  
Taronisokhi Zebua
Keyword(s):  
Digital Images ◽  
Data Encryption ◽  
Advanced Encryption Standard ◽  
The Internet ◽  
Client Server ◽  
Data Encryption Standard ◽  
Aes Algorithm ◽  
Encryption And Decryption ◽  
Cryptographic Techniques ◽  
E Mail

Digital images that are personal and confidential are very vulnerable to wiretapping by irresponsible parties. Especially if distributed via the internet network such as on Facebook, WhatsApp and e-mail chat based applications. Images that are sent sometimes are often confidential images and must be maintained. In order to maintain the security of digital images can be done by utilizing cryptographic techniques. Cryptographic techniques can secure digital images by changing pixel values from digital images so as to produce different pixel values from the original image to be secured. This research will use AES 128 bit and Triple DES methods for encryption and decryption of digital images on client-server based applications. The results of the encryption AES algorithm will be re-encrypted with the Triple DES Algorithm so as to produce pixel values that are far different from the original pixel values. Keywords: cryptography, image, AES, Triple DES

scholarly journals Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

2012 ◽  
pp. 111-117
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Manas Kumar Swain
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
A Cell ◽  
Updating Rule ◽  
Fundamental Objective

Cellular Automaton is an idealized parallel processing machine which is an array (1-D, 2-D) of numbers or symbols called cell values together with an updating rule. A cell value is updated based on this updating rule, which involves the cell value as well as other cell values in a particular neighborhood. A fundamental objective of cryptography is to enable two people to communicate over an insecure channel (a public channel such as internet) in such a way that any other person is unable to recover their message (called the plaintext) from what is sent in its place over the channel (the cipher text). The transformation of the plaintext into the cipher text is called encryption, or enciphering. The transformation of the cipher text into the plaintext is called decryption, or deciphering. In this paper we present a new encryption and decryption algorithm based on the linear (periodic boundary-PB) and nonlinear Cellular Automata rules. First we apply PB CA rules to plain text and key. The result of both plain text and key is XORed. Then the result of XOR operation is fed to substitution box( S-box) and again PB CA rules are applied for exchange and shift operations. At the end Complement operation is applied for encryption of plain text. The decryption process is carried out just similar to encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 numbers of rounds in order to avoid the dependency between the plain text and cipher text.

scholarly journals Improved Structure of Data Encryption Standard Algorithm

2020 ◽  
Vol 55 (5) ◽  
Author(s):  
Mays M. Hoobi
Keyword(s):  
Data Encryption ◽  
Encryption Algorithm ◽  
Key Generation ◽  
Brute Force ◽  
Generation System ◽  
Data Encryption Standard ◽  
Standard Algorithm ◽  
Standard Data ◽  
Cipher Text ◽  
Major Data

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key generations. This means the key generation system generates two keys: one is simple, and the other one is encrypted by using an improved Caesar algorithm. The encryption algorithm in the first 8 round uses simple key 1, and from round 9 to round 16, the algorithm uses encrypted key 2. Using the improved structure of the Data Encryption Standard algorithm, the results of this paper increase Data Encryption Standard encryption security, performance, and complexity of search compared with standard Data Encryption Standard. This means the Differential cryptanalysis cannot be performed on the cipher-text.

scholarly journals 4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(pq)

2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh
Keyword(s):  
Boolean Functions ◽  
Galois Field ◽  
Data Encryption ◽  
First Century ◽  
Additive Constant ◽  
Substitution Box ◽  
Data Encryption Standard ◽  
Substitution Boxes ◽  
Early Twenty ◽  
Encryption And Decryption

Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The S-Box of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(28) adding an additive constant in early twenty first century. In this paper Substitution Boxes have been generated from Irreducible or Reducible Polynomials over Galois field GF(pq). Binary Galois fields have been used to generate Substitution Boxes. Since the Galois Field Number or the Number generated from coefficients of a polynomial over a particular Binary Galois field (2q) is similar to log2q+1 bit BFs. So generation of log2q+1 bit S-Boxes is possible. Now if p = prime or non-prime number then generation of S-Boxes is possible using Galois field GF (pq ), where q = p-1.

scholarly journals Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

2011 ◽  
pp. 18-23
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Umesh Prasad Rout ◽  
Surendra Kumar Nanda
Keyword(s):  
Cellular Automata ◽  
Periodic Boundary ◽  
Block Cipher ◽  
Two Dimensional ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

scholarly journals Secured Data Transmission Using Wavelet Based Steganography And Cryptography

2013 ◽  
Vol 6 (2) ◽  
pp. 311-316 ◽  
Author(s):  
Mittapalli Indrasena Reddy ◽  
V. Uday Kumar ◽  
K. Subba Reddy ◽  
P. Venkat Vijay Kumar
Keyword(s):  
Wavelet Transform ◽  
Digital Watermarking ◽  
Digital Image ◽  
Data Transmission ◽  
Data Encryption ◽  
Least Significant Bit ◽  
Data Encryption Standard ◽  
Plain Text ◽  
Using Data ◽  
Secured Data

Steganography and cryptographic methods are used together with wavelets to increase the security of the data while transmitting through networks. Another technology, the digital watermarking is the process of embedding information into a digital (image) signal. Before embedding the plain text into the image, the plain text is encrypted by using Data Encryption Standard (DES) algorithm. The encrypted text is embedded into the LL subband of the wavelet decomposed image using Least Significant Bit (LSB) method. Then the inverse wavelet transform is applied and the resultant image is transmitted to the receiver. The receiver will perform the same operations in reverse order.

Sign in / Sign up

Export Citation Format

Share Document