Abstract
HIGHT is a lightweight block cipher proposed at CHES 2006 and included in ISO/IEC 18033-3. In this paper, we apply recently proposed biclique cryptanalysis to attack HIGHT. We show that bicliques can be constructed for 8 rounds in HIGHT, and those are used to recover the 128-bit key for the full rounds of HIGHT with the computational complexity of 2 126.4, faster than exhaustive search. This is the first single-key attack result for the full HIGHT. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Hong, D., Koo, B., & Kwon, D. (2012). Biclique attack on the full HIGHT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7259 LNCS, pp. 365–374). https://doi.org/10.1007/978-3-642-31912-9_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
