A novel differential fault analysis using two‐byte fault model on AES Key schedule
Jinbao Zhang, Ning Wu, Jianhua Li, Zhou Fang
Abstract
Jinbao Zhang, Ning Wu, Jianhua Li, Zhou Fang
Abstract
One of the well‐known physical attacks, i.e. differential fault analysis (DFA), can break the secret key of cryptographic device by using differential information between faulty and correct ciphertexts. Here, the authors propose a random 2‐byte fault model, present a novel DFA on AES key schedule, and show how an entire AES‐128 key can be cracked by using two pairs of faulty and correct ciphertexts. By inducing a random 2‐byte fault in the first column of 9th round key with discontiguous rows, the authors can obtain 64 bits of AES‐128 key using one pair of faulty and correct ciphertexts, two pairs of them can retrieve the entire 128‐bit key without exhaustive search. The authors implement the proposed attack on HP Intel(R) Core i5‐7300HQ Quad‐Core 2.5 GHz CPU, 8G RAM. It takes <2 min on average to break the key. Considering the number of faulty ciphertexts, fault‐induced depth, and fault model, authors’ attack is the most efficient DFA as compared to existing schemes on AES‐128 key schedule.
OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
One of the well‐known physical attacks, i.e. differential fault analysis (DFA), can break the secret key of cryptographic device by using differential information between faulty and correct ciphertexts. Here, the authors propose a random 2‐byte fault model, present a novel DFA on AES key schedule, and show how an entire AES‐128 key can be cracked by using two pairs of faulty and correct ciphertexts. By inducing a random 2‐byte fault in the first column of 9th round key with discontiguous rows, the authors can obtain 64 bits of AES‐128 key using one pair of faulty and correct ciphertexts, two pairs of them can retrieve the entire 128‐bit key without exhaustive search. The authors implement the proposed attack on HP Intel(R) Core i5‐7300HQ Quad‐Core 2.5 GHz CPU, 8G RAM. It takes <2 min on average to break the key. Considering the number of faulty ciphertexts, fault‐induced depth, and fault model, authors’ attack is the most efficient DFA as compared to existing schemes on AES‐128 key schedule.
Key concepts: Byte, Key (lock), Computer science, Key schedule, Advanced Encryption Standard, Fault (geology), Cryptography, Schedule