Welcome to the resource topic for 2013/029
Title:
Improved Differential Fault Attack on MICKEY 2.0
Authors: Subhadeep Banik, Subhamoy Maitra, Santanu Sarkar
Abstract:In this paper we describe several ideas related to Differential Fault Attack (DFA) on MICKEY 2.0, a stream cipher from eStream hardware profile. Using the standard assumptions for fault attacks, we first show that if the adversary can induce random single bit faults in the internal state of the cipher, then by injecting around 2^{16.7} faults and performing 2^{32.5} computations on an average, it is possible to recover the entire internal state of MICKEY at the beginning of the key-stream generation phase. We further consider the scenario where the fault may affect more than one (at most three) neighbouring bits and in that case we require around 2^{18.4} faults on an average to mount the DFA. We further show that if the attacker can solve multivariate equations (say, using SAT solvers) then the attack can be carried out using around 2^{14.7} faults in the single-bit fault model and 2^{16.06} faults for the multiple-bit scenario.
ePrint: https://eprint.iacr.org/2013/029
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .