<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widely used symmetric cryptosystem in the world. We formalize the AES algorithm according to [12]. We then verify the correctness of the formalized algorithm that the ciphertext encoded by the AES algorithm can be decoded uniquely by the same key. Please note the following points about this formalization: the AES round process is composed of the SubBytes, ShiftRows, MixColumns, and AddRoundKey transformations (see [12]). In this formalization, the SubBytes and MixColumns transformations are given as permutations, because it is necessary to treat the finite field GF(28) for those transformations. The formalization of AES that considers the finite field GF(28) is formalized by the future article.</p></abstract>

In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widely used symmetric cryptosystem in the world. We formalize the AES algorithm according to [12]. We then verify the correctness of the formalized algorithm that the ciphertext encoded by the AES algorithm can be decoded uniquely by the same key. Please note the following points about this formalization: the AES round process is composed of the SubBytes, ShiftRows, MixColumns, and AddRoundKey transformations (see [12]). In this formalization, the SubBytes and MixColumns transformations are given as permutations, because it is necessary to treat the finite field GF(28) for those transformations. The formalization of AES that considers the finite field GF(28) is formalized by the future article.

Formalization of the Advanced Encryption Standard. Part I

Formalized Mathematics

{"article-title":"Formalization of the Advanced Encryption Standard. Part I"}

In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher...

Formalization of the Advanced Encryption Standard. Part I

Publié en ligne: 01 oct. 2013

Pages: 171 - 184

DOI: https://doi.org/10.2478/forma-2013-0019

Mots clés
Mizar formalization, Advanced Encryption Standard (AES) algorithm, cryptology

This content is open access.

Formalization of the Advanced Encryption Standard. Part I

Publié en ligne: 01 oct. 2013

Pages: 171 - 184

DOI: https://doi.org/10.2478/forma-2013-0019

Mots clésMizar formalization, Advanced Encryption Standard (AES) algorithm, cryptology

This content is open access.

Mots clés
Mizar formalization, Advanced Encryption Standard (AES) algorithm, cryptology