Related-key impossible differential cryptanalysis of full-round HIGHT

Rostami, Saeed; Bamohabbat Chafjiri, Sadegh; Tabatabaei, Seyed Amir Hossein

Abstract

The HIGHT algorithm is a 64-bit block cipher with 128-bit key length, at CHES'06 as a lightweight cryptographic algorithm. In this paper, a new related-key impossible differential attack on the full-round algorithm is introduced. Our cryptanalysis requires time complexity of 2 127.276 HIGHT evaluations which is slightly faster than exhaustive search attack. This is the first related-key impossible differential cryptanalysis on the full-round HIGHT block cipher.

Citation

Rostami, S., Bamohabbat Chafjiri, S., & Tabatabaei, S. A. H. (2015). Related-key impossible differential cryptanalysis of full-round HIGHT. In 2013 International Conference on Security and Cryptography (SECRYPT) (1-6)

• Conference Name: 2013 International Conference on Security and Cryptography (SECRYPT)
• Conference Location: Reykjavik, Iceland
• Start Date: Jul 29, 2013
• End Date: Jul 31, 2013
• Publication Date: Aug 27, 2015
• Deposit Date: Dec 8, 2022
• Publicly Available Date: Dec 9, 2022
• Publisher: Institute of Electrical and Electronics Engineers (IEEE)
• Pages: 1-6
• Book Title: 2013 International Conference on Security and Cryptography (SECRYPT)
• Keywords: Ciphers, Encryption, Schedules, Time complexity, HIGHT, Lightweight Block Cipher, Related-key, Impossible Differential, Cryptanalysis
• Public URL: https://uwe-repository.worktribe.com/output/10224593
• Publisher URL: https://ieeexplore.ieee.org/abstract/document/7223212
• Related Public URLs: https://ieeexplore.ieee.org/xpl/conhome/7174743/proceeding