Portal de Periódicos da CAPES

Using SAT Solving to Improve Differential Fault Analysis of Trivium

2011; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-642-23141-4_7

1865-0937

Mohamed Saied Emam Mohamed, Stanislav Bulygin, Johannes Buchmann,

Polynomial and algebraic computation

Combining different cryptanalytic methods to attack a cryptosystem became one of the hot topics in cryptanalysis. In particular, algebraic methods in side channel and differential fault analysis (DFA) attracted a lot of attention recently. In [9], Hojsík and Rudolf used DFA to recover the inner state of the stream cipher Trivium which leads to recovering the secret key. For this attack, they required 3.2 one-bit fault injections on average and 800 keystream bits. In this paper, we give an example of combining DFA attacks and algebraic attacks. We use algebraic methods to improve the DFA of Trivium [9]. Our improved DFA attack recovers the inner state of Trivium by using only 2 fault injections and only 420 keystream bits.