Paper 2007/117
Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity
Sihem Mesnager
Abstract
The recent algebraic attacks have received a lot of attention in
cryptographic literature. The algebraic immunity of a Boolean
function quantifies its resistance to the standard algebraic attacks
of the pseudo-random generators using it as a nonlinear filtering or
combining function. Very few results have been found concerning its
relation with the other cryptographic parameters or with the
Note: I have made several (and important) modifications of my paper that improves the overall presentation. I would like that this version replace the one that I have put on your website. Sincerely yours,
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- stream cipherblock cipheralgebraic attackBoolean functionalgebraic immunityalgebraic degreehigher order nonlinearityannihilator
- Contact author(s)
- hachai @ math jussieu fr
- History
- 2007-08-03: revised
- 2007-04-03: received
- See all versions
- Short URL
- https://ia.cr/2007/117
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/117, author = {Sihem Mesnager}, title = {Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/117}, year = {2007}, url = {https://eprint.iacr.org/2007/117} }