Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity.

James McLaughlin; John A.  Clark

Paper 2013/011 Original: eprint.iacr.org/2013/011 ↗

Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity.

James McLaughlin

John A. Clark

Abstract

Using simulated annealing, we derive several equivalence classes of balanced Boolean functions with optimum algebraic immunity, fast algebraic resistance, and maximum possible algebraic degree. For numbers n of input bits less than 16, these functions also possess superior nonlinearity to all Boolean functions so far obtained with said properties.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2013-01-12: last updated; 2013-01-12: published
Short URL: https://ia.cr/2013/011
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2013/011,
      author = {James McLaughlin and John A.  Clark},
      title = {Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity.},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/011},
      year = {2013},
      url = {https://eprint.iacr.org/2013/011}
}