Jump to ContentJump to Main Navigation
Show Summary Details
More options …

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
More options …
Volume 20, Issue 2 (Dec 2012)

Issues

Formalization of the Data Encryption Standard

Hiroyuki Okazaki / Yasunari Shidama
Published Online: 2013-02-02 | DOI: https://doi.org/10.2478/v10037-012-0016-y

Summary

In this article we formalize DES (the Data Encryption Standard), that was the most widely used symmetric cryptosystem in the world. DES is a block cipher which was selected by the National Bureau of Standards as an official Federal Information Processing Standard for the United States in 1976 [15].

  • [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. FormalizedMathematics, 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] Czesław Bylinski. Some properties of restrictions of finite sequences. Formalized Mathematics, 5(2):241-245, 1996.Google Scholar

  • [12] Shunichi Kobayashi and Kui Jia. A theory of Boolean valued functions and partitions. Formalized Mathematics, 7(2):249-254, 1998.Google Scholar

  • [13] Jarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992.Google Scholar

  • [14] Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics. Formalized Mathematics, 4(1):83-86, 1993.Google Scholar

  • [15] U.S. Department of Commerce/National Institute of Standards and Technology. Fips pub 46-3, data encryption standard (DES). http://csrc.nist.gov/publications/fips/-fips46-3/fips46-3.pdf. Federal Information Processing Standars Publication, 1999.Google Scholar

  • [16] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.Google Scholar

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

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

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

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

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

  • [22] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.Google Scholar

About the article

This work was supported by JSPS KAKENHI 21240001


Published Online: 2013-02-02

Published in Print: 2012-12-01


Citation Information: Formalized Mathematics, ISSN (Online) 1898-9934, ISSN (Print) 1426-2630, DOI: https://doi.org/10.2478/v10037-012-0016-y.

Export Citation

This content is open access.

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Artur Korniłowicz
Computer Languages, Systems & Structures, 2015, Volume 44, Page 238

Comments (0)

Please log in or register to comment.
Log in