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 条
  • [41] A new S-box construction method meeting strict avalanche criterion
    Li, Lang
    Liu, Jinggen
    Guo, Ying
    Liu, Botao
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2022, 66
  • [42] METHOD OF CONSTRUCTING FLOWCHARTS OF SIMPLE BINARY PROGRAMS FOR THE SYSTEMS OF BOOLEAN FUNCTIONS
    RUBINOV, VI
    SHALYTO, AA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1986, (04): : 87 - 92
  • [43] Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree l and order k
    Quisquater, M
    Preneel, B
    Vandewalle, J
    INFORMATION PROCESSING LETTERS, 2005, 93 (01) : 25 - 28
  • [44] METHOD OF APPROXIMATE MINIMIZATION OF BOOLEAN FUNCTIONS OF A LARGE NUMBER OF VARIABLES
    CHERKUDINOV, SA
    AUTOMATION AND REMOTE CONTROL, 1972, 33 (04) : 606 - +
  • [45] Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables
    Peng, Jie
    Kan, Haibin
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (06) : 1056 - 1064
  • [46] ON LOWER BOUNDS FOR THE COMPLEXITY OF DISJUNCTIVE NORMAL FORMS OF BOOLEAN FUNCTIONS WITH A SMALL NUMBER OF ZEROS
    KOGAN, AY
    USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1987, 27 (11-12): : 175 - 181
  • [47] ONE MORE METHOD FOR PROVING LOWER BOUNDS ON THE FORMULA COMPLEXITY OF BOOLEAN FUNCTIONS
    STETSENKO, VA
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 379 : 503 - 510
  • [48] New Odd-Variable Rotation Symmetric Boolean Functions Satisfying Good Cryptographic Characteristics
    Zhao, Qinglan
    Zhang, Jiandong
    Zheng, Dong
    Li, Luyang
    International Journal of Network Security, 2025, 27 (01) : 200 - 212
  • [49] A New Method for Sharpening the Bounds of Several Special Functions
    Xiao-Diao Chen
    Jiaer Shi
    Yigang Wang
    Pan Xiang
    Results in Mathematics, 2017, 72 : 695 - 702
  • [50] A New Method for Sharpening the Bounds of Several Special Functions
    Chen, Xiao-Diao
    Shi, Jiaer
    Wang, Yigang
    Xiang, Pan
    RESULTS IN MATHEMATICS, 2017, 72 (1-2) : 695 - 702
12345