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 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 Modified Advanced Encryption Standard Algorithm for Information Security

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1484 ◽  
Author(s):  
Oluwakemi Christiana Abikoye ◽  
Ahmad Dokoro Haruna ◽  
Abdullahi Abubakar ◽  
Noah Oluwatobi Akande ◽  
Emmanuel Oluwatobi Asani
Keyword(s):  
Execution Time ◽  
Advanced Encryption Standard ◽  
Avalanche Effect ◽  
Plain Text ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Encryption And Decryption ◽  
To Come ◽  
Cryptographic Techniques ◽  
Modified Aes

The wide acceptability of Advanced Encryption Standard (AES) as the most efficient of all of the symmetric cryptographic techniques has further opened it up to more attacks. Efforts that were aimed at securing information while using AES is still being undermined by the activities of attackers This has further necessitated the need for researchers to come up with ways of enhancing the strength of AES. This article presents an enhanced AES algorithm that was achieved by modifying its SubBytes and ShiftRows transformations. The SubBytes transformation is modified to be round key dependent, while the ShiftRows transformation is randomized. The rationale behind the modification is to make the two transformations round key dependent, so that a single bit change in the key will produce a significant change in the cipher text. The conventional and modified AES algorithms are both implemented and evaluated in terms avalanche effect and execution time. The modified AES algorithm achieved an avalanche effect of 57.81% as compared to 50.78 recorded with the conventional AES. However, with 16, 32, 64, and 128 plain text bytes, the modified AES recorded an execution time of 0.18, 0.31, 0.46, and 0.59 ms, respectively. This is slightly higher than the results obtained with the conventional AES. Though a slightly higher execution time in milliseconds was recorded with the modified AES, the improved encryption and decryption strength via the avalanche effects measured is a desirable feat.

scholarly journals NON LINEAR FEEDBACK STREAM CIPHER

2012 ◽  
pp. 132-138
Author(s):  
Dr .R. Siva Ram Prasad ◽  
G. Murali ◽  
S. Gopi Krishna
Keyword(s):  
Linear Function ◽  
Stream Cipher ◽  
Nonlinear Function ◽  
Linear Feedback ◽  
Synchronous Mode ◽  
Plain Text ◽  
Cipher Text ◽  
Security Software ◽  
Non Linear ◽  
New Generation

The main aim of this paper is to develop a new generation and innovative security software for applications. We proposed new stream cipher called NLFS. NLFS means Non-linear feedback stream cipher, which is a fast and secure stream cipher for egovernance applications. This stream cipher uses AES secure non-linear function and AES key generation. NLFS uses primitive polynomial generated S-boxes in byte substitution step. NLFS uses two similar AES round functions and these two proceed parallelly to produce key-stream. Non-linear *function of NLFS has AES nonlinear function steps (add-round key, byte substitution, mix column, shift rows) and it extra includes value-based rotation step. In value based rotation step it rotates each 8-bit word by its first 3-bit (decimal) value.NLFS have two modes basic mode that is synchronous mode and self synchronous mode. In synchronous mode key stream is independent of plain text and cipher text. In selfsynchronous mode key stream generation depending on cipher text. In self synchronous mode generated keystream update first 512-bit buffer and cipher text update the second buffer.

scholarly journals Lossless and Reversible Data Hiding using Public Key Cryptography

2020 ◽  
Vol 32 ◽  
pp. 02002
Author(s):  
Pooja Shetye ◽  
Srushti Varekar ◽  
Manali Zajam ◽  
Monika Pawar ◽  
Sujata Kadam
Keyword(s):  
Data Hiding ◽  
Internet Access ◽  
Public Key Cryptography ◽  
Secret Message ◽  
Major Drawback ◽  
Plain Text ◽  
Private Key ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Encryption And Decryption

In today’s world, the internet is a platform, where large amount of data can be obtained and transferred. Different technologies and internet access are used to transfer the data which can be accessed by authorized and unauthorized users.The major drawback of these technologies are that any unauthorized person can access it.Hence encryption and decryption is perform on Message/Data .In encryption the plain text/image is converted into cipher text/image.The technique of data hiding is used to hide the data that has to be transferred from the source to the destination.The process involves insertion of secret message in the cover image which is encrypted with the help of AES algorithm. This algorithm generates public/private key. All this process can be performed in lossless and reversible manner.

REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES

2013 ◽  
Vol 23 (06) ◽  
pp. 1350101 ◽  
Author(s):  
SELMAN UGUZ ◽  
HASAN AKIN ◽  
IRFAN SIAP
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Periodic Boundary ◽  
Spatial Scales ◽  
Information Matrix ◽  
Continuous System ◽  
Mathematical Structure ◽  
Difficult Problem ◽  
Two Dimensional ◽  
Detailed Mathematical Analysis

