{
  "id": "enwiki-001377005733",
  "slug": "data-encryption-standard",
  "title": "Data Encryption Standard",
  "qid": "",
  "lead": "The Data Encryption Standard (DES ) is a symmetric-key algorithm for the encryption of digital data. Although its short key length of 56 bits makes it too insecure for modern applications, it has been highly influential in the advancement of cryptography. Developed in the early 1970s at IBM and based on an earlier design by Horst Feistel, the algorithm was submitted to the National Bureau of Standards (NBS) following the agency's invitation to propose a candidate for the protection of sensitive, unclassified electronic government and commercial data. In 1976, after consultation with the National Security Agency (NSA), the NBS selected a slightly modified version (strengthened against differential cryptanalysis, but weakened against brute-force attacks), which was published as an official Federal Information Processing Standard (FIPS) for the United States in 1977. The publication of an NSA-approved encryption standard led to its quick international adoption and widespread academic scrutiny. Controversies arose from classified design elements, a relatively short key length of the symmetric-key block cipher design, and the involvement of the NSA, raising suspicions about a backdoor. The S-boxes that had prompted those suspicions were designed by the NSA to address a vulnerability they secretly knew (differential cryptanalysis).…",
  "body": "The Data Encryption Standard (DES ) is a symmetric-key algorithm for the encryption of digital data. Although its short key length of 56 bits makes it too insecure for modern applications, it has been highly influential in the advancement of cryptography. Developed in the early 1970s at IBM and based on an earlier design by Horst Feistel, the algorithm was submitted to the National Bureau of Standards (NBS) following the agency's invitation to propose a candidate for the protection of sensitive, unclassified electronic government and commercial data. In 1976, after consultation with the National Security Agency (NSA), the NBS selected a slightly modified version (strengthened against differential cryptanalysis, but weakened against brute-force attacks), which was published as an official Federal Information Processing Standard (FIPS) for the United States in 1977. The publication of an NSA-approved encryption standard led to its quick international adoption and widespread academic scrutiny. Controversies arose from classified design elements, a relatively short key length of the symmetric-key block cipher design, and the involvement of the NSA, raising suspicions about a backdoor. The S-boxes that had prompted those suspicions were designed by the NSA to address a vulnerability they secretly knew (differential cryptanalysis). However, the NSA also ensured that the key size was drastically reduced. The intense academic scrutiny the algorithm received over time led to the modern understanding of block ciphers and their cryptanalysis. DES is insecure due to the relatively short 56-bit key size. In January 1999, distributed.net and the Electronic Frontier Foundation collaborated to publicly break a DES key in 22 hours and 15 minutes (see ). There are also some analytical results which demonstrate theoretical weaknesses in the cipher, although they are infeasible in practice. DES has been withdrawn as a standard by the NIST. Later, the variant Triple DES was developed to increase the security level, but it is considered insecure today as well. DES has been superseded by the Advanced Encryption Standard (AES). Some documents distinguish between the DES standard and its algorithm, referring to the algorithm as the DEA (Data Encryption Algorithm). ==Description== File:DES-main-network.png|thumb|250px|Figure 1— The overall Feistel structure of DES rect 0 130 639 229 Initial permutation rect 220 300 421 405 Feistel function rect 220 594 421 701 Feistel function rect 220 1037 421 1144 Feistel function rect 220 1330 421 1437 Feistel function rect 0 1478 639 1577 Final permutation circle 50 351 26 XOR circle 50 647 26 XOR circle 50 1090 26 XOR circle 50 1383 26 XOR DES is the archetypal block cipher—an algorithm that takes a fixed-length string of plaintext bits and transforms it through a series of complicated operations into another ciphertext bitstring of the same length. In the case of DES, the block size is 64 bits. DES also uses a key to customize the transformation, so that decryption can supposedly only be performed by those who know the particular key used to encrypt. The key ostensibly consists of 64 bits; however, only 56 of these are actually used by the algorithm. Eight bits are used solely for checking parity, and are thereafter discarded. Hence the effective key length is 56 bits. The key is nominally stored or transmitted as 8 bytes, each with odd parity. According to ANSI X3.92-1981 (Now, known as ANSI INCITS 92–1981), section 3.5: Like other block ciphers, DES by itself is not a secure means of encryption, but must instead be used in a mode of operation. FIPS-81 specifies several modes for use with DES. Further comments on the usage of DES are contained in FIPS-74. Decryption uses the same structure as encryption, but with the keys used in reverse order. (This has the advantage that the same hardware or software can be used in both directions.) Expansion: the 32-bit half-block is expanded to 48 bits using the expansion permutation, denoted E in the diagram, by duplicating half of the bits. The output consists of eight 6-bit (8 × 6 = 48 bits) pieces, each containing a copy of 4 corresponding input bits, plus a copy of the immediately adjacent bit from each of the input pieces to either side. Key mixing: the result is combined with a subkey using an XOR operation. Sixteen 48-bit subkeys—one for each round—are derived from the main key using the key schedule (described below). Substitution: after mixing in the subkey, the block is divided into eight 6-bit pieces before processing by the S-boxes, or substitution boxes. Each of the eight S-boxes replaces its six input bits with four output bits according to a non-linear transformation, provided in the form of a lookup table. The S-boxes provide the core of the security of DES—without them, the cipher would be linear, and trivially breakable. Permutation: finally, the 32 outputs from the S-boxes are rearranged according to a fixed permutation, the P-box. This is designed so that, after permutation, the bits from the output of each S-box in this round are spread across four different S-boxes in the next round. The alternation of substitution from the S-boxes, and permutation of bits from the P-box and E-expansion provides so-called \"confusion and diffusion\" respectively, a concept identified by Claude Shannon in the 1940s as a necessary condition for a secure yet practical cipher. E_K(P)=C \\iff E_{\\overline{K}}(\\overline{P})=\\overline{C} where \\overline{x} is the bitwise complement of x. E_K denotes encryption with key K. P and C denote plaintext and ciphertext blocks respectively. The complementation property means that the work for a brute-force attack could be reduced by a factor of 2 (or a single bit) under a chosen-plaintext assumption. By definition, this property also applies to TDES cipher. DES also has four so-called weak keys. Encryption (E) and decryption (D) under a weak key have the same effect (see involution): E_K(E_K(P)) = P or equivalently, E_K = D_K. There are also six pairs of semi-weak keys. Encryption with one of the pair of semiweak keys, K_1 , operates identically to decryption with the other, K_2 : E_{K_1}(E_{K_2}(P)) = P or equivalently, E_{K_2} = D_{K_1}. It is easy enough to avoid the weak and semiweak keys in an implementation, either by testing for them explicitly, or simply by choosing keys randomly; the odds of picking a weak or semiweak key by chance are negligible. The keys are not really any weaker than any other keys anyway, as they do not give an attack any advantage. DES has also been proved not to be a group, or more precisely, the set \\{E_K\\} (for all possible keys K ) under functional composition is not a group, nor \"close\" to being a group. This was an open question for some time, and if it had been the case, it would have been possible to break DES, and multiple encryption modes such as Triple DES would not increase the security, because repeated encryption (and decryptions) under different keys would be equivalent to encryption under another, single key. ==External links== FIPS 46-3: The official document describing the DES standard (PDF) COPACOBANA, a $10,000 DES cracker based on FPGAs by the Universities of Bochum and Kiel DES step-by-step presentation and reliable message encoding application A Fast New DES Implementation in Software - Biham On Multiple Linear Approximations RFC4772 : Security Implications of Using the Data Encryption Standard (DES) Python code of DES Cipher implemented using DES Chapter from NIST SP 958",
  "categories": [
    "10639920",
    "113832399",
    "22900963",
    "22985424",
    "23018615",
    "23038696",
    "23556908",
    "23603337",
    "23703189",
    "24043274",
    "24623845",
    "24745122",
    "25607702",
    "26025353",
    "26220375",
    "28269686",
    "37535188",
    "40377096",
    "4302508",
    "61688271",
    "7388204",
    "89061531",
    "89061603"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1377005733",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1790501349.0,
  "claims": [
    {
      "id": 29382460,
      "subject_qid": "",
      "subject_slug": "data-encryption-standard",
      "predicate": "publication date",
      "object_text": "1977",
      "object_num": 19770000.0,
      "object_unit": null,
      "polarity": 1,
      "qualifier": "",
      "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1377005733",
      "source_name": "Wikipedia",
      "source_tier": 3,
      "retrieved_at": 1792482358.069967,
      "confidence": 0.95,
      "article_slug": "data-encryption-standard",
      "span_start": 217,
      "span_end": 266
    }
  ],
  "contradictions": [],
  "confidence": 0.95,
  "csl": {
    "id": "enwiki-001377005733",
    "type": "webpage",
    "title": "Data Encryption Standard",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/data-encryption-standard",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001377005733",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1377005733",
    "note": "Immutable snapshot enwiki-001377005733"
  }
}