Paper 2005/449
On the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count
Longjiang Qu, Guozhu Feng, and Chao Li
Abstract
This paper gives a construction method which can get a large class
of Boolean functions with maximum algebraic immunity(AI) from one
such giving function. Our constructions get more functions than any
previous construction. The cryptographic properties, such as
balance, algebraic degree etc, of those functions are studied. It
shows that we can construct Boolean functions with better
cryptographic properties, which gives the guidance for the design of
Boolean functions to resist algebraic attack, and helps to design
good cryptographic primitives of cryptosystems. From these
constructions, we show that the count of the Boolean functions with
maximum AI is bigger than
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Algebraic AttackAlgebraic DegreeAlgebraic ImmunityAnnihilatorBalanceBoolean Functions
- Contact author(s)
- ljqu_happy @ hotmail com
- History
- 2006-04-08: revised
- 2005-12-14: received
- See all versions
- Short URL
- https://ia.cr/2005/449
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/449, author = {Longjiang Qu and Guozhu Feng and Chao Li}, title = {On the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count}, howpublished = {Cryptology {ePrint} Archive, Paper 2005/449}, year = {2005}, url = {https://eprint.iacr.org/2005/449} }