The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Some results on fast algebraic attacks and higher-order non-linearities

Author

Summary, in English

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.

Publishing year

2012

Language

English

Pages

41-46

Publication/Series

IET Information Security

Volume

6

Issue

1

Document type

Journal article

Publisher

Institution of Engineering and Technology

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Research group

  • Crypto and Security

ISBN/ISSN/Other

  • ISSN: 1751-8717