Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Publiceringsår

2012

Språk

Engelska

Sidor

41-46

Publikation/Tidskrift/Serie

IET Information Security

Volym

6

Issue

1

Dokumenttyp

Artikel i tidskrift

Förlag

Institution of Engineering and Technology

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Forskningsgrupp

  • Crypto and Security

ISBN/ISSN/Övrigt

  • ISSN: 1751-8717