Almost security of cryptographic Boolean functions

被引：7
|
作者：
Kurosawa, K
Matsumoto, R
机构：
[1] Ibaraki Univ, Dept Comp & Informat Sci, Hitachi, Ibaraki 3168511, Japan
[2] Tokyo Inst Technol, Dept Commun & Integrated Syst, Meguro Ku, Tokyo 1528552, Japan
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 11期
关键词：
Boolean functions; epsilon-almost version; PC (l) of order k;
D O I：
10.1109/TIT.2004.836684
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The propagation criterion, PC (l) of order k, is one of the most general cryptographic criteria of secure Boolean functions f. In this paper, we formalize its e-almost version. The new definition requires that f (X) + f (X + Delta) is almost uniformly distributed while in the original definition, it must be strictly uniformly distributed. Better parameters are then obtained than the strict PC (l) of order k functions. To construct E-almost PC (f) of order k functions, we introduce a notion of domain distance.
引用
收藏
页码：2752 / 2761
页数：10
相关论文
共 50 条
  • [1] Constructions of rotation symmetric Boolean functions satisfying almost all cryptographic criteria
    Sun, Lei
    Shi, Zexia
    Liu, Jian
    Fu, Fang-Wei
    THEORETICAL COMPUTER SCIENCE, 2024, 1020
  • [2] On cryptographic complexity of Boolean functions
    Carlet, C
    FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
  • [3] On the annihilators of cryptographic Boolean functions
    State Key Lab. of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
    不详
    不详
    Tien Tzu Hsueh Pao, 2006, 1 (51-54):
  • [4] Cryptographic Boolean Functions and Applications
    Joyner, David
    CRYPTOLOGIA, 2013, 37 (02) : 189 - 192
  • [5] Cryptographic Boolean Functions with R
    Lafitte, Frederic
    Van Heule, Dirk
    Van Hamme, Julien
    R JOURNAL, 2011, 3 (01): : 44 - 47
  • [6] Metaheuristics in the Optimization of Cryptographic Boolean Functions
    Lopez-Lopez, Isaac
    Sosa-Gomez, Guillermo
    Segura, Carlos
    Oliva, Diego
    Rojas, Omar
    ENTROPY, 2020, 22 (09)
  • [7] Cryptographic Boolean functions with biased inputs
    Gangopadhyay, Sugata
    Gangopadhyay, Aditi Kar
    Pollatos, Spyridon
    Stanica, Pantelimon
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (02): : 301 - 314
  • [8] On cryptographic propagation criteria for Boolean functions
    Carlet, C
    1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 148 - 149
  • [9] Properties of a family of cryptographic boolean functions
    Wang, Qichun
    Tan, Chik How
    Wang, Qichun, 1600, Springer Verlag (8865): : 34 - 46
  • [10] Cryptographic Boolean functions with biased inputs
    Sugata Gangopadhyay
    Aditi Kar Gangopadhyay
    Spyridon Pollatos
    Pantelimon Stănică
    Cryptography and Communications, 2017, 9 : 301 - 314
12345