Some results on fast algebraic attacks and higher-order non-linearities PROJECT TITLE :Some results on fast algebraic attacks and higher-order non-linearitiesABSTRACT:In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given). The authors then show that the fast algebraic immunity of the following two classes of Boolean functions is not good: (a) The repaired functions of the Tu-Deng function proposed by Carlet. The Tu-Deng function has optimum algebraic degree, optimum algebraic immunity and a very good non-linearity. However, it is weak against fast algebraic attacks. Carlet found this weakness and also tried to repair it. (b) An infinite class of balanced functions proposed by Tang et al., having optimum algebraic degree, optimum algebraic immunity and a very high non-linearity. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Non-linear error detection for elliptic curve cryptosystems Security evaluation of application-specific integrated circuits and field programmable gate arrays against setup time violation attacks
