Name
Title | ||
|---|---|---|
Improved Key Recovery Attack on Round-reduced Hierocrypt-L1 in the Single-Key Setting. |
Abstract | ||
|---|---|---|
Hierocrypt-L1 is a 64-bit block cipher with a 128-bit key. It was selected among the Japanese e-Government 2003 recommended ciphers list and has been reselected in the 2013 candidate recommended ciphers list. In this work, we cryptanalyze Hierocrypt-L1 in the single-key setting. In particular, we construct a 5 S-box layers distinguisher that we utilize to launch a meet-in-the-middle attack on 8 S-box layers round-reduced Hierocrypt-L1 using the differential enumeration technique. Our attack allows us to recover the master key with data complexity of 249 chosen plaintexts, time complexity of 2114.8 8-Sbox layers Hierocrypt-L1 encryptions and memory complexity of 2106 64-bit blocks. Up to the authors' knowledge, this is the first cryptanalysis result that reaches 8 S-box layers of Hierocrypt-L1 in the single-key setting. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-24126-5_9 | SPACE |
Keywords | Field | DocType |
Cryptanalysis,Hierocrypt-L1,Meet-in-the-Middle attack,Differential Enumeration | Integral cryptanalysis,Boomerang attack,Key schedule,Computer science,Computer security,Interpolation attack,Theoretical computer science,Linear cryptanalysis,Slide attack,Key-recovery attack,Differential cryptanalysis | Conference |
Volume | ISSN | Citations |
9354 | 0302-9743 | 2 |
PageRank | References | Authors |
0.38 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed Abdelkhalek 0001 | 1 | 8 | 1.49 |
| Mohamed Tolba | 2 | 20 | 6.35 |
| Amr Youssef | 3 | 238 | 29.69 |