Dynamic MDS diffusion layers with efficient software implementation

Shamsabad, M. R. Mirzaee; Dehnavi, Seyed Mojtaba

doi:10.1504/ijact.2020.107164

Cited by 5 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, in [33] Murphy et al presented a method for differential cryptanalysis of key-dependent S-boxes, outlining techniques for conducting cryptanalysis using such Sboxes. Some works have also focused on introducing dynamism to the diffusion layer [34], [35], [36], [37] of AES. For example, one proposal in [34] involves constructing a key-dependent diffusion layer using scalar multiplication and direct exponentiation.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, numerous research efforts focus on enhancing AES through animation. Some of these focus on proposing dynamic S-boxes for AES [28], [29], [30], [31], [32], [33], while others create dynamic MixColumn transformations for AES [34], [35], [36], [37]. Some studies animating both the S-boxes and the MixColumn transformation of AES are also of interest [38], [39], [40].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

AES Security Improvement by Utilizing New Key-Dependent XOR Tables

Luong,

Cuong,

2024

IEEE Access

View full text Add to dashboard Cite

Increasing the security of block ciphers is a topic of great interest today, and thus there is a variety of work to enhance the strength of such ciphers. There are also many studies focusing on the Advanced Encryption Standard (AES), presenting methods of making block ciphers dynamic to improve their security. Animating methods can perform block cipher transformations such as substitution or permutation, or both. In this article, we propose an algorithm to create new, key-dependent XOR tables from an initial secret key. At the same time, we prove that in the ciphertext the new XOR operation can preserve the independent, co-probability distribution of the random key. We then apply these new XOR tables to make AES dynamic at the Addroundkey transformation. We created a considerable number of XOR tables, about (16!) 2 tables. With such a vast number of key-dependent dynamic XOR tables, cryptanalysts will have great difficulty finding the actual XOR table used in the modified AES block cipher. Therefore, with our new XOR tables, AES will be significantly enhanced. INDEX TERMSNew xor table, aes, dynamic xor table, key-dependent.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

AES Security Improvement by Utilizing New Key-Dependent XOR Tables

Luong,

Cuong,

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Specifically, with the AES block cipher, there is a variety of approaches to dynamize the AES block cipher to enhance its security. Some of these methods center on incorporating S-boxes in AES that depend on a secret key [20][21][22][23][24][25], while others work on creating key-dependent MixColumn transformations for AES [26][27][28]. Notably, there are studies exploring the dynamization of both AES's S-boxes and MixColumn [29], or the dynamization of all three transformations: S-Boxes, MixColumn, and ShiftRow, which have also received attention [30][31][32].…”

Section: Introductionmentioning

confidence: 99%

“…An idea presented in [27] includes the creation of a diffusion layer that relies on the encryption key, achieved through scalar multiplication and immediate exponentiation. In [28], the authors introduced a collection of binary matrices that can be employed to create dynamic matrices resembling AES and recursive MDS matrices.…”

Section: Introductionmentioning

confidence: 99%

Strengthening AES Security through Key-Dependent ShiftRow and AddRoundKey Transformations Utilizing Permutation

Luong

2023

IJACSA

View full text Add to dashboard Cite

AES (Advanced Encryption Standard) is a widely applied block cipher standard in the United States, used in various security applications today. Currently, there are numerous research endeavors aimed at making AES block ciphers dynamic to improve their security against contemporary strong attacks. The most common dynamic approach involves the dynamization of AES block transformations, including SubByte, ShiftRow, AddRoundKey, and MixColumn operations. The combination of these transformations has also been explored and proposed. However, to the best of our knowledge, the dynamic combination of AddRoundKey and ShiftRow transformations remains unexplored. Therefore, in this paper we introduce algorithms for generating key-dependent AddRoundKey and ShiftRow transformations based on permutations. Subsequently, these key-dependent transformations are applied to AES to create dynamic AES block ciphers. Security analysis and evaluation of NIST's statistical criteria are performed, and the entropy of AES and dynamic AES is assessed. From our findings, it is evident that dynamic AES block ciphers can significantly enhance AES security and meet stringent randomness criteria, similar to AES.

show abstract

“…Similarly, there is a rich literature on certain types of mixing layers. In particular, there have been many papers written about finding maximum-distance separable (MDS) mappings or near-MDS mappings with minimum implementation cost according to some metric, see, e.g., [28,37]. Building a good cipher starts with taking a good S-box and mixing layer and the rich cryptographic literature on these components provides us with ample choice.…”

Section: Introductionmentioning

confidence: 99%

Thinking Outside the Superbox

Bordes

Daemen

Kuijsters

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Designing a block cipher or cryptographic permutation can be approached in many different ways. One such approach, popularized by AES, consists in grouping the bits along the S-box boundaries, e.g., in bytes, and in consistently processing them in these groups. This aligned approach leads to hierarchical structures like superboxes that make it possible to reason about the differential and linear propagation properties using combinatorial arguments. In contrast, an unaligned approach avoids any such grouping in the design of transformations. However, without hierarchical structure, sophisticated computer programs are required to investigate the differential and linear propagation properties of the primitive. In this paper, we formalize this notion of alignment and study four primitives that are exponents of different design strategies.We propose a way to analyze the interactions between the linear and the nonlinear layers w.r.t. the differential and linear propagation, and we use it to systematically compare the four primitives using non-trivial computer experiments. We show that alignment naturally leads to different forms of clustering, e.g., of active bits in boxes, of two-round trails in activity patterns, and of trails in differentials and linear approximations.

show abstract

Dynamic MDS diffusion layers with efficient software implementation

Cited by 5 publications

References 0 publications

AES Security Improvement by Utilizing New Key-Dependent XOR Tables

AES Security Improvement by Utilizing New Key-Dependent XOR Tables

Strengthening AES Security through Key-Dependent ShiftRow and AddRoundKey Transformations Utilizing Permutation

Thinking Outside the Superbox

Contact Info

Product

Resources

About