Round Addition Using Faults for Generalized Feistel Network

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Yoshikawa Hideki

  Faculty Of Engineering Tohoku Gakuin University

• KAMINAGA Masahiro

  Faculty of Engineering, Tohoku Gakuin University

• SHIKODA Arimitsu

  Faculty of Engineering, Tohoku Gakuin University

関連論文

• Theoretical Analysis of Bit Error Probability for 4-State Convolutional Code with Max-Log MAP Decoding
• Round Addition Using Faults for Generalized Feistel Network
• Round Addition DFA on 80-bit Piccolo and TWINE

スポンサーリンク