Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube

Mushtaq, Muhammad Faheem (2019) Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube. Doctoral thesis, Universiti Tun Hussein Onn Malaysia.


Download (858kB) | Preview
[img] Text (Copyright Delaration)
Restricted to Repository staff only

Download (3MB) | Request a copy
[img] Text (Full Text)
Restricted to Registered users only

Download (4MB) | Request a copy


Cryptographic algorithms play an important role in information security where it ensures the security of data across the network or storage. A key schedule algorithm is the mechanism that generates and schedules all session-keys for the encryption process. The 2-dimensional hybrid cube is generated based on permutation and combination of integer numbers that are utilized in the construction of encryption and decryption key in the non-binary block cipher. The generation of key space by using the 2-dimensional hybrid cubes are not sufficient to resist attacks and could easily be exploited. Therefore, the large key space is more desirable to resist any attack on the secret key. This research proposed a new Key Schedule Algorithm based on the coordinate geometry of a Hybrid Cube (KSAHC) for the non-binary block cipher. By using the three-dimensional hybrid cube in KSAHC transformation, encryption keys are represented as n × n × n matrix of integer numbers and used in the development of the permutation and substitution of order 4 square matrix. Triangular Coordinate Extraction (TCE) technique has also been introduced to extract the coordinates during the rotation of Hybrid Cube surface (HCs) and plays an important role in the development of KSAHC algorithm. The Hybrid Cube Encryption Algorithm (HiSea) has been implemented to validate the encryption keys that are generated from the proposed algorithm. The strength of the keys and ciphertext are compared with the Advanced Encryption Standard (AES), HiSea, and Dynamic Key Schedule Algorithm (DKSA). The proposed KSAHC algorithm has been validated using the randomness test proposed and recommended by NIST, the average result of avalanche test is 93%, entropy is 0.9968, correlation assessment test is -0.000601 and having large key space 2.70 × 1067 keys that makes the Brute Force attack difficult and time-consuming. Therefore, it can be concluded that the strength and validity of KSAHC algorithm have been enhanced as compared to other algorithms and can serve as the alternative algorithm in designing security systems.

Item Type: Thesis (Doctoral)
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Computer Science and Information Technology > Department of Software Engineering
Depositing User: Mrs. Sabarina Che Mat
Date Deposited: 22 Jun 2021 07:51
Last Modified: 22 Jun 2021 07:51

Actions (login required)

View Item View Item