relaxed differential fault analysis of sha-3

In this paper, we propose a new method of differential fault analysis of sha-3 which is based on the differential relations of the algorithm. employing those differential relations in the fault analysis of sha-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state with 22-53 faults. we also present two improvements for the above attack which are using differential relations in reverse direction to improve that attack results and using the algebraic relations of the algorithm to provide a second way to recover the internal state of sha-3. consequently, we show that with 5-8 faults on average, sha-3’s internal state can be fully recovered.