Image Scrambling Using One Time Pad with Linear Congruent Key Generator
Abstract
With the changing of the times, more and more moments can be photographed. Digital imagery stores a lot of information through visual display. Many people perpetuate the things that are personal in the form of digital imagery, with so many files in the form of digital imagery that is private and not for publication. With the development of cloud computing systems, every image recorded through the smartphone will be synchronized with the online storage service provider. This has many advantages, such as users do not have to worry about the damage to storage devices that exist in their gadgets. But the disadvantage of this system is that if an account falls into the hands of an unauthorized person then photographs containing this personal information may be published by an unauthorized person, of course this will be very detrimental. One solution that can be used is to randomize the original image so that its visual appearance will not be like the actual visual display. One way that can be used for image randomization is by cryptographic techniques. The one time pad algorithm is a very powerful classical cryptographic algorithm and can not be solved by cryptanalis until now. One disadvantage of a one time pad algorithm is the key length must be the same as the length of the plaintext. This makes the algorithm unused because it is less practical in its key usage. To overcome this required a key generator that could generate randomly generated locks ie a linear congruent generator, thus the key length must be equal to the length of the plaintext can be generated only with a few variables. In this way, image randomization can be done with a strong and practical cryptographic algorithm.
Full Text:
PDFArticle Metrics
Abstract view : 427 timesPDF - 371 times
References
M. Bhat, “Digital Image Processing,” Int. J. Sci. Technol. Res., vol. 3, no. 1, pp. 272–276, 2014.
B. Shinde, D. Mhaske, and A. R. Dani, “Study of Image Processing , Enhancement and Restoration,” vol. 8, no. 6, pp. 262–264, 2011.
Z. Liehuang, L. Wenzhuo, L. Lejian, and L. Hong, “A Novel Image Scrambling Algorithm for Digital Watermarking Based on Chaotic Sequences,” J. Comput. Sci., vol. 6, no. 8, pp. 125–130, 2006.
H. Kekre, T. Sarode, and P. Halarnkar, “Image Scrambling using R-Prime Shuffle,” … J. Adv. Res. …, pp. 4070–4076, 2013.
D. R. Ahmed, “Simple Image Scrambling Algorithm Based on Random Numbers Generation,” vol. 5, no. 9, pp. 434–438, 2015.
Y. Rajput, “An Improved Cryptographic Technique to Encrypt Text using Double Encryption,” Int. J. Comput. Appl., vol. 86, no. 6, pp. 975–8887, 2014.
M. Iqbal, M. Akbar, S. Pane, A. Putera, and U. Siahaan, “SMS EncryptionUsing One-Time Pad Cipher,” vol. 18, no. 6, pp. 54–58, 2016.
Zaeniah and B. E. Purnama, “An Analysis of Encryption and Decryption Application by using One Time Pad Algorithm,” Int. J. Adv. Comput. Sci. Appl., vol. 6, no. 9, pp. 292–297, 2015.
M. E. S and P. Arulmozhi, “Linear Congruential Generator for LUT-SR Architecture,” vol. 2, no. 3, pp. 97–102, 2014.
M. Mishra and P. D. Scholar, “Text Encryption Algorithms based on Pseudo Random Number Generator,” vol. 111, no. 2, pp. 1–6, 2015.
Refbacks
- There are currently no refbacks.
Copyright (c) 2018 Imam Saputra
This work is licensed under a Creative Commons Attribution 4.0 International License.
The IJICS (International Journal of Informatics and Computer Science)
Published by STMIK Budi Darma.
Jl. Sisingamangaraja No.338 Simpang Limun, Medan, North Sumatera
Email: ijics.stmikbudidarma@gmail.com
This work is licensed under a Creative Commons Attribution 4.0 International License.