Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes

被引:0
|
作者
P. Sarkar
S. Maitra
机构
[1] Applied Statistics Unit,
[2] Indian Statistical Institute,undefined
[3] palash@isical.ac.in,undefined
[4] Computer and Statistical Service Centre,undefined
[5] Indian Statistical Institute,undefined
[6] subho@isical.ac.in,undefined
来源
关键词
Boolean Function; Stream Cipher; Bend Function; Algebraic Degree; Bent Function;
D O I
暂无
中图分类号
学科分类号
摘要
We use the cross-correlation function as a fundamental tool to study cryptographic properties of Boolean functions. This provides a unified treatment of a large section of Boolean function literature. In the process we generalize old results and obtain new characterizations of cryptographic properties. In particular, new characterizations of bent functions and functions satisfying propagation characteristics are obtained in terms of the cross-correlation and auto-correlation properties of subfunctions. The exact relationship between the algebraic structure of the non-zeros of the spectrum and the auto-correlation values is obtained for a cryptographically important class of functions. Finally we study the suitability of S-boxes in stream ciphers and conclude that currently known constructions for S-boxes may not be adequate for such applications.
引用
收藏
页码:39 / 57
页数:18
相关论文
共 50 条
  • [1] Cross-correlation analysis of cryptographically useful Boolean functions and S-boxes
    Sarkar, P
    Maitra, S
    [J]. THEORY OF COMPUTING SYSTEMS, 2002, 35 (01) : 39 - 57
  • [2] On cross-correlation properties of S-boxes and their design using semi-bent functions
    Pasalic, Enes
    Bajric, Samed
    Djordjevic, Milan
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (05) : 790 - 800
  • [3] On the higher order nonlinearities of Boolean functions and S-boxes
    Carlet, Claude
    [J]. 2009 INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY (ARES), VOLS 1 AND 2, 2009, : 768 - 768
  • [4] On cross-correlation properties of Boolean functions
    Zhuo Ze-peng
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (10) : 2035 - 2041
  • [5] Low-Latency Boolean Functions and Bijective S-boxes
    Rasoolzadeh, Shahram
    [J]. IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2022, 2022 (03) : 403 - 447
  • [6] A novel framework for the construction of cryptographically secure S-boxes
    Arshad, Razi
    Jalil, Mudassir
    Hussain, Muzamal
    Tounsi, Abdelouahed
    [J]. COMPUTERS AND CONCRETE, 2024, 34 (01): : 833 - 845
  • [7] Evolutionary heuristics for finding cryptographically strong s-boxes
    Millan, W
    Burnett, L
    Carter, G
    Clark, A
    Dawson, E
    [J]. INFORMATION AND COMMUNICATION SECURITY, PROCEEDINGS, 1999, 1726 : 263 - 274
  • [8] Synthesis method for S-boxes satisfying the criterion of correlation immunity of Boolean and 4-functions
    Bakunina, E. V.
    Dykyi, O. V.
    [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2023, 26 (04): : 1121 - 1133
  • [9] Cryptographically Strong S-Boxes Based on Cellular Automata
    Szaban, Miroslaw
    Seredynski, Franciszek
    [J]. CELLULAR AUTOMATA, PROCEEDINGS, 2008, 5191 : 478 - +
  • [10] BooLSPLG: A Library with Parallel Algorithms for Boolean Functions and S-Boxes for GPU
    Bikov, Dushan
    Bouyukliev, Iliya
    Dzhumalieva-Stoeva, Mariya
    [J]. MATHEMATICS, 2023, 11 (08)