- Applied mathematics
- >
- Cryptography
- >
- National Security Agency cryptography
- >
- Data Encryption Standard

- Ciphers
- >
- Block ciphers
- >
- Broken block ciphers
- >
- Data Encryption Standard

- Ciphers
- >
- Block ciphers
- >
- Feistel ciphers
- >
- Data Encryption Standard

- Cryptographic algorithms
- >
- Broken cryptography algorithms
- >
- Broken block ciphers
- >
- Data Encryption Standard

- Symmetric-key algorithms
- >
- Ciphers
- >
- Free ciphers
- >
- Data Encryption Standard

DESCHALL Project

DESCHALL, short for DES Challenge, was the first group to publicly break a message which used the Data Encryption Standard (DES), becoming the $10,000 winner of the first of the set of DES Challenges

EFF DES cracker

In cryptography, the EFF DES cracker (nicknamed "Deep Crack") is a machine built by the Electronic Frontier Foundation (EFF) in 1998, to perform a brute force search of the Data Encryption Standard (D

Triple DES

In cryptography, Triple DES (3DES or TDES), officially the Triple Data Encryption Algorithm (TDEA or Triple DEA), is a symmetric-key block cipher, which applies the DES cipher algorithm three times to

DES supplementary material

This article details the various tables referenced in the Data Encryption Standard (DES) block cipher. All bits and bytes are arranged in big endian order in this document. That is, bit number 1 is al

DES-X

In cryptography, DES-X (or DESX) is a variant on the DES (Data Encryption Standard) symmetric-key block cipher intended to increase the complexity of a brute-force attack using a technique called key

UES (cipher)

In cryptography, UES (Universal Encryption Standard) is a block cipher designed in 1999 by and Serge Vaudenay. They proposed it as a transitional step, to prepare for the completion of the AES process

Lucifer (cipher)

In cryptography, Lucifer was the name given to several of the earliest civilian block ciphers, developed by Horst Feistel and his colleagues at IBM. Lucifer was a direct precursor to the Data Encrypti

Data Encryption Standard

The Data Encryption Standard (DES /ˌdiːˌiːˈɛs, dɛz/) 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 applicat

Davies attack

In cryptography, the Davies attack is a dedicated statistical cryptanalysis method for attacking the Data Encryption Standard (DES). The attack was originally created in 1987 by Donald Davies. In 1994

DEAL

In cryptography, DEAL (Data Encryption Algorithm with Larger blocks) is a symmetric block cipher derived from the Data Encryption Standard (DES). The design was proposed in a report by Lars Knudsen in

DES Challenges

The DES Challenges were a series of brute force attack contests created by RSA Security to highlight the lack of security provided by the Data Encryption Standard.

Ladder-DES

In cryptography, Ladder-DES is a block cipher designed in 1994 by Terry Ritter. It is a 4-round Feistel cipher with a block size of 128 bits, using DES as the round function. It has no actual key sche

GDES

In cryptography, the Generalized DES Scheme (GDES or G-DES) is a variant of the DES symmetric-key block cipher designed with the intention of speeding up the encryption process while improving its sec

CDMF

In cryptography, CDMF (Commercial Data Masking Facility) is an algorithm developed at IBM in 1992 to reduce the security strength of the 56-bit DES cipher to that of 40-bit encryption, at the time a r

© 2023 Useful Links.