A New Method on Constructing Boolean Functions Satisfying the Strict Avalanche Criterion and Bounds on the Number of SAC Functions

被引：0
|
作者：
Wang, Qingping [1 ,2 ]
机构：
[1] Jiangxi Univ Finance & Econ, Sch Stat, Nanchang, Jiangxi, Peoples R China
[2] Jiangxi Univ Finance & Econ, Res Ctr Appl Stat, Nanchang, Jiangxi, Peoples R China
来源：
3RD AASRI CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND BIOINFORMATICS (CIB 2015) | 2015年
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Properties of Boolean functions satisfying the Strict Avalanche Criterion ( SAC) are studied. A new method of constructing SAC functions is proposed, and it is proved that the Hamming weight of SAC functions with n variables belongs to the set W(n)={k|2(n-2) <= k <= 3x2(n-2) , k is an even number}. Finally, the upper and lower bounds of the number of SAC functions are obtained.
引用
收藏
页码：10 / 14
页数：5
相关论文
共 50 条
  • [31] Constructing Boolean Functions in Odd Number of Variables with Maximum Algebraic Immunity
    Limniotis, Konstantinos
    Kolokotronis, Nicholas
    Kalouptsidis, Nicholas
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 2686 - 2690
  • [32] Analysis of the Strict Avalanche Criterion in Variants of Arbiter-Based Physically Unclonable Functions
    Siddhanti, Akhilesh Anilkumar
    Bodapati, Srinivasu
    Chattopadhyay, Anupam
    Maitra, Subhamoy
    Roy, Dibyendu
    Stanica, Pantelimon
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2019, 2019, 11898 : 556 - 577
  • [33] 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
  • [34] 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
  • [35] ON AN ENTROPIC METHOD OF OBTAINING LOWER BOUNDS FOR THE COMPLEXITY OF BOOLEAN FUNCTIONS
    IUKNA, SP
    DOKLADY AKADEMII NAUK SSSR, 1988, 298 (03): : 556 - 559
  • [36] Auto-correlations and new bounds on the nonlinearity of Boolean functions
    Zhang, XM
    Zheng, YL
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '96, 1996, 1070 : 294 - 306
  • [37] New upper bounds on the Boolean circuit complexity of symmetric functions
    Demenkov, E.
    Kojevnikov, A.
    Kulikov, A.
    Yaroslavtsev, G.
    INFORMATION PROCESSING LETTERS, 2010, 110 (07) : 264 - 267
  • [38] New Upper Bounds on the Average PTF Density of Boolean Functions
    Amano, Kazuyuki
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 304 - 315
  • [39] New method for constructing Chernoff functions
    I. D. Remizov
    Differential Equations, 2017, 53 : 566 - 570
  • [40] New Method for Constructing Chernoff Functions
    Remizov, I. D.
    DIFFERENTIAL EQUATIONS, 2017, 53 (04) : 566 - 570
12345