A Scheme to Passcode Generation

A Scheme to Passcode Generation

A passcode is a password usually used to receive permission to access a system. It is a combination of 4 or 6 digits or alphanumerics. Generating a passcode may be done by simply guessing the combination using, for instance, a birthdate, street address, pet’s name. The said approach is straightforward and easy to memorize. This study uses the procedures for generating a passcode by gene encoding. Gene encoding is a framework of a synthetic community that they mingle around, get married, and have children. The data of who is who and whose offspring it is are the critical data that lead to a passcode creation. We use a set of information in the form of thumbprints belong to ten participants. There was a balanced ratio between male and female participants whose age range from 20 to 26 years old. All participants have had no thumbprint trauma. The data was gene encoded. It has created a new community of families of two parents and a child. The child’s personality becomes the basis for the passcode generation. The developed passcodes relate the owner’s biographic and biometric data. The results suggest that the outcomes of the algorithm able to produce the strongest to the weakest passcodes. The method has its strength in giving solutions from selective procedures. It is the artist’s total control on how the algorithm would run the processes. Therefore, the steps in constructing the codes discussed in this work are mere guidelines for generating passcodes.

___

  • J. Ding, S. Alsayigh, J. Lancrenon, S. RV, and M. Snook, "Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World," in Topics in Cryptology – CT-RSA 2017: The Cryptographers’ Track at the RSA Conference 2017, San Francisco, CA, USA, February 14–17, 2017, Proceedings, H. Handschuh, Ed., ed Cham: Springer International Publishing, 2017, pp. 183-204.
  • C.-M. Chen, W. Fang, K.-H. Wang, and T.-Y. Wu, "Comments on “An improved secure and efficient password and chaos-based two-party key agreement protocol”," Nonlinear Dynamics, vol. 87, pp. 2073-2075, February 01 2017.
  • M. S. Farash and M. A. Attari, "An efficient and provably authenticated key exchange protocol based on Chebyshev chaotic maps," Nonlinear Dynamics, vol. 77, pp. 399-411, July 01 2014. password-based
  • X. Guo and J. Zhang, "Secure group key agreement protocol based on chaotic Hash," Information Sciences, vol. 180, pp. 4069-4074, 2010/10/15/ 2010.
  • T.-F. Lee, "Enhancing the security of password authenticated key agreement protocols based on chaotic maps," Information Sciences, vol. 290, pp. 63-71, 2015/01/01/ 2015.
  • J. W. Kalat, Introduction to psychology: Nelson Education, 2016.
  • A. Y. Bani Hashim, "Development of Artificial Intelligent Control," Universiti Putra Malaysia, 2002. for Manipulator Position
  • H. Ismail and K. Hon, "The nesting of two-dimensional shapes using genetic algorithms," Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, vol. 209, pp. 115-124, 1995.
  • J. Psarras, "GA-based decision support systems in production intelligent systems technologies and applications, vol. 2, pp. 58-76, 2006. International journal of
  • A. Y. Bani Hashim, "Representing System by Gene Encoding," International Journal of Research and Reviews in Computer Science, vol. 2, pp. 247-249, 2011.
  • W. Wang and P. Brunn, "An effective genetic algorithm for job shop scheduling," Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, vol. 214, pp. 293-300, 2000.
  • G. Liu, X. Jiang, and L. Wen, "A clustering system for gene expression data based upon genetic programming and the HS-model," in Computational Science and Optimization (CSO), 2010 Third International Joint Conference on, 2010, pp. 238-241.
  • Y. Chen, C. J. Tang, R. Li, M. F. Zhu, C. Li, and J. Zuo, "Reduced-GEP: programming by gene reduction," in Intelligent Human- Machine Systems and Cybernetics (IHMSC), 2010 2nd International Conference on, 2010, pp. 176-179.