New modified map for digital image encryption and its performance

• Published in: Journal of physics. Conference series Vol. 893; no. 1; pp. 12050 - 12056
• Main Authors: Suryadi, MT, Irsan, Maria Yus Trinity, Satria, Yudi
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.10.2017
• Subjects: Algorithms; Digital data; Digital imaging; Digital mapping; Encryption; Goodness of fit; Histograms; Image quality; Physics; Sensitivity; Statistical tests
• ISSN: 1742-6588; 1742-6596
• DOI: 10.1088/1742-6596/893/1/012050

Protection to classified digital data becomes so important in avoiding data manipulation and alteration. The focus of this paper is in data and information protection of digital images form. Protection is provided in the form of encrypted digital image. The encryption process uses a new map, x n + 1 = r λ x n 1 + λ ( 1 − x n ) 2 ( mod 1 ) , which is called MS map. This paper will show: the results of digital image encryption using MS map and how the performance is regarding the average time needed for encryption/decryption process; randomness of key stream sequence with NIST test, histogram analysis and goodness of fit test, quality of the decrypted image by PSNR, initial value sensitivity level, and key space. The results show that the average time of the encryption process is relatively same as the decryption process and it depends to types and sizes of the image. Cipherimage (encrypted image) is uniformly distributed since: it passes the goodness of fit test and also the histogram of the cipherimage is flat; key stream, that are generated by MS map, passes frequency (monobit) test, and runs test, which means the key stream is a random sequence; the decrypted image has same quality as the original image; and initial value sensitivity reaches 10−17, and key space reaches 3.24 × 10634. So, that encryption algorithm generated by MS map is more resistant to brute-force attack and known plaintext attack.