### Analysis of Affinely Equivalent Boolean Functions

Meng Qing-shu, Yang min, Zhang Huan-guo, and Liu Yu-zhen

##### 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.

Note: a wrong word in title is corrected

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
boolean functionslinearly equivalentaffine group
Contact author(s)
mqseagle @ sohu com
History
2005-10-21: last of 2 revisions
See all versions
Short URL
https://ia.cr/2005/025

CC BY

BibTeX

@misc{cryptoeprint:2005/025,
author = {Meng Qing-shu and Yang min and Zhang Huan-guo and Liu Yu-zhen},
title = {Analysis of Affinely Equivalent Boolean Functions},
howpublished = {Cryptology ePrint Archive, Paper 2005/025},
year = {2005},
note = {\url{https://eprint.iacr.org/2005/025}},
url = {https://eprint.iacr.org/2005/025}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.