Paper 2009/134

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

Yindong Chen and 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
Published elsewhere. Unknown where it was published
Keywords
stream cipheralgebraic attacksBoolean functionalgebraic immunity
Contact author(s)
chenyd @ fudan edu cn
History
2009-03-27: received
Short URL
https://ia.cr/2009/134
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2009/134}},
      url = {https://eprint.iacr.org/2009/134}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.