Jump to ContentJump to Main Navigation
Show Summary Details
In This Section

Formalized Mathematics

(a computer assisted approach)

Editor-in-Chief: Matuszewski, Roman

4 Issues per year


SCImago Journal Rank (SJR) 2016: 0.207
Source Normalized Impact per Paper (SNIP) 2016: 0.315

Open Access
Online
ISSN
1898-9934
See all formats and pricing
In This Section
Volume 21, Issue 3 (Oct 2013)

Issues

Formalization of the Advanced Encryption Standard. Part I

Kenichi Arai
  • Tokyo University of Science Chiba, Japan
/ Hiroyuki Okazaki
  • Shinshu University Nagano, Japan

Summary

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.

Keywords: Mizar formalization; Advanced Encryption Standard (AES) algorithm; cryptology

  • [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Google Scholar

  • [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.Google Scholar

  • [3] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Google Scholar

  • [4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Google Scholar

  • [5] Czesław Bylinski. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.Google Scholar

  • [6] Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.Google Scholar

  • [7] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.Google Scholar

  • [8] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Google Scholar

  • [9] Czesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Google Scholar

  • [10] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Google Scholar

  • [11] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Google Scholar

  • [12] U.S. Department of Commerce/National Institute of Standards and Technology. FIPS PUB 197, Advanced Encryption Standard (AES). Federal Information Processing Standars Publication, 2001.Google Scholar

  • [13] Hiroyuki Okazaki and Yasunari Shidama. Formalization of the data encryption standard. Formalized Mathematics, 20(2):125-146, 2012. doi:10.2478/v10037-012-0016-y.CrossrefGoogle Scholar

  • [14] Andrzej Trybulec. On the decomposition of finite sequences. Formalized Mathematics, 5 (3):317-322, 1996.Google Scholar

  • [15] Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Google Scholar

  • [16] Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575-579, 1990.Google Scholar

  • [17] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Google Scholar

  • [18] Edmund Woronowicz. Many argument relations. Formalized Mathematics, 1(4):733-737, 1990.Google Scholar

  • [19] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990. Google Scholar

About the article

Published in Print: 2013-10-01


Citation Information: Formalized Mathematics, ISSN (Online) 1898-9934, ISSN (Print) 1426-2630, DOI: https://doi.org/10.2478/forma-2013-0019.

Export Citation

This content is open access.

Comments (0)

Please log in or register to comment.
Log in