Round Addition Using Faults for Generalized Feistel Network
Summary :
This article presents a differential fault analysis (DFA) technique using round addition for a generalized Feistel network (GFN) including CLEFIA and RC6. Here the term “round addition” means that the round operation executes twice using the same round key. The proposed DFA needs bypassing of an operation to count the number of rounds such as increment or decrement. To verify the feasibility of our proposal, we implement several operations, including increment and decrement, on a microcontroller and experimentally confirm the operation bypassing. The proposed round addition technique works effectively for the generalized Feistel network with a partial whitening operation after the last round. In the case of a 128-bit CLEFIA, we show a procedure to reconstruct the round keys or a secret key using one correct ciphertext and two faulty ciphertexts. Our DFA also works for DES and RC6.
- Publication
- IEICE TRANSACTIONS on Information Vol.E96-D No.1 pp.146-150
- Publication Date
- 2013/01/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E96.D.146
- Type of Manuscript
- LETTER
- Category
- Dependable Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hideki YOSHIKAWA, Masahiro KAMINAGA, Arimitsu SHIKODA, "Round Addition Using Faults for Generalized Feistel Network" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 1, pp. 146-150, January 2013, doi: 10.1587/transinf.E96.D.146.
Abstract: This article presents a differential fault analysis (DFA) technique using round addition for a generalized Feistel network (GFN) including CLEFIA and RC6. Here the term “round addition” means that the round operation executes twice using the same round key. The proposed DFA needs bypassing of an operation to count the number of rounds such as increment or decrement. To verify the feasibility of our proposal, we implement several operations, including increment and decrement, on a microcontroller and experimentally confirm the operation bypassing. The proposed round addition technique works effectively for the generalized Feistel network with a partial whitening operation after the last round. In the case of a 128-bit CLEFIA, we show a procedure to reconstruct the round keys or a secret key using one correct ciphertext and two faulty ciphertexts. Our DFA also works for DES and RC6.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.146/_p
Copy
@ARTICLE{e96-d_1_146,
author={Hideki YOSHIKAWA, Masahiro KAMINAGA, Arimitsu SHIKODA, },
journal={IEICE TRANSACTIONS on Information},
title={Round Addition Using Faults for Generalized Feistel Network},
year={2013},
volume={E96-D},
number={1},
pages={146-150},
abstract={This article presents a differential fault analysis (DFA) technique using round addition for a generalized Feistel network (GFN) including CLEFIA and RC6. Here the term “round addition” means that the round operation executes twice using the same round key. The proposed DFA needs bypassing of an operation to count the number of rounds such as increment or decrement. To verify the feasibility of our proposal, we implement several operations, including increment and decrement, on a microcontroller and experimentally confirm the operation bypassing. The proposed round addition technique works effectively for the generalized Feistel network with a partial whitening operation after the last round. In the case of a 128-bit CLEFIA, we show a procedure to reconstruct the round keys or a secret key using one correct ciphertext and two faulty ciphertexts. Our DFA also works for DES and RC6.},
keywords={},
doi={10.1587/transinf.E96.D.146},
ISSN={1745-1361},
month={January},}
Copy
TY - JOUR
TI - Round Addition Using Faults for Generalized Feistel Network
T2 - IEICE TRANSACTIONS on Information
SP - 146
EP - 150
AU - Hideki YOSHIKAWA
AU - Masahiro KAMINAGA
AU - Arimitsu SHIKODA
PY - 2013
DO - 10.1587/transinf.E96.D.146
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2013
AB - This article presents a differential fault analysis (DFA) technique using round addition for a generalized Feistel network (GFN) including CLEFIA and RC6. Here the term “round addition” means that the round operation executes twice using the same round key. The proposed DFA needs bypassing of an operation to count the number of rounds such as increment or decrement. To verify the feasibility of our proposal, we implement several operations, including increment and decrement, on a microcontroller and experimentally confirm the operation bypassing. The proposed round addition technique works effectively for the generalized Feistel network with a partial whitening operation after the last round. In the case of a 128-bit CLEFIA, we show a procedure to reconstruct the round keys or a secret key using one correct ciphertext and two faulty ciphertexts. Our DFA also works for DES and RC6.
ER -
English
