Paper 2012/210

On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks

Yusong Du and Fangguo Zhang

Abstract

It has been pointed out that an n-variable Boolean function f has optimal resistance against fast algebraic attacks if and only if there does not exist a nonzero n-variable Boolean function g of degree lower than n2 such that fg=h and deg(g)+deg(h)<n. In this corresponding, we show that there does not exist an n-variable Boolean function with optimal resistance against fast algebraic attacks for most values of n.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
stream ciphersfast algebraic attacksBoolean functions
Contact author(s)
yusongdu @ hotmail com
History
2012-04-22: received
Short URL
https://ia.cr/2012/210
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/210,
      author = {Yusong Du and Fangguo Zhang},
      title = {On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/210},
      year = {2012},
      url = {https://eprint.iacr.org/2012/210}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.