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.

A note on fast algebraic attacks and higher order nonlinearities

På svenska

Author

Summary, in English

In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks. As a corollary, we find that no matter how much effort we make, the Tu-Deng functions cannot be repaired in a standard way to behave well against fast algebraic attacks. Therefore, we should give up repairing this class of Boolean functions and try to find other classes of functions with good cryptographic properties or to prove that the Carlet-Feng function behaves well.

Publishing year

2011

Language

English

Pages

404-414

Publication/Series

Lecture Notes in Computer Science

Volume

6584

Document type

Book chapter

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Boolean functions
  • Stream ciphers
  • Fast algebraic attacks
  • High order nonlinearities

Conference name

INSCRYPT 2010

Conference date

2010-10-20 - 2010-10-24

Conference place

Shanghai, China

Status

Published

Research group

  • Crypto and Security

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-642-21517-9
  • ISBN: 978-3-642-21518-6