Efficient DFA on SPN-Based Block Ciphers and Its Application to the LED Block Cipher

Rei UENO; Naofumi HOMMA; Takafumi AOKI

doi:10.1587/transfun.E98.A.182

IEICE TRANSACTIONS on Fundamentals

Efficient DFA on SPN-Based Block Ciphers and Its Application to the LED Block Cipher

Rei UENO, Naofumi HOMMA, Takafumi AOKI

Full Text Views

0

Cite this

Summary :

This paper presents an efficient method for differential fault analysis (DFA) on substitution-permutation network (SPN)-based block ciphers. A combination of a permutation cancellation and an algebraic key filtering technique makes it possible to reduce the computational cost of key filtering significantly and therefore perform DFAs with new fault models injected at an earlier round, which defeats conventional countermeasures duplicating or recalculating the rounds of interest. In this paper, we apply the proposed DFA to the LED block cipher. Whereas existing DFAs employ fault models injected at the 30th round, the proposed DFA first employs a fault model injected at the 29th round. We demonstrate that the proposed DFA can obtain the key candidates with only one pair of correct and faulty ciphertexts in about 2.1h even from the 29th round fault model and the resulting key space is reduced to 2^4.04

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.1 pp.182-191

Publication Date: 2015/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.182

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Foundation

Authors

Rei UENO
  Tohoku University
Naofumi HOMMA
  Tohoku University
Takafumi AOKI
  Tohoku University

Keyword

differential fault analysis, fault injection attack, substitution-permutation network, LED block cipher, lightweight cryptography

Cite this

Copy

Rei UENO, Naofumi HOMMA, Takafumi AOKI, "Efficient DFA on SPN-Based Block Ciphers and Its Application to the LED Block Cipher" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 1, pp. 182-191, January 2015, doi: 10.1587/transfun.E98.A.182.
Abstract: This paper presents an efficient method for differential fault analysis (DFA) on substitution-permutation network (SPN)-based block ciphers. A combination of a permutation cancellation and an algebraic key filtering technique makes it possible to reduce the computational cost of key filtering significantly and therefore perform DFAs with new fault models injected at an earlier round, which defeats conventional countermeasures duplicating or recalculating the rounds of interest. In this paper, we apply the proposed DFA to the LED block cipher. Whereas existing DFAs employ fault models injected at the 30th round, the proposed DFA first employs a fault model injected at the 29th round. We demonstrate that the proposed DFA can obtain the key candidates with only one pair of correct and faulty ciphertexts in about 2.1h even from the 29th round fault model and the resulting key space is reduced to 2^4.04
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.182/_p

Copy

@ARTICLE{e98-a_1_182,
author={Rei UENO, Naofumi HOMMA, Takafumi AOKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient DFA on SPN-Based Block Ciphers and Its Application to the LED Block Cipher},
year={2015},
volume={E98-A},
number={1},
pages={182-191},
abstract={This paper presents an efficient method for differential fault analysis (DFA) on substitution-permutation network (SPN)-based block ciphers. A combination of a permutation cancellation and an algebraic key filtering technique makes it possible to reduce the computational cost of key filtering significantly and therefore perform DFAs with new fault models injected at an earlier round, which defeats conventional countermeasures duplicating or recalculating the rounds of interest. In this paper, we apply the proposed DFA to the LED block cipher. Whereas existing DFAs employ fault models injected at the 30th round, the proposed DFA first employs a fault model injected at the 29th round. We demonstrate that the proposed DFA can obtain the key candidates with only one pair of correct and faulty ciphertexts in about 2.1h even from the 29th round fault model and the resulting key space is reduced to 2^4.04},
keywords={},
doi={10.1587/transfun.E98.A.182},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Efficient DFA on SPN-Based Block Ciphers and Its Application to the LED Block Cipher
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 182
EP - 191
AU - Rei UENO
AU - Naofumi HOMMA
AU - Takafumi AOKI
PY - 2015
DO - 10.1587/transfun.E98.A.182
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2015
AB - This paper presents an efficient method for differential fault analysis (DFA) on substitution-permutation network (SPN)-based block ciphers. A combination of a permutation cancellation and an algebraic key filtering technique makes it possible to reduce the computational cost of key filtering significantly and therefore perform DFAs with new fault models injected at an earlier round, which defeats conventional countermeasures duplicating or recalculating the rounds of interest. In this paper, we apply the proposed DFA to the LED block cipher. Whereas existing DFAs employ fault models injected at the 30th round, the proposed DFA first employs a fault model injected at the 29th round. We demonstrate that the proposed DFA can obtain the key candidates with only one pair of correct and faulty ciphertexts in about 2.1h even from the 29th round fault model and the resulting key space is reduced to 2^4.04
ER -

IEICE TRANSACTIONS on Fundamentals