CryptoDB
Analysis of Affinely Equivalent Boolean Functions
| Authors: | |
|---|---|
| Download: | |
| Abstract: | By walsh transform, autocorrelation function, decomposition, derivation and modification of truth table, some new invariants are obtained. Based on invariant theory, we get two results: first a general algorithm which can be used to judge if two boolean functions are affinely equivalent and to obtain the affine equivalence relationship if they are equivalent. For example, all 8-variable homogenous bent functions of degree 3 are classified into 2 classes; second, the classification of the Reed-Muller code $R(4,6)/R(1,6),R(3,7)/R(1,7),$ which can be used to almost enumeration of 8-variable bent functions. |
BibTeX
@misc{eprint-2005-12364,
title={Analysis of Affinely Equivalent Boolean Functions},
booktitle={IACR Eprint archive},
keywords={foundations / boolean functions,linearly equivalent, affine group},
url={http://eprint.iacr.org/2005/025},
note={ mqseagle@sohu.com 13077 received 30 Jan 2005, last revised 20 Oct 2005},
author={Meng Qing-shu and Yang min and Zhang Huan-guo and Liu Yu-zhen},
year=2005
}