One approach of using key-dependent S-BOXes in AES

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The use of key-dependent substitution matrices (S-BOXes) is one of the commonly used methods to change the characteristics of a cryptographic algorithm. In this report is presented one approach for changing the S-BOXes used in the algorithm AES. By this approach are used substitution matrices which depend on the key while the parameters of the created new S-BOXes have characteristics equal to those in the original algorithm AES. The proposed new matrices were tested for Balancing, Nonlinearity (Additivity and Completeness), Strict Avalanche Criterion (SAC), Low XOR Table, Diffusion Order and Invertability using the software simulator developed by Work Package 8 (WP8) in the project INDECT. The new S-BOXes were also tested for static and dynamic independence between the input and output data. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Stoianov, N. (2011). One approach of using key-dependent S-BOXes in AES. In Communications in Computer and Information Science (Vol. 149 CCIS, pp. 317–323). https://doi.org/10.1007/978-3-642-21512-4_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free