Multi-sized Multiple Text File Encryption System using One-dimensional Chaotic Map

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a text encryption system to encrypt multiple text files of arbitrary sizes. The proposed work uses one-dimensional piece-wise linear chaotic map (PWLCM) to perform multi-sized multiple text file encryption. In the method, a group of text files is partitioned into number of sections, each one with 4-text elements. The text elements in each of the sections are then arranged into dimensional text blocks. All the blocks and the remaining text elements (if any) are arranged in a separate array. Finally, the array of blocks and remaining text elements are permuted and diffused using two different PWLCM systems. The SHA-256 hash function is used to generate the keys to prevent the proposed cryptosystem against chosen-plaintext and known-plaintext attacks. The computer simulation reveals the good encryption results of the multi-sized multiple text file encryption system. The security analysis confirms the stronger resistivity of the proposed algorithm against the most widely used security attacks.

Cite

CITATION STYLE

APA

Abhimanyu Kumar Patro, K., Agrawal, A., Raj, R., & Acharya, B. (2021). Multi-sized Multiple Text File Encryption System using One-dimensional Chaotic Map. In Lecture Notes in Electrical Engineering (Vol. 692, pp. 55–70). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-15-7486-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free