A Key Scheduling Algorithm Based on Dynamic Quasigroup String Transformation and All-Or-Nothing Key Derivation Function

Authors

  • Abdulkadir Hassan Disina Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.
  • Sapiee Jamel Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.
  • Muhammad Aamir Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.
  • Zahraddeen A. Pindar Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.
  • Mustafa Mat Deris Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.
  • Kamaruddin Malik Mohamad Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, 86400 Parit Raja, Batu Pahat, Johor, Malaysia.

Keywords:

Key Scheduling Algorithm, Quasigroup, Random Number Generator, String Transformation,

Abstract

Cryptographic ciphers depend on how quickly the key affects the output of the ciphers (ciphertext). Keys are traditionally generated from small size input (Seed) to a bigger size random key. Key scheduling algorithm (KSA) is the mechanism that generates and schedules all sub-keys for each round of encryption. Researches have suggested that sub-keys should be generated separately to avoid related-key attack. Similarly, the key space should be disproportionately large to resist any attack meant for secret keys. To archive that, some algorithms adopt the use of matrixes such as quasigroup, Hybrid cubes and substitution box (S-box) to generate the encryption keys. Quasigroup has other algebraic property called “Isotopism”, which literally means Different quasigroups that has the same order of elements but different arrangements. This paper proposed a Dynamic Key Scheduling Algorithm (KSA) using Isotope of a quasigroup as the dynamic substitution table. The proposed algorithm is a modification and upgrade to Allor-nothing Key Derivation Function (AKDF). To minimize the complexity of the algorithm, a method of generating Isotope from a non-associative quasigroup using one permutation is achieved. To validate the findings, non-associativity of the generated isotopes has been tested and the generated isotopes appeared to be non-associative. Furthermore, the proposed KSA algorithm will be validated using the Randomness test proposed and recommended by NIST, Avalanche and Correlation Assessment test.

Downloads

Published

2017-10-20

How to Cite

Disina, A. H., Jamel, S., Aamir, M., Pindar, Z. A., Mat Deris, M., & Mohamad, K. M. (2017). A Key Scheduling Algorithm Based on Dynamic Quasigroup String Transformation and All-Or-Nothing Key Derivation Function. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(3-5), 1–6. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2954

Issue

Vol. 9 No. 3-5: Special Issue on Software Engineering III

Section

Articles

License

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.