Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits
Symmetric block ciphers are the most widely utilized cryptographic primitives. Since block ciphers provide privacy; block ciphers are hence used as core components for the construction of hash functions such as one-way compression functions and pseudorandom number generators, all as part of several...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
School of Computing, UUM College of Arts and Sciences
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/64457/ http://psasir.upm.edu.my/id/eprint/64457/1/PID169-722-728e.pdf |
| _version_ | 1848855007633342464 |
|---|---|
| author | Hussien, Hassan Mansour Muda, Zaiton Md. Yasin, Sharifah |
| author_facet | Hussien, Hassan Mansour Muda, Zaiton Md. Yasin, Sharifah |
| author_sort | Hussien, Hassan Mansour |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Symmetric block ciphers are the most widely utilized cryptographic primitives. Since block ciphers provide privacy; block ciphers are hence used as core components for the construction of hash functions such as one-way compression functions and pseudorandom number generators, all as part of several cryptographic protocols, etc. These days the most common block cipher is the AES Rijndael, which is used as a standard of symmetric encryption in many countries. Several studies have shown a theoretical attack exploiting the AES key expansion algorithm which allows significant reduction in the complexity time to break the cipher, compared to the brute force attack. The arrack in the related-key model and the long biclique with a meet in the middle attacks in the secret-key model are applied on the AES because of the weak key expansion function. Authors of AES accepted that the key expansion function of Rijndael is comparatively weak. Confusion and diffusion are two properties of the operation a secure cipher. Therefore, although the two properties within the substitution-permutation construct are only applied to state the transformation round function of the Rijndael algorithm, but there is no other strong security for the key expansion function. This article, hence presents a method to improve the Key Schedule of the Rijndael cipher in order to maintain the requirement of bits confusion and diffusion properties besides making the cipher more resistance to differential cryptanalysis. |
| first_indexed | 2025-11-15T11:18:55Z |
| format | Conference or Workshop Item |
| id | upm-64457 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:18:55Z |
| publishDate | 2017 |
| publisher | School of Computing, UUM College of Arts and Sciences |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-644572018-07-05T09:35:09Z http://psasir.upm.edu.my/id/eprint/64457/ Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits Hussien, Hassan Mansour Muda, Zaiton Md. Yasin, Sharifah Symmetric block ciphers are the most widely utilized cryptographic primitives. Since block ciphers provide privacy; block ciphers are hence used as core components for the construction of hash functions such as one-way compression functions and pseudorandom number generators, all as part of several cryptographic protocols, etc. These days the most common block cipher is the AES Rijndael, which is used as a standard of symmetric encryption in many countries. Several studies have shown a theoretical attack exploiting the AES key expansion algorithm which allows significant reduction in the complexity time to break the cipher, compared to the brute force attack. The arrack in the related-key model and the long biclique with a meet in the middle attacks in the secret-key model are applied on the AES because of the weak key expansion function. Authors of AES accepted that the key expansion function of Rijndael is comparatively weak. Confusion and diffusion are two properties of the operation a secure cipher. Therefore, although the two properties within the substitution-permutation construct are only applied to state the transformation round function of the Rijndael algorithm, but there is no other strong security for the key expansion function. This article, hence presents a method to improve the Key Schedule of the Rijndael cipher in order to maintain the requirement of bits confusion and diffusion properties besides making the cipher more resistance to differential cryptanalysis. School of Computing, UUM College of Arts and Sciences 2017 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/64457/1/PID169-722-728e.pdf Hussien, Hassan Mansour and Muda, Zaiton and Md. Yasin, Sharifah (2017) Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits. In: 6th International Conference on Computing and Informatics (ICOCI 2017), 25-27 Apr. 2017, Kuala Lumpur, Malaysia. (pp. 722-728). |
| spellingShingle | Hussien, Hassan Mansour Muda, Zaiton Md. Yasin, Sharifah Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title | Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title_full | Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title_fullStr | Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title_full_unstemmed | Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title_short | Enhance the robustness of secure Rijndael key expansion function based on increment confusion and diffusion bits |
| title_sort | enhance the robustness of secure rijndael key expansion function based on increment confusion and diffusion bits |
| url | http://psasir.upm.edu.my/id/eprint/64457/ http://psasir.upm.edu.my/id/eprint/64457/1/PID169-722-728e.pdf |