This paper presents a study of two-dimensional hexagonal cellular automata (CA) with periodic boundary. Although the basic construction of a cellular automaton is a discrete model, its global level behavior at large times and on large spatial scales can be a close approximation to a continuous system. Meanwhile CA is a model of dynamical phenomena that focuses on the local behavior which depends on the neighboring cells in order to express their global behavior. The mathematical structure of the model suggests the importance of the algebraic structure of cellular automata. After modeling the dynamical behaviors, it is sometimes an important problem to be able to move backwards on CAs in order to understand the behaviors better. This is only possible if cellular automaton is a reversible one. In the present paper, we study two-dimensional finite CA defined by hexagonal local rule with periodic boundary over the field ℤ3 (i.e. 3-state). We construct the rule matrix corresponding to the hexagonal periodic cellular automata. For some given coefficients and the number of columns of hexagonal information matrix, we prove that the hexagonal periodic cellular automata are reversible. Moreover, we present general algorithms to determine the reversibility of 2D 3-state cellular automata with periodic boundary. A well known fact is that the determination of the reversibility of a two-dimensional CA is a very difficult problem, in general. In this study, the reversibility problem of two-dimensional hexagonal periodic CA is resolved completely. Since CA are sufficiently simple to allow detailed mathematical analysis, also sufficiently complex to produce chaos in dynamical systems, we believe that our construction will be applied many areas related to these CA using any other transition rules.

scholarly journals An Enhanced Cryptographic Algorithm Using Bi-Modal Biometrics

2019 ◽  
Vol 8 (11) ◽  
pp. 2575-2582
Keyword(s):  
Advanced Encryption Standard ◽  
Generation Process ◽  
Key Generation ◽  
Plain Text ◽  
Cipher Text ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Biometric Feature ◽  
Novel Algorithm

A novel cryptographic algorithm, namely Significant Secure Biometric Key (SSBK) algorithm is proposed.The novel algorithm is compared with the existing cryptographic algorithms like Advanced Encryption Standard (AES), key exchange algorithm like Diffie-Helman and also with Symmetric Random Biometric Key (SRBK) algorithm, and finally we prove the proposed algorithm is superior than existing algorithm based on few parameters. A sample plain text is taken and converted to cipher text and the key from the biometric feature is used for encryption and decryption. In the key generation process, the bi-modal biometrics, namely Ear and Lip features are taken. The concatenated key values obtained from ear and lip can be of minimum 8 bits to the maximum of 1024 bits based on the type of algorithm used.

scholarly journals Implementation of modified Feistel block cipher for OTP generation using Verilog HDL

2018 ◽  
Vol 7 (2.8) ◽  
pp. 392
Author(s):  
Fazal Noorbasha ◽  
K Hari Kishore ◽  
T. Naveen ◽  
A. Sai Anusha ◽  
Y. Manisha ◽  
...  
Keyword(s):  
Block Cipher ◽  
Credit Cards ◽  
Cyber Attacks ◽  
Original Form ◽  
Verilog Hdl ◽  
Plain Text ◽  
Cipher Text ◽  
Mobile Operator ◽  
Modified Method ◽  
One Time Password

In this paper we modified feistel block cipher to generate OTP (One Time Password) and implement it using Verilog HDL. To perform any online transaction using debit or credit cards, an OTP is sent to the client via SMS for his mobile number registered at the bank, then the client enters this OTP to complete the transaction. This OTP is generated at Bank server and sent to the client mobile operator. Once the OTP is generated it should be protected during the transmission from cyber attacks such as phishing, malware Trojans, etc. before it reaches the client to maintain confidentiality and integrity of information. This algorithm uniquely specifies the steps to encrypt the plain text into cryptographic cipher and to decrypt this cipher text back into original form. The proposed modified method is for improving the security.

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 Implementasi Algoritma Rot Dan Subtitusional Block Cipher Dalam Mengamankan Data

2017 ◽  
pp. 73-79
Author(s):  
Ayu Pratiwi
Keyword(s):  
Information System ◽  
Information Systems ◽  
Block Cipher ◽  
Rapid Development ◽  
Encryption Algorithm ◽  
New Techniques ◽  
Plain Text ◽  
Cipher Text ◽  
Processing Data ◽  
Confidential Data

The security and confidentiality of data is one of the most important aspects in the information system at this time. Caused by the rapid development of science and technology that allows the emergence of new techniques, which are misused by certain parties that threaten the security of information systems. In general, the data are categorized into two, namely confidential data and data that is not confidential. Data that is not confidential is usually not too much attention. What really needs to be considered is confidential data, where every information contained in it will be very valuable for those who need it because the data can be easily duplicated. The ROT-n algorithm is one simple encryption algorithm that uses alphabetical shifts as much as n to convert plain text into cipher text, whereas Block ciphers work by processing data in blocks, where several characters / data are combined into one block. Each one block process produces one block output as well.

Sign in / Sign up

Export Citation Format

Share Document