## CryptoDB

### Paper: CCZ-equivalence and Boolean functions

Authors: Lilya Budaghyan Claude Carlet URL: http://eprint.iacr.org/2009/063 Search ePrint Search Google We study further CCZ-equivalence of $(n,m)$-functions. We prove that for Boolean functions (that is, for $m=1$), CCZ-equivalence coincides with EA-equivalence. On the contrary, we show that for $(n,m)$- functions, CCZ-equivalence is strictly more general than EA-equivalence when $n\ge5$ and $m$ is greater or equal to the smallest positive divisor of $n$ different from 1. Our result on Boolean functions allows us to study the natural generalization of CCZ-equivalence corresponding to the CCZ-equivalence of the indicators of the graphs of the functions. We show that it coincides with CCZ-equivalence.
##### BibTeX
@misc{eprint-2009-18208,
title={CCZ-equivalence and Boolean functions},
booktitle={IACR Eprint archive},
keywords={Affine equivalence, Almost perfect nonlinear, Bent function, Boolean function, CCZ-equivalence, Nonlinearity},
url={http://eprint.iacr.org/2009/063},
note={ Lilya.Budaghyan@ii.uib.no 14291 received 9 Feb 2009, last revised 16 Feb 2009},
author={Lilya Budaghyan and Claude Carlet},
year=2009
}