Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331125 | Information Processing Letters | 2014 | 9 Pages |
Abstract
We identify zero-correlation linear approximations over 16 rounds of HIGHT. Based upon those, we attack 27-round HIGHT (round 4 to round 30) with improved time complexity and practical memory requirements. This attack of ours is the best result on HIGHT to date in the classical single-key setting. We also provide the first attack on 26-round HIGHT (round 4 to round 29) with the full whitening key.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Long Wen, Meiqin Wang, Andrey Bogdanov, Huaifeng Chen,