Paper 2009/272 Original: eprint.iacr.org/2009/272 ↗
A Conjecture on Binary String and Its Applications on Constructing Boolean Functions of Optimal Algebraic Immunity
Abstract
In this paper, we propose a combinatoric conjecture on binary string, on the premise that our conjecture is correct we mainly obtain two classes of functions which are both algebraic immunity optimal: the first class of functions are also bent, moreover, from this fact we conclude that the algebraic immunity of bent functions can take all possible values except one. The second class are balanced functions, which have optimal algebraic degree and the best nonlinearity up to now.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2009-06-09: last updated
- 2009-06-09: published
- Short URL
- https://ia.cr/2009/272
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/272,
author = {Ziran Tu and Yingpu Deng},
title = {A Conjecture on Binary String and Its Applications on Constructing Boolean Functions of Optimal Algebraic Immunity},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/272},
year = {2009},
url = {https://eprint.iacr.org/2009/272}
}