CryptoDB
On affine rank of spectrum support for plateaued function
| Authors: | |
|---|---|
| Download: | |
| Abstract: | The plateaued functions have a big interest for the studying of bent functions and by the reason that many cryptographically important functions are plateaued. In this paper we study the possible values of the affine rank of spectrum support for plateaued functions. We consider for any positive integer $h$ plateaued functions with a spectrum support of cardinality $4^h$ (the cardinality must have such form), give the bounds on the affine rank for such functions and construct functions where the affine rank takes all integer values from $2h$ till $2^{h+1}-2$. We solve completely the problem for $h=2$, namely, we prove that the affine rank of any plateaued function with a spectrum support of cardinality $16$ is $4$, $5$ or $6$. |
BibTeX
@misc{eprint-2005-12733,
title={On affine rank of spectrum support for plateaued function},
booktitle={IACR Eprint archive},
keywords={secret-key cryptography / boolean functions, secret-key cryptography},
url={http://eprint.iacr.org/2005/399},
note={Discrete Mathematics and Applications, Volume 16, Number 4, 2006, pp. 401-421, VSP taran@butovo.com 13436 received 6 Nov 2005, last revised 15 Oct 2006},
author={Yuriy Tarannikov},
year=2005
}