At FSE 2014, Grosso et al. proposed LS-designs which are a family of bitslice ciphers aiming at efficient masked implementations against side-channel analysis. They also presented two specific LS-designs, namely the non-involutive cipher Fantomas and the involutive cipher Robin. The designers claimed that the longest impossible differentials of these two ciphers only span 3 rounds. In this paper, for the two ciphers, we construct 4-round impossible differentials which are one round more than the longest impossible differentials found by the designers. Furthermore, with the 4-round impossible differentials, we propose impossible differential attacks on Fantomas and Robin reduced to 6 rounds (out of the full 12/16 rounds). Both of the attacks need 2119 chosen plaintexts and 2101.81 6-round encryptions.
Xuan SHEN
National University of Defense Technology
Guoqiang LIU
National University of Defense Technology
Chao LI
National University of Defense Technology
Longjiang QU
National University of Defense Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Xuan SHEN, Guoqiang LIU, Chao LI, Longjiang QU, "Impossible Differential Cryptanalysis of Fantomas and Robin" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 5, pp. 863-866, May 2018, doi: 10.1587/transfun.E101.A.863.
Abstract: At FSE 2014, Grosso et al. proposed LS-designs which are a family of bitslice ciphers aiming at efficient masked implementations against side-channel analysis. They also presented two specific LS-designs, namely the non-involutive cipher Fantomas and the involutive cipher Robin. The designers claimed that the longest impossible differentials of these two ciphers only span 3 rounds. In this paper, for the two ciphers, we construct 4-round impossible differentials which are one round more than the longest impossible differentials found by the designers. Furthermore, with the 4-round impossible differentials, we propose impossible differential attacks on Fantomas and Robin reduced to 6 rounds (out of the full 12/16 rounds). Both of the attacks need 2119 chosen plaintexts and 2101.81 6-round encryptions.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.863/_p
Copy
@ARTICLE{e101-a_5_863,
author={Xuan SHEN, Guoqiang LIU, Chao LI, Longjiang QU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Impossible Differential Cryptanalysis of Fantomas and Robin},
year={2018},
volume={E101-A},
number={5},
pages={863-866},
abstract={At FSE 2014, Grosso et al. proposed LS-designs which are a family of bitslice ciphers aiming at efficient masked implementations against side-channel analysis. They also presented two specific LS-designs, namely the non-involutive cipher Fantomas and the involutive cipher Robin. The designers claimed that the longest impossible differentials of these two ciphers only span 3 rounds. In this paper, for the two ciphers, we construct 4-round impossible differentials which are one round more than the longest impossible differentials found by the designers. Furthermore, with the 4-round impossible differentials, we propose impossible differential attacks on Fantomas and Robin reduced to 6 rounds (out of the full 12/16 rounds). Both of the attacks need 2119 chosen plaintexts and 2101.81 6-round encryptions.},
keywords={},
doi={10.1587/transfun.E101.A.863},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Impossible Differential Cryptanalysis of Fantomas and Robin
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 863
EP - 866
AU - Xuan SHEN
AU - Guoqiang LIU
AU - Chao LI
AU - Longjiang QU
PY - 2018
DO - 10.1587/transfun.E101.A.863
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2018
AB - At FSE 2014, Grosso et al. proposed LS-designs which are a family of bitslice ciphers aiming at efficient masked implementations against side-channel analysis. They also presented two specific LS-designs, namely the non-involutive cipher Fantomas and the involutive cipher Robin. The designers claimed that the longest impossible differentials of these two ciphers only span 3 rounds. In this paper, for the two ciphers, we construct 4-round impossible differentials which are one round more than the longest impossible differentials found by the designers. Furthermore, with the 4-round impossible differentials, we propose impossible differential attacks on Fantomas and Robin reduced to 6 rounds (out of the full 12/16 rounds). Both of the attacks need 2119 chosen plaintexts and 2101.81 6-round encryptions.
ER -