Open Access   Article Go Back

OTP Generation Algorithm: A Rubik’s Cube Principle Implementation

S. Bose1 , D.R. Chowdhury2

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-2 , Page no. 8-14, Feb-2017

Online published on Mar 01, 2017

Copyright © S. Bose, D.R. Chowdhury . 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

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: S. Bose, D.R. Chowdhury , “OTP Generation Algorithm: A Rubik’s Cube Principle Implementation,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.2, pp.8-14, 2017.

MLA Style Citation: S. Bose, D.R. Chowdhury "OTP Generation Algorithm: A Rubik’s Cube Principle Implementation." International Journal of Computer Sciences and Engineering 5.2 (2017): 8-14.

APA Style Citation: S. Bose, D.R. Chowdhury , (2017). OTP Generation Algorithm: A Rubik’s Cube Principle Implementation. International Journal of Computer Sciences and Engineering, 5(2), 8-14.

BibTex Style Citation:
@article{Bose_2017,
author = {S. Bose, D.R. Chowdhury },
title = {OTP Generation Algorithm: A Rubik’s Cube Principle Implementation},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2017},
volume = {5},
Issue = {2},
month = {2},
year = {2017},
issn = {2347-2693},
pages = {8-14},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1169},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1169
TI - OTP Generation Algorithm: A Rubik’s Cube Principle Implementation
T2 - International Journal of Computer Sciences and Engineering
AU - S. Bose, D.R. Chowdhury
PY - 2017
DA - 2017/03/01
PB - IJCSE, Indore, INDIA
SP - 8-14
IS - 2
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
877 988 downloads 565 downloads
  
  
           

Abstract

A One-Time Password (OTP) is an auto - generated, string of characters (password) that validates the user to carry out a single transaction or session on digital devices like a Computer, Smartphone, Tablet etc. Various unique techniques underwent implementation time and again for producing an optimal and efficient OTP. In most of the techniques, the OTP generated is of a shorter length and comprised of only letters of English alphabet (a – z, A - Z), digits (0 – 9) and characters like @ etc. In this paper a novel approach for generating One-Time Password (OTP) has been proposed using Rubik’s cube principle based on a 4 × 4 cube in which each box of the cube is labeled with characters present on the keyboard such that when the layers of the cube are scrambled in various ways, it creates a 16 character OTP. This technique using Rubik’s cube have never been applied before to generate an OTP.

Key-Words / Index Term

One TimePassword(OTP); Hash Function; Random Function; Replay Attacks

References

[1] Saini T., “One Time Password Generator System”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol.4(3), pp.781–785, March 2014.
[2] Huang Y., Huang Z., Zhao H., Lai X., “A new One-time Password Method”, In the Proceedings of 2013 International Conference on Electronic Engineering and Computer Science , pp.32–37, 2013.
[3] Parmar H., Nainan N. and Thaseen S., “GENERATION OF SECURE ONE-TIME PASSWORD BASED ON IMAGE AUTHENTICATION”, In the Proceedings of Academy & Industrial Research Collaboration Center - Computer Science Conference Proceedings, pp.195- 206, 2012.
[4] Fatangare S., Prof. Lomte A., “Robust OTP Generation Using Secure Authentication Protocol”, International Journal of COMPUTER TECHNOLOGY AND APPLICATIONS, Vol.5(2), pp.546-552, March – April 2014.
[5] Vishwakarma N., Gangrade K., “Secure Image Based One Time Password”, International Journal of Science and Research, Vol.5(11), pp.680–683, November 2016.