Name
Abstract | ||
|---|---|---|
Bel-T is the national block cipher encryption standard of the Republic of Belarus. It operates on 128-bit blocks and uses either 128, 192 or 256-bit keys. Bel-T combines a Feistel network with a Lai-Massey scheme and it has a complex round function with 7 S-box layers. In this work, we use a Mixed Integer Linear Programming (MILP) approach to find a a related-key differential characteristic that extends for 4 rounds and 5 S-box layers (4(5/7) rounds) with probability higher than 2(-128). To build an MILP model of Bel-T that a solver can practically handle, we use a partial Difference Distribution Table (DDT) based on the Hamming weight of the input and output differences. The identified differential characteristic is used to mount a key recovery attack on 5 rounds and 6 S-box layers (5(6/7) out of 8 rounds) of Bel-T-256 with 2(123 : 28) chosen plaintexts and 2(228 : 4) encryptions. According to the best of our knowledge, this is the first public cryptanalysis of Bel-T in the black-box attack model. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transfun.E101.A.859 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
related-key, differential cryptanalysis, Bel-T | Discrete mathematics,Mathematics,Calculus | Journal |
Volume | Issue | ISSN |
E101A | 5 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed Abdelkhalek | 1 | 11 | 4.17 |
| Mohamed Tolba | 2 | 20 | 6.35 |
| Amr M. Youssef | 3 | 41 | 10.68 |