Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

On various nonlinearity measures for boolean functions

Published

Author(s)

Joan Boyar, Magnus G. Find, Rene Peralta

Abstract

A necessary condition for the security of cryptographic functions is to be "sufficiently distant" from linear, and cryptographers have proposed several measures for this distance. We show that six common measures, nonlinearity, algebraic degree, annihilator immunity, algebraic thickness, normality, and multiplicative complexity, are incomparable in the sense that for each pair of measures, mu_1,mu_2, there exist functions f_1,f_2 with f_1 being more nonlinear than f_2 according to \mu_1, but less nonlinear according to \mu_2. We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions.
Citation
Cryptography and Communication
Volume
8
Issue
3

Keywords

nonlinearity, cryptography, boolean functions, algebraic degree, annihilator immunity, collision-free, thickness, normality

Citation

Boyar, J. , Find, M. and Peralta, R. (2016), On various nonlinearity measures for boolean functions, Cryptography and Communication, [online], https://doi.org/10.1007/s12095-015-0150-9, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=921030 (Accessed June 16, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created May 18, 2016, Updated October 12, 2021