A novel framework for the construction of cryptographically secure S-boxes

被引:0
|
作者
Arshad, Razi [1 ]
Jalil, Mudassir [2 ]
Hussain, Muzamal [3 ]
Tounsi, Abdelouahed [4 ,5 ]
机构
[1] Natl Univ Sci & Technol, Sch Elect Engn & Comp Sci, Dept Comp, Islamabad 44000, Pakistan
[2] Comsats Univ Islamabad, Dept Math, Islamabad 44000, Pakistan
[3] Islamia Univ Bahawalpur, Dept Math, Sahiwal 57000, Punjab, Pakistan
[4] Yonsei Univ, Yonsei Frontier Lab YFL, Seoul, South Korea
[5] King Fahd Univ Petr & Minerals, Dept Civil & Environm Engn, Dhahran 31261, Eastern Provinc, Saudi Arabia
来源
COMPUTERS AND CONCRETE | 2024年 / 34卷 / 01期
关键词
block cipher; image encryption; linear fractional transformation; permutation function; substitution-box; SCHEME;
D O I
10.12989/cac.2024.34.1.833
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In symmetric cryptography, a cryptographically secure Substitution -Box (S -Box) is a key component of a block cipher. S -Box adds a confusion layer in block ciphers that provide resistance against well-known attacks. The generation of a cryptographically secure S -Box depends upon its generation mechanism. In this paper, we propose a novel framework for the construction of cryptographically secure S -Boxes. This framework uses a combination of linear fractional transformation and permutation functions. S -Boxes security is analyzed against well-known security criteria that include nonlinearity, bijectiveness, strict avalanche and bits independence criteria, linear and differential approximation probability. The S -Boxes can be used in the encryption of any grayscale digital images. The encrypted images are analyzed against well-known image analysis criteria that include pixel changing rates, correlation, entropy, and average change of intensity. The analysis of the encrypted image shows that our image encryption scheme is secure.
引用
收藏
页码:833 / 845
页数:13
相关论文
共 50 条
  • [1] Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance
    Isa, Herman
    Jamil, Norziana
    Z'Aba, Muhammad Reza
    [J]. NEW GENERATION COMPUTING, 2016, 34 (03) : 221 - 238
  • [2] Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance
    Herman Isa
    Norziana Jamil
    Muhammad Reza Z’aba
    [J]. New Generation Computing, 2016, 34 : 221 - 238
  • [3] A Novel Optimization Method for Constructing Cryptographically Strong Dynamic S-Boxes
    Ibrahim, Saleh
    Abbas, Alaa M.
    [J]. IEEE ACCESS, 2020, 8 (08): : 225004 - 225017
  • [4] Construction of cryptographically strong S-boxes from ternary quasigroups of order 4
    Chauhan, Dimpy
    Gupta, Indivar
    Mishra, P. R.
    Verma, Rashmi
    [J]. CRYPTOLOGIA, 2022, 46 (06) : 525 - 551
  • [5] 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
  • [6] Cryptographically Strong S-Boxes Based on Cellular Automata
    Szaban, Miroslaw
    Seredynski, Franciszek
    [J]. CELLULAR AUTOMATA, PROCEEDINGS, 2008, 5191 : 478 - +
  • [7] Novel recursive construction method for resilient S-boxes
    Gao, Sheng
    Ma, Wenping
    [J]. ADVANCED RESEARCH ON AUTOMATION, COMMUNICATION, ARCHITECTONICS AND MATERIALS, PTS 1 AND 2, 2011, 225-226 (1-2): : 1149 - 1152
  • [8] 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
  • [9] A method for obtaining cryptographically strong 8x8 S-boxes
    Yi, X
    Cheng, SX
    You, XH
    Lam, KY
    [J]. GLOBECOM 97 - IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, CONFERENCE RECORD, VOLS 1-3, 1997, : 689 - 693
  • [10] Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes
    P. Sarkar
    S. Maitra
    [J]. Theory of Computing Systems, 2002, 35 : 39 - 57