The proposed RNBMF framework provides a compact and reproducible mechanism for affine diversification of inversion-based S-boxes while preserving their principal affine-invariant cryptographic profile and enabling structurally preferable representatives to be selected for dynamic substitution layers.
Abstract
Substitution boxes are fundamental nonlinear components of symmetric-key ciphers, and dynamic S-box generation provides a means of diversifying the nonlinear layer during operation. However, many existing approaches focus on constructing or optimizing individual S-boxes and do not provide a systematic mechanism for preserving principal cryptographic characteristics across an entire generated family. To address this limitation, this study introduces a structured dynamic S-box construction based on Rotationally Nonsingular Binary Matrix Families (RNBMFs). A 64-bit binary seed is cyclically rotated to generate 64 interrelated
$$8\times 8$$
binary matrices, which are used as reproducible affine layers around multiplicative inversion over
$$\textrm{GF}(2^8)$$
. The admissibility condition of the complete matrix family is reduced exactly from 64 determinant checks to eight representative tests through the determinant-equivalence structure induced by cyclic row permutations. Large-scale evaluation of
$$10{,}000$$
distinct generated S-boxes confirms stable nonlinearity of
$$112$$
, linear approximation probability of
$$0.0625$$
, differential uniformity of
$$4$$
, algebraic degree of
$$7$$
, and boomerang uniformity of
$$6$$
, while SAC behavior, fixed-point patterns, and permutation-cycle structures remain instance-dependent and can therefore be used as additional screening criteria. As an integration-level assessment, the generated S-boxes were also evaluated in a common reversible RGB permutation–diffusion configuration, producing ciphertext entropy close to
$$8$$
, near-zero adjacent-pixel correlation, NPCR and UACI values close to their theoretical references, and exact image recovery. These results show that the proposed RNBMF framework provides a compact and reproducible mechanism for affine diversification of inversion-based S-boxes while preserving their principal affine-invariant cryptographic profile and enabling structurally preferable representatives to be selected for dynamic substitution layers.
A new, two-step approach to the construction of highly nonlinear S-boxes, with group-theoretic underpinnings, and is incorporated into a multi-round grayscale image-encryption scheme based on fixed S-box substitution, key- and nonce-dependent position permutation, SHA-256-based keystream whitening, and a final bidirect...
A. Razzaque, Hafiza Zara Mustafa, Dilshad Alghazzawi et al.· PLoS ONE· 0 citations
Results suggest that the hybrid FSM-based design offers an effective balance between structural innovation, diffusion efficiency, and computational performance, and suggest that the hybrid FSM-based design offers an effective balance between structural innovation, diffusion efficiency, and computational performance.
Ciphers built on bitwise AND, XOR, and rotation are highly competitive for resource‑constrained Internet of Things devices. A representative example is the SIMON family of lightweight block ciphers, introduced by the U.S. National Security Agency in 2013. Differential‑linear (DL) cryptanalysis of such ciphers comprises...
Guang-Qiu Lv, Yi Zhang· Designs, Codes and Cryptogra...· 0 citations
The security of symmetric‐key block ciphers depends critically on the strength and structural unpredictability of their substitution boxes (S‐boxes). Existing constructions rely on fixed mathematical structures, such as finite field inversion, chaotic maps, or elliptic curves that are entirely independent of the encryp...
Muhammad Waheed Rasheed, M. Amjad· Security and Privacy· 0 citations
The results demonstrate that while insecure as a standalone primitive, this structure offers a favorable trade-off between large-state diffusion and implementation cost, making it a compelling candidate for the mixing layer in lightweight Substitution-Permutation Networks (SPNs).
Thi-Tuyet Phan· HPU2 Journal of Science: Nat...· 0 citations
We formulate key recovery for the International Data Encryption Algorithm (IDEA) as a quantifier-free bit-vector satisfiability problem. The IDEA is a 64-bit block cipher with a 128-bit key whose round function combines multiplication modulo 2^16+1, addition modulo 2^16, and XOR. The model includes the 25-bit cyclic ke...
Praveen Kumar Gundaram· Journal of Information and C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.