Message Security and Parity Bit Recovery

Khean Ouk¹ , Kimsoung Lim² , Sensamnang Ouk³

Section:Research Paper, Product Type: Journal-Paper
Vol.8 , Issue.5 , pp.36-42, Oct-2020

Online published on Oct 31, 2020

Copyright © Khean Ouk, Kimsoung Lim, Sensamnang Ouk . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Today is the age of the digital era which uses ICT around the world in daily life. The confrontation of using ICT is security breach. To protect the daily works and daily messages transferring are more secure as needed, we must take countermeasure to prevent the accidental happening to them. One of those countermeasures is using One Time Pad technique to encrypt and decrypt messages unbreakable. This encryption and decryption will highly secure messages. The amount of data is huge to store and need to be recovered as soon as possible. Most people around the world are using IT system such as banking and Microfinance which its data cost billions dollar. If there is a catastrophe occurring to loss data, their businesses will be bankruptcy. One of the most powerful techniques to recover data effectively is a parity bit. The RAID-5 level has ability to recover data effectively when a hard disk among at least 3 hard disks in array failed during the RAID-5 is working because of its parity bit. This information security method is to ensure the confidential, integrity and availability of data.

Key-Words / Index Term :
encryption, decryption, RAID-5, Parity bit, Cryptography, One Time pad, Cryptosystem, key

References :
[1]. DavidA.Patterson,Garth Gibson,and Randy H.Katz,“ A Case for Redundant Arrays of Inexpensive Disks (RAID)”, SIGMOD Conferences ,Volume 17, Issue 3,1988.
[2]. Abiodun Esther Omolara, Aman Jantan, Oludare Isaac Abiodun, Humaira Arshad, “An Enhanced Practical Difficulty of One-Time Pad Algorithm Resolving the Key Management and Distribution Problem”, Proceedings of the International MultiConference of Engineers and Computer Scientists 2018,Hong Kong,2018.
[3]. E. Yaghoubi & L. A. Bakhtiar & A. Adami & S. M. Hamidi &M. Hosseinzadeh, “All optical OR/AND/XOR gates based on nonlinear directional coupler”, Journal of Optics ,2014.
[4]. Prof. D. Chandrasekhar Rao, Dr. Amiya Kumar Rath, Dr. M. R. Kabat, “CRYPTOGRAPHY AND NETWORK SECURITY LECTURE NOTES”, Odisha, pp 18.
[5]. C. E. Shannon,“Communication Theory of Secrecy Systems”, Bell System Technical Journal, vol.28-4,pp 656-715, 1949.
[6]. Muhammad Iqbal, Muhammad Akbar Syahbana Pane,Andysah Putera Utama Siahaan, “SMS Encryption Using One-Time Pad Cipher”, IOSR Journal of Computer Engineering (IOSR-JCE), Volume 18, Issue 6, PP 54-58,2016.