Abstract
Carlet provides two bounds on the second-order nonlinearity of Boolean functions. We construct a family of Boolean functions where the first bound (the presumed weaker bound) is tight and the second bound is strictly worse than the first bound. We show that the difference between the two bounds can be made arbitrarily large.
Original language | English (US) |
---|---|
Pages (from-to) | 427-436 |
Number of pages | 10 |
Journal | International Journal of Computer Mathematics |
Volume | 94 |
Issue number | 3 |
DOIs | |
State | Published - Mar 4 2017 |
Externally published | Yes |
Bibliographical note
Funding Information:G. McGrew was supported by NSF Grant EMSW21-MCTP 0636528. J. Davis was supported by NSF Grant EMSW21-MCTP 0636528. D. Steele was supported by NSF Grant EMSW21-MCTP 0636528. K. Marsten was supported by NSF Grant EMSW21-MCTP 0636528.
Publisher Copyright:
© 2016 Informa UK Limited, trading as Taylor & Francis Group.
Keywords
- Boolean
- concatenation
- derivative
- functions
- Nonlinearity