Algebraic Fault Attack of Addition Modulo 2^n
Hao Chen, Tao Wang · International Conference on Multimedia Information Networking and Security · 2013
Addition modulo 2n is one of the fastest arithmetic operations and is extensively used in stream cipher, light block cipher and hash functions as the operation is fast and nonlinear over GF(2). No algebraic fault is known against addition modulo so far. In this paper, an algebraic fault attack of addition modulo 2n is proposed. Our attack includes two different cases, in the first case recovers n-1 bits each of the input of the operation with only 10, 32, 480 random faults for n=8, 16, 32 respectively. For the second case we can at most recover n-1 bits of the operation.