Issue No. 06 - June (2015 vol. 64)
Santanu Sarkar , , Chennai Mathematical Institute, Chennai, India
Subhadeep Banik , Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata
Subhamoy Maitra , Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata
The series of published works, related to differential fault attack (DFA) against the Grain family, require quite a large number (hundreds) of faults and also several assumptions on the locations and the timings of the faults injected. In this paper, we present a significantly improved scenario from the adversarial point of view for DFA against the Grain family of stream ciphers. Our model is the most realistic one so far as it considers that the cipher has to be re-keyed only a few times and faults can be injected at any random location and at any random point of time, i.e., no precise control is needed over the location and timing of fault injections. We construct equations based on the algebraic description of the cipher by introducing new variables so that the degrees of the equations do not increase. In line of algebraic cryptanalysis, we accumulate such equations based on the fault-free and faulty key-stream bits and solve them using the SAT Solver Cryptominisat-2.9.5 installed with SAGE 5.7. In a few minutes we can recover the state of Grain v1, Grain-128 and Grain-128a with as little as 10, 4 and 10 faults respectively.
Ciphers, Equations, Timing, Mathematical model, Registers, Hardware,stream cipher, Differential fault attack, Grain v1, Grain-128, Grain-128a, LFSR, NFSR, SAT solver
Santanu Sarkar, Subhadeep Banik, Subhamoy Maitra, "Differential Fault Attack against Grain Family with Very Few Faults and Minimal Assumptions", IEEE Transactions on Computers, vol. 64, no. , pp. 1647-1657, June 2015, doi:10.1109/TC.2014.2339854