.png){kind=icon}
.png){kind=icon}
Return
Efficient binary diffusion matrix structures for dynamic key-dependent cryptographic algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.jisa.2022.103264.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new mechanism for the generation of dynamic binary diffusion matrices, with a flexible dimension (n x n), to be used in the design of new symmetric cryptographic algorithms. The proposed framework defines four primary invertible and non-invertible binary diffusion matrix forms. The advantages of these forms stem from the dynamic key approach, where each primary matrix requires the construction of two pseudo-random sub-matrices (Mu and Mv) with a size that depends on two variables (m and 1). A cryptographic analysis was carried out to detect the optimal size of m and 1 for the construction of the matrices to achieve the best possible cryptographic performance and thus, to provide better immunity against different types of attacks. The results showed that the optimal size for m is is an element of {n/2 - 1, n/2, n/2 + 1}, and for 1 = n - m. Accordingly, the proposed scheme was designed with an optimal size of m and 1, which resulted an acceptable linear branch number and low fixed numbers. In comparison to the existing static diffusion techniques, the proposed solution offers a higher security level since the diffusion matrices are constantly changing and they depend of the dynamic key, which is unknown to attackers.
Keywords:
Dynamic cryptography
Binary diffusion matrix forms
Invertible or non-invertible diffusion primitives
Cryptographic analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
1.9K
Citations:
4.9K