Volume 16, Issue 3 (2016)
MJEE 2016, 16(3): 24-28 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Shakiba M, Dakhilalian M, Mala H. Impossible Differential Cryptanalysis of 3D Block Cipher. MJEE 2016; 16 (3) :24-28
URL: http://mjee.modares.ac.ir/article-17-1451-en.html
URL: http://mjee.modares.ac.ir/article-17-1451-en.html
1- Jundi-Shapur University of Technology, Department of Electrical & Computer Engineering
2- Department of Electrical and Computer Engineering, Isfahan University of Technology
3- University of Isfahan
2- Department of Electrical and Computer Engineering, Isfahan University of Technology
3- University of Isfahan
Abstract: (4730 Views)
3D is a secret-key block cipher, designed to secure and fast encryption of large amounts of data. This block cipher
uses multi-dimensional states to generalize the design of Rijndael. Thus, while maintaining the benefits of the AES design, 3D operates on 512-bit blocks of data and can also be used as a cryptographic primitive in the cryptographic systems with the large internal states. Since its proposal in 2008, the cryptanalysis of 3D has been considered in several papers. While the previous impossible differential attacks on 3D cipher can analyze up to 10 rounds of the cipher, this paper, using a new 6-round impossible differential, presents an impossible differential attack on 11 rounds of 3D. The proposed distinguisher begins in the input of AddRoundKey operation of round 3, and ends in the output of ShiftRows of round 8. Results show that the proposed attack on 11-round of 3D cipher requires about 2501 chosen plaintexts and a time complexity of about 2495 11-round encryptions.
uses multi-dimensional states to generalize the design of Rijndael. Thus, while maintaining the benefits of the AES design, 3D operates on 512-bit blocks of data and can also be used as a cryptographic primitive in the cryptographic systems with the large internal states. Since its proposal in 2008, the cryptanalysis of 3D has been considered in several papers. While the previous impossible differential attacks on 3D cipher can analyze up to 10 rounds of the cipher, this paper, using a new 6-round impossible differential, presents an impossible differential attack on 11 rounds of 3D. The proposed distinguisher begins in the input of AddRoundKey operation of round 3, and ends in the output of ShiftRows of round 8. Results show that the proposed attack on 11-round of 3D cipher requires about 2501 chosen plaintexts and a time complexity of about 2495 11-round encryptions.
Received: 2017/10/23 | Accepted: 2016/10/1 | Published: 2017/10/23
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |