Classes of Boolean functions with limited complexity
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 58-60
Cet article a éte moissonné depuis la source Math-Net.Ru
The following classes of Boolean functions are considered: with given or limited number of essential variables, of given or limited degree, with given or limited ANF length, having non-repeated ANF. The numbers of functions in the classes and the affiliation tests are given. The algorithm for specifying of a partially defined function to a function of limited degree is presented.
Keywords:
essential dependence of a function on a variable, Boolean function degree
Mots-clés : algebraic normal form.
Mots-clés : algebraic normal form.
@article{PDMA_2019_12_a16,
author = {A. I. Metalnikova and I. A. Pankratova},
title = {Classes of {Boolean} functions with limited complexity},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {58--60},
year = {2019},
number = {12},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/}
}
A. I. Metalnikova; I. A. Pankratova. Classes of Boolean functions with limited complexity. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 58-60. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/
[1] Agibalov G. P., “Substitution block ciphers with functional keys”, Prikladnaya diskretnaya matematika, 2017, no. 38, 57–65 | MR
[2] Agibalov G. P., “SIBCiphers — simmetrichnye iterativnye blochnye shifry iz bulevykh funktsii s klyuchevymi argumentami”, Prikladnaya diskretnaya matematika. Prilozhenie, 2014, no. 7, 43–48
[3] Sloan N. J. A., The On-line Encyclopedia of Integer Sequences, https://oeis.org/ | MR
[4] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, MTsNMO, M., 2004