CFP last date
20 January 2025
Reseach Article

An Innovative Approach for Implementation of One-Time Pads

by Sagar Chandrakar, Shrikant Tiwari, Bhagya Shree Jain
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Number 13
Year of Publication: 2014
Authors: Sagar Chandrakar, Shrikant Tiwari, Bhagya Shree Jain
10.5120/15693-4579

Sagar Chandrakar, Shrikant Tiwari, Bhagya Shree Jain . An Innovative Approach for Implementation of One-Time Pads. International Journal of Computer Applications. 89, 13 ( March 2014), 35-37. DOI=10.5120/15693-4579

@article{ 10.5120/15693-4579,
author = { Sagar Chandrakar, Shrikant Tiwari, Bhagya Shree Jain },
title = { An Innovative Approach for Implementation of One-Time Pads },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 89 },
number = { 13 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 35-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume89/number13/15693-4579/ },
doi = { 10.5120/15693-4579 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:09:10.393157+05:30
%A Sagar Chandrakar
%A Shrikant Tiwari
%A Bhagya Shree Jain
%T An Innovative Approach for Implementation of One-Time Pads
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 13
%P 35-37
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a different way for implementation of one-time pad. The one-time pad are known as the mother of all encryption schemes, since it is known to be information-theoretically secure in contrast to other encryption schemes used in practice, which are at most computationally secure. Our proposed way will make encryption impossible to crack if used correctly. We are implementing one-time pad encryption technique using both block cipher and one-way hash. In this proposed method each bit or character from the plaintext is encrypted by a modular addition with a bit or character from a secret random key of the same length as the plaintext, resulting in a cipher text. If the key is truly random and at least as long as the plaintext also never reused in whole or part and kept secret the cipher text will be impossible to decrypt or break without knowing the key.

References
  1. Christian Matt and Ueli Maurer, "The One-Time Pad Revisited" in proceeding of Information Theory Proceedings Conference, pages 2706-2710. July 2013.
  2. Mariusz Borowski and Marek Lesniewicz, "Modern usage of "old" one-time pad" in proceeding of Communications and Information Systems Conference, pages 1-5. October 2012.
  3. Jiao-Hongqiang, Tian-Junfeng and Wang-Baomin, "A Study on the One-Time Pad Scheme Based Stern-Brocot Tree" in proceeding of ISCSCT 08 Conference, pages 568-571. December 2008.
  4. Songsheng Tang and Fuqiang Liu, "A one-time pad encryption algorithm based on one-way hash and conventional block cipher" in proceeding of CECNet Conference, pages 72-74. April 2012.
  5. Jeyamala. C, GopiGanesh. S, Raman G. S, "An Image Encryption Scheme Based on One Time Pads – A Chaotic Approach" in proceeding of ICCCNT Conference, pages 1-6. July 2010.
  6. J. C. Bienfang, A. Mink, B. J. Hershman, A. Nakassis, X. Tang, R. F. Boisvert, D. H. Su,Charles W. Clark and Carl J. Williams, "Broadband Quantum Generated One-Time-Pad Encryption" in proceeding of Quantum Electronics and Laser Science Conference, pages 362-364. May 2005.
  7. Alan Mink, Lijun Ma, Tassos Nakassis, Hai Xu, Oliver Slattery, Barry Hershman and Xiao Tang, "A Quantum Network Manager That Supports A One-Time Pad Stream" in proceeding of Quantum, Nano and Micro Technologies Conference, pages 16-21. February 2008.
Index Terms

Computer Science
Information Sciences

Keywords

One-Time Pad Encryption Block Cipher Randomness One–Way Hash Decryption