Chaotic Encryption Scheme Using 1-D Chaotic Map

Abstract

This paper proposes three different chaotic encryption methods using 1-D chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR according to the name of chaotic map and non-linear function involved in the scheme. The designed schemes have been crypt analyzed for five different methods for testing its strength. Cryptanalysis has been performed for various texts using various keys selected from domain of key space. Logistic and NLFSR methods are found to resist known plaintext attack for available first two characters of plaintext. Plaintext sensitivity of both methods is within small range along with medium key sensitivity. Identifiability for keys of first two of the scheme has not been derived concluding that methods may prove to be weak against brute-force attack. In the last modified scheme avalanche effect found to be improved compared to the previous ones and method is found to resist brute-force attack as it derives the conclusion for identifiability

RGB Image Encryption Algorithm Using RSA Algorithm and 3D Chaotic System

“…Cryptanalysis, which is the art of deciphering an encrypted message as a whole or in part when the decryption key is not known, has been a source of concern to cryptographic scheme researchers. When cryptanalyzing a ciphering algorithm, the fundamental assumption is that the cryptanalyst knows exactly the design and working of the cryptosystem under study except the secret key (Mishra andMankar, 2011, Stinson, 2006). This assumption was made by A. Kerkhoff in the 19 th century and is usually referred to as Kerkhoff"s Principle (Delfs andKnebl, 2007, Stinson, 2006).…”

“…The most common attacks on cryptosystems are briefly explained as follows (Delfs and Knebl, 2007 In addition to the five general attacks described above, there are some other specialized attacks, like, the differential and the linear attacks. The differential cryptanalysis is a kind of chosen-plaintext attack aim at finding the secret key in a cipher, while the linear cryptanalysis is a type of known-plaintext attack, whose purpose is to construct a linear approximate expression of the cipher under study (Mishra and Mankar, 2011)…”

ArMTFr: a new permutation-based image encryption scheme

“…The Arnold cat map is a two-dimensional invertible chaotic map, which is used to shuffle the pixel positions of the plain image (Mishra and Mankar, 2013;Krishnamoorthi and Murali, 2012). Assume the dimension of the original image to be N × N. The coordinates of the pixels constitute the set S = {(x, y) | x, y = 0, 1, 2, …, N -1}.…”

A novel extreme learning machine‐based cryptography system

“…The third class uses models borrowed from the chaotic literature, and arranges them in the neural network structure . This class of methods does not take advantage of the learning capability of the neural network, which is the main strength of using a neural network in problem‐solving.…”