A key scheduling algorithm is the mechanism that generates and schedules all session-keys for the encryption and decryption process. The key space of conventional key schedule algorithm using the 2D hybrid cubes is no...
详细信息
A key scheduling algorithm is the mechanism that generates and schedules all session-keys for the encryption and decryption process. The key space of conventional key schedule algorithm using the 2D hybrid cubes is not enough to resist attacks and could easily be exploited. In this regard, this research proposed a new key schedule algorithm based on coordinate geometry of a Hybrid Cube (KSAHC) using Triangular Coordinate Extraction (TCE) technique and 3-Dimensional (3D) rotation of Hybrid Cube surface (HCs) for the block cipher to achieve large key space that are more applicable to resist any attack on the secret key. The strength of the keys and ciphertext are tested using the Hybrid Cube Encryption algorithm (HiSea) based on Brute Force, entropy, correlation assessment, avalanche effect and NIST randomness test suit which proves the proposed algorithm is suitable for the block cipher. The results show that the proposed KSAHC algorithm has performed better than existing algorithms and we remark that our proposed model may find potential applications in information security systems.
Many ciphers suffer from weak-key issues. This problem is due to the simplicity of the key schedule algorithm. Unfortunately, the cipher designers have not paid much attention to the sub-keys generation as the cipher ...
详细信息
Many ciphers suffer from weak-key issues. This problem is due to the simplicity of the key schedule algorithm. Unfortunately, the cipher designers have not paid much attention to the sub-keys generation as the cipher itself. Thus, any attacker can find many attractive properties between sub-keys such as statistical pattern, linearity, low avalanche criteria, etc. Many ciphers use a large key during encryption (e.g. 128 bits). This makes it practically impossible to test all keys, allowing all of today's ciphers to be potentially vulnerable to the weak-key issue, including AES. Accordingly, this paper sheds light on the advantage of using chaos in sub-keys generation by developing a new key schedule algorithm based on the logistic maps. We name this algorithm CKSA. Compared to several existing key schedule algorithm, CKSA provides a good avalanche effect. It is a one-way function, and its size is flexible, i.e. the size of the sub-keys is not fixed, which allows to many ciphers the possibility of using it. Further, CKSA ensures confusion and diffusion. It resists differential attacks and avoids linear key correlation between sub-keys while ensuring a high degree of randomization among them. (C) 2019 Elsevier Ltd. All rights reserved.
The success and safety of block cipher systems heavily depend on how efficient and secure their key schedule algorithms (KSAs) are, especially when fighting against cryptanalytic attacks. This paper proposes a novel K...
详细信息
The internet of things (IoT) ensures flexible network services to the end devices connected to it. Although security has always been a concern for such networks. There are several effective cryptographic protocols int...
详细信息
暂无评论