A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity

Yindong Chen; Peizhong Lu

Paper 2009/134 Original: eprint.iacr.org/2009/134 ↗

A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity

Yindong Chen

Peizhong Lu

Abstract

This paper proposed a first order recursive construction of Boolean function with optimum algebraic immunity. We also show that the Boolean functions are balanced and have good algebraic degrees.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2009-03-27: last updated; 2009-03-27: published
Short URL: https://ia.cr/2009/134
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2009/134,
      author = {Yindong Chen and Peizhong Lu},
      title = {A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/134},
      year = {2009},
      url = {https://eprint.iacr.org/2009/134}
}