CCZ-equivalence and Boolean functions


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 EAequivalence when n ≥ 5 and m is greater or equal to the smallest positive divisor of n different from 1… (More)



Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics