ALGEBRAICALLY DEGENERATE APPROXIMATIONS OF BOOLEAN FUNCTIONS

被引：1
|
作者：
Alekseychuk, A. N. [1 ]
Konyushok, S. N. [1 ]
机构：
[1] Natl Tech Univ Ukraine, Inst Special Commun & Informat Protect, Kyiv Polytech Inst, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2014年 / 50卷 / 06期
关键词：
correlation cryptanalysis; degenerate Boolean function; k-dimensional function; Walsh-Hadamard transform; finding k-dimensional approximations of Boolean functions;
D O I：
10.1007/s10559-014-9673-x
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Properties of k-dimensional approximations of Boolean functions are investigated. One of main results is the theorem on the structure of k-dimensional functions whose degree equals d and whose distance from a given Boolean function of n variables is no longer than 2(n-d) (1-epsilon), 1 <= d <= k <= n, epsilon is an element of (0,1). This theorem considerably strengthens the well-known P. Gopalan result and makes it possible to considerably increase the efficiency of his algorithm for constructing all the mentioned k-dimensional Boolean functions.
引用
收藏
页码：817 / 828
页数：12
相关论文
共 50 条
  • [1] Decision tree approximations of Boolean functions
    Mehta, D
    Raghavan, V
    THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) : 609 - 623
  • [2] Best affine approximations of Boolean functions and applications to low order approximations
    Kolokotronis, Nicholas
    Limniotis, Konstantinos
    Kalouptsidis, Nicholas
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1836 - 1840
  • [3] Best Affine and Quadratic Approximations of Particular Classes of Boolean Functions
    Kolokotronis, Nicholas
    Limniotis, Konstantinos
    Kalouptsidis, Nicholas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) : 5211 - 5222
  • [4] Efficient computation of the best quadratic approximations of cubic Boolean functions
    Kolokotronis, Nicholas
    Limniotis, Konstantinos
    Kalouptsidis, Nicholas
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 73 - +
  • [5] Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
    Ding, Guoli
    Lax, Robert F.
    Chen, Peter
    Chen, Jianhua
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2007, 11 (04) : 403 - 409
  • [6] Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
    Zubkov, A. M.
    Serov, A. A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (5-6): : 467 - 486
  • [7] Symmetric approximations of pseudo-Boolean functions with applications to influence indexes
    Marichal, Jean-Luc
    Mathonet, Pierre
    APPLIED MATHEMATICS LETTERS, 2012, 25 (08) : 1121 - 1126
  • [8] Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy
    Serov, A. A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2012, 22 (04): : 455 - 475
  • [9] Looking algebraically at tractable quantified Boolean formulas
    Chen, HB
    Dalmau, V
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 71 - 79
  • [10] Algebraically constructible functions
    McCrory, C
    Parusinski, A
    ANNALES SCIENTIFIQUES DE L ECOLE NORMALE SUPERIEURE, 1997, 30 (04): : 527 - 552
12345