TY - CHAP
T1 - Text-to-image encryption and decryption using piece wise linear chaotic maps
AU - Patro, K. Abhimanyu Kumar
AU - Soni, Shashwat
AU - Sharma, V. K.
AU - Acharya, Bibhudendra
N1 - Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2020.
PY - 2020
Y1 - 2020
N2 - Generally, if an image is received as a Cipher, it is assumed that the data (to be sent) might be an image, but text can also be encrypted in the format of an image. So to confuse the attacker, this paper proposes a technique that encrypts the text into image using piecewise linear chaotic map (PWLCM). A text file can be taken as input and the proposed algorithm will convert it into a cipher image, which can then be converted back by the decryption process. The advantage of this scheme is that it is quite secure and hard to break. Also, PWLCM Maps is the simplest among chaotic maps. At first, the text is converted from 7-bit ASCII to its double equivalent and then padding is done to get the required matrix to form a structure for the image to which the text will be converted. After that permutation is done to the matrix bits and then diffusion occurs at two stages, first for the rows and then for the columns. Both permutation and diffusion are done using PWLCM map.
AB - Generally, if an image is received as a Cipher, it is assumed that the data (to be sent) might be an image, but text can also be encrypted in the format of an image. So to confuse the attacker, this paper proposes a technique that encrypts the text into image using piecewise linear chaotic map (PWLCM). A text file can be taken as input and the proposed algorithm will convert it into a cipher image, which can then be converted back by the decryption process. The advantage of this scheme is that it is quite secure and hard to break. Also, PWLCM Maps is the simplest among chaotic maps. At first, the text is converted from 7-bit ASCII to its double equivalent and then padding is done to get the required matrix to form a structure for the image to which the text will be converted. After that permutation is done to the matrix bits and then diffusion occurs at two stages, first for the rows and then for the columns. Both permutation and diffusion are done using PWLCM map.
UR - http://www.scopus.com/inward/record.url?scp=85078259453&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078259453&partnerID=8YFLogxK
U2 - 10.1007/978-981-15-0694-9_4
DO - 10.1007/978-981-15-0694-9_4
M3 - Chapter
AN - SCOPUS:85078259453
T3 - Lecture Notes in Networks and Systems
SP - 23
EP - 33
BT - Lecture Notes in Networks and Systems
PB - Springer Gabler
ER -