| Triple DES | | Three successive invocations of DES | | General | | Designer(s): | IBM | | First published: | 1978 | | Derived from: | DES | | Cipher detail | | Key size(s): | 112 (2TDES) or 168 bits (3TDES) | | Block size(s): | 64 bits | | Structure: | Feistel network | | Rounds: | 48 DES-equivalent rounds | | Best public cryptanalysis | | Lucks: 232 known plaintexts, 2113 operations including 290 DES encryptions, 288 memory; Biham: find one of 228 target keys with a handful of chosen plaintexts per key and 284 encryptions | In cryptography, Triple DES is a block cipher formed from the Data Encryption Standard (DES) cipher by using it three times. Image File history File links Download high resolution version (1177x1116, 70 KB) Triple DES- overall view of ciphering. ...
IBM redirects here. ...
Year 1978 (MCMLXXVIII) was a common year starting on Sunday (link displays the 1978 Gregorian calendar). ...
The Data Encryption Standard (DES) is a cipher (a method for encrypting information) selected as an official Federal Information Processing Standard (FIPS) for the United States in 1976, and which has subsequently enjoyed widespread use internationally. ...
In cryptography, the key size (alternatively key length) is the size of the digits used to create an encrypted text; it is therefore also a measure of the number of possible keys which can be used in a cipher, and the number of keys which must be tested to break...
In modern cryptography, symmetric key ciphers are generally divided into stream ciphers and block ciphers. ...
In cryptography, a Feistel cipher is a block cipher with a particular structure, named after IBM cryptographer Horst Feistel; it is also commonly known as a Feistel network. ...
Cryptanalysis (from the Greek kryptós, hidden, and analýein, to loosen or to untie) is the study of methods for obtaining the meaning of encrypted information, without access to the secret information which is normally required to do so. ...
The German Lorenz cipher machine, used in World War II for encryption of very high-level general staff messages Cryptography (or cryptology; derived from Greek κÏÏ
ÏÏÏÏ kryptós hidden, and the verb γÏάÏÏ gráfo write or λεγειν legein to speak) is the study of message secrecy. ...
Encryption Decryption In cryptography, a block cipher is a symmetric key cipher which operates on fixed-length groups of bits, termed blocks, with an unvarying transformation. ...
The Data Encryption Standard (DES) is a cipher (a method for encrypting information) selected as an official Federal Information Processing Standard (FIPS) for the United States in 1976, and which has subsequently enjoyed widespread use internationally. ...
This article is about algorithms for encryption and decryption. ...
Acronyms Triple DES is also known as TDES, 3DES or, more standard, TDEA (Triple Data Encryption Algorithm [1]). The non-standard convention to use DES (standard) when we actually mean DEA (algorithm) is so widespread that in order to avoid confusion we use it in this article. On the other hand, since there are variations of TDES which use two different keys (2TDES) and three different keys (3TDES) the standard abbreviation 3DES is used.
Algorithm When it was found that a 56-bit key of DES is not enough to guard against brute force attacks, TDES was chosen as a simple way to enlarge the key space without a need to switch to a new algorithm. The use of three steps is essential to prevent meet-in-the-middle attacks that are effective against double DES encryption. Note that DES is not a group; if it were one, the TDES construction would be equivalent to a single DES operation and no more secure. The Meet-in-the-middle attack is a cryptographic attack which, like the Birthday attack, makes use of a space-time tradeoff. ...
This picture illustrates how the hours on a clock form a group under modular addition. ...
The simplest variant of TDES operates as follows: DES(k3;DES(k2;DES(k1;M))), where M is the message block to be encrypted and k1, k2, and k3 are DES keys. This variant is commonly known as EEE because all three DES operations are encryptions. In order to simplify interoperability between DES and TDES the middle step is usually replaced with decryption (EDE mode): DES(k3;DES − 1(k2;DES(k1;M))) and so a single DES encryption with key k can be represented as TDES-EDE with k1 = k2 = k3 = k. The choice of decryption for the middle step does not affect the security of the algorithm.
Security In general TDES with three different keys (3TDES) has a key length of 168 bits: three 56-bit DES keys (with parity bits 3TDES has the total storage length of 192 bits), but due to the meet-in-the-middle attack the effective security it provides is only 112 bits. A variant, called two-key TDES (2TDES), uses k1 = k3, thus reducing the key size to 112 bits and the storage length to 128 bits. However, this mode is susceptible to certain chosen-plaintext or known-plaintext attacks [2] [3] and thus it is officially [4] designated to have only 80-bits of security. In cryptography, the key size (alternatively key length) is a measure of the number of possible keys which can be used in a cipher. ...
A key is a piece of information that controls the operation of a cryptography algorithm. ...
The Meet-in-the-middle attack is a cryptographic attack which, like the Birthday attack, makes use of a space-time tradeoff. ...
A chosen plaintext attack is any form of cryptanalysis which presumes that the attacker has the capability to choose arbitrary plaintexts to be encrypted and obtain the corresponding ciphertexts. ...
The known-plaintext attack (KPA) is an attack model for cryptanalytic where the attacker has samples of both the plaintext and its encrypted version (ciphertext) and is at liberty to make use of them to reveal further secret information; typically this is the secret key. ...
As of 2005, the best attack known on 3TDES requires around 232 known plaintexts, 2113 steps, 290 single DES encryptions, and 288 memory[5] (the paper presents other tradeoffs between time and memory). This is not currently practical. If the attacker seeks to discover any one of many cryptographic keys, there is a memory-efficient attack which will discover one of 228 keys, given a handful of chosen plaintexts per key and around 284 encryption operations[6]. This attack is highly parallelizable and verges on the practical, given billion-dollar budgets and years to mount the attack, though the circumstances in which it would be useful are limited. 2005 is a common year starting on Saturday of the Gregorian calendar. ...
Usage TDES is slowly disappearing from use, largely replaced by its natural successor, the Advanced Encryption Standard (AES). One large-scale exception is within the electronic payments industry, which still uses 2TDES extensively and continues to develop and promulgate standards based upon it (e.g. EMV). This guarantees that TDES will remain an active cryptographic standard well into the future. In cryptography, the Advanced Encryption Standard (AES), also known as Rijndael, is a block cipher adopted as an encryption standard by the U.S. government. ...
It has been suggested that Chip and PIN be merged into this article or section. ...
By design, DES and therefore TDES, suffer from slow performance in software; on modern processors, AES tends to be around six times faster. TDES is better suited to hardware implementations, and indeed where it is still used it tends to be with a hardware implementation (e.g., VPN appliances and the Nextel cellular and data network), but even there AES outperforms it. Finally, AES offers markedly higher security margins: a larger block size, potentially longer keys, and as of 2007, no known public cryptanalytic attacks. A Virtual Private Network, or VPN, is a private communications network usually used within a company, or by several different companies or organizations, communicating over a public network. ...
Sprint Nextel Corporation (NYSE: S), headquartered in Reston, Virginia, is one of the largest telecommunications companies in the United States. ...
See also In cryptography, DES-X (or DESX) is a variant on the DES (Data Encryption Standard) block cipher intended to increase the complexity of a brute force attack using a technique called key whitening. ...
Walter Tuchman led the Data Encryption Standard development team at IBM. He was also responsible for the development of Triple DES. Horst Feistel â¹The stub template below is included via a redirect that has been proposed for deletion. ...
Horst Feistel (30 January 1915(1)â14 November 1990) was a cryptographer who worked on the design of ciphers at IBM, initiating research that would culminate in the development of the Data Encryption Standard (DES) in the 1970s. ...
The Data Encryption Standard (DES) is a cipher (a method for encrypting information) selected as an official Federal Information Processing Standard (FIPS) for the United States in 1976, and which has subsequently enjoyed widespread use internationally. ...
In cryptography, the Advanced Encryption Standard (AES), also known as Rijndael, is a block cipher adopted as an encryption standard by the U.S. government. ...
References - ^ NIST, Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher (PDF), Special Publication 800-67.
- ^ Ralph Merkle, Martin Hellman: On the Security of Multiple Encryption (PDF), Communications of the ACM, Vol 24, No 7, pp 465–467, July 1981.
- ^ Paul van Oorschot, Michael J. Wiener , A known-plaintext attack on two-key triple encryption, EUROCRYPT'90, LNCS 473, 1990, pp 318–325.
- ^ NIST, Recommendation for Key Management — Part 1: general (PDF), Special Publication 800-57.
- ^ Stefan Lucks: Attacking Triple Encryption (PDF), Fast Software Encryption 1998, pp 239–253.
- ^ Eli Biham: How to Forge DES-Encrypted Messages in 228 Steps (PostScript), 1996.
| | | Algorithms: 3-Way | AES | Akelarre | Anubis | ARIA | BaseKing | Blowfish | C2 | Camellia | CAST-128 | CAST-256 | CIKS-1 | CIPHERUNICORN-A | CIPHERUNICORN-E | CMEA | Cobra | COCONUT98 | Crab | CRYPTON | CS-Cipher | DEAL | DES | DES-X | DFC | E2 | FEAL | FROG | G-DES | GOST | Grand Cru | Hasty Pudding Cipher | Hierocrypt | ICE | IDEA | IDEA NXT | Iraqi | Intel Cascade Cipher | KASUMI | KHAZAD | Khufu and Khafre | KN-Cipher | Libelle | LOKI89/91 | LOKI97 | Lucifer | M6 | MacGuffin | Madryga | MAGENTA | MARS | Mercy | MESH | MISTY1 | MMB | MWA | MULTI2 | NewDES | NOEKEON | NUSH | Q | RC2 | RC5 | RC6 | REDOC | Red Pike | S-1 | SAFER | SC2000 | SEED | Serpent | SHACAL | SHARK | Skipjack | SMS4 | Square | TEA | Triple DES | Twofish | UES | Xenon | xmx | XTEA | XXTEA | Zodiac | | Design: Feistel network | Key schedule | Product cipher | S-box | SPN Attacks: Brute force | Linear / Differential / Integral cryptanalysis | Mod n | Related-key | Slide | XSL PDF is an abbreviation with several meanings: Portable Document Format Post-doctoral fellowship Probability density function There also is an electronic design automation company named PDF Solutions. ...
Ralph C. Merkle (born 2 February 1952) is a pioneer in public key cryptography, and more recently a researcher and speaker on molecular nanotechnology and cryonics. ...
Martin Hellman - Wikipedia, the free encyclopedia /**/ @import /skins-1. ...
PDF is an abbreviation with several meanings: Portable Document Format Post-doctoral fellowship Probability density function There also is an electronic design automation company named PDF Solutions. ...
Communications of the ACM (CACM) is the flagship monthly magazine of the Association for Computing Machinery. ...
Paul C. van Oorschot is a cryptographer and computer security researcher, currently a professor of computer science at Carleton University. ...
EuroCrypt is a conditional access system for Multiplexed Analogue Components-encoded analogue satellite television. ...
PDF is an abbreviation with several meanings: Portable Document Format Post-doctoral fellowship Probability density function There also is an electronic design automation company named PDF Solutions. ...
Stefan Lucks is a cryptographer and cryptanalyst most well known for his attack on Triple DES, and for extending Lars Knudsens Square attack to Twofish a cipher outside the Square family, thus founding integral cryptanalysis. ...
PDF is an abbreviation with several meanings: Portable Document Format Post-doctoral fellowship Probability density function There also is an electronic design automation company named PDF Solutions. ...
Fast Software Encryption, often abbreviated FSE, is a workshop for cryptography research, focussed on symmetric-key cryptography with an emphasis on fast, practical techniques, as opposed to theory. ...
Eli Biham is an Israeli cryptographer and cryptanalyst, currently a professor at the Technion Israeli Institute of Technology Computer Science department. ...
PostScript (PS) is a page description language and programming language used primarily in the electronic and desktop publishing areas. ...
Encryption Decryption In cryptography, a block cipher is a symmetric key cipher which operates on fixed-length groups of bits, termed blocks, with an unvarying transformation. ...
In cryptography, 3-Way is a block cipher designed in 1994 by Joan Daemen, who also (with Vincent Rijmen) designed Rijndael, the winner of NISTs Advanced Encryption Standard (AES) contest. ...
In cryptography, the Advanced Encryption Standard (AES), also known as Rijndael, is a block cipher adopted as an encryption standard by the U.S. government. ...
Akelarre is a block cipher proposed in 1996, and combined features from IDEA and RC5. ...
Anubis is a block cipher designed by Vincent Rijmen and Paulo S. L. M. Barreto as an entrant in the NESSIE project. ...
In cryptography, ARIA is a block cipher designed in 2003 by a large group of Korean researchers. ...
In cryptography, BaseKing is a block cipher designed in 1994 by Joan Daemen. ...
In cryptography, Blowfish is a keyed, symmetric block cipher, designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products. ...
The Cryptomeria cipher, commonly refered to as C2 is a proprietary block cipher defined and licensed by the 4C Entity. ...
In cryptography, Camellia is a block cipher that has been evaluated favorably by several organisations, including the European Unions NESSIE project (a selected algorithm), and the Japanese CRYPTREC project (a recommended algorithm). ...
Three rounds of the CAST-128 block cipher In cryptography, CAST-128 (alternatively CAST5) is a block cipher used in a number of products, notably as the default cipher in some versions of GPG and PGP. It has also been approved for Canadian government use by the Communications Security Establishment. ...
In cryptography, CAST-256 (or CAST6) is a block cipher published in June 1998 and submitted as a candidate for the Advanced Encryption Standard (AES). ...
In cryptography, CIKS-1 is a block cipher designed in 2002 by A.A. Moldovyan and N.A. Moldovyan. ...
In cryptography, CIPHERUNICORN-A is a block cipher created by NEC in 2000. ...
In cryptography, CIPHERUNICORN-E is a block cipher created by NEC in 1998. ...
In cryptography, the Cellular Message Encryption Algorithm (CMEA) is a block cipher which was used for securing mobile phones in the United States. ...
In cryptography, Cobra is the general name of a family of data-dependent permutation based block ciphers: Cobra-128, Cobra-F64a, Cobra-F64b, Cobra-H64 and Cobra-H128. ...
In cryptography, COCONUT98 (Cipher Organized with Cute Operations and N-Universal Transformation) is a block cipher designed by Serge Vaudenay in 1998. ...
In cryptography, Crab is a block cipher created by Burt Kaliski and Matt Robshaw in 1993. ...
In particle physics, the crypton is a hypothetical superheavy particle, thought to exist in a hidden sector of string theory. ...
In cryptography, the CS-Cipher is a block cipher invented by Jacques Stern and Serge Vaudenay in 1998. ...
Deal can refer to: an agreement reached after negotiation, for example a contract to sell as a dealer or dealership a bargain a situation, as in whats the deal with the Johnson account ?. a problem, as in whats your deal ?. Deal$, a U.S. dollar store a Deal...
The Data Encryption Standard (DES) is a cipher (a method for encrypting information) selected as an official Federal Information Processing Standard (FIPS) for the United States in 1976, and which has subsequently enjoyed widespread use internationally. ...
In cryptography, DES-X (or DESX) is a variant on the DES (Data Encryption Standard) block cipher intended to increase the complexity of a brute force attack using a technique called key whitening. ...
In cryptography, DFC (Decorrelated Fast Cipher) is a block cipher which was created in 1998 by a group of researchers at Ãcole Normale Supérieure and submitted to the AES competition. ...
In cryptography, E2 is a block cipher which was created in 1998 by NTT and submitted to the AES competition. ...
General Designer(s) Akihiro Shimizu and Shoji Miyaguchi (NTT) First published FEAL-4 in 1987; FEAL-N/NX in 1990 Derived from - Cipher(s) based on this design - Algorithm detail Block size(s) 64 bits Key size(s) 64 bits (128 bits for FEAL-NX) Structure Feistel network Number of...
Distribution of frogs (in black) Suborders Archaeobatrachia Mesobatrachia Neobatrachia - List of Anuran families The frogness babe is an amphibian in the order Anura (meaning tail-less from Greek an-, without + oura, tail), formerly referred to as Salientia (Latin saltare, to jump). ...
In cryptography, the Generalized DES Scheme (G-DES or GDES) is a variant of the DES block cipher designed to speed-up the encryption. ...
Diagram of GOST In cryptography, GOST (Russian ÐÐСТ) (GOsudarstvennyi STandard, Russian for Government Standard) is a symmetric key block cipher published in 1990 as the Soviet standard (GOST 28147-89). ...
In cryptography, Grand Cru is a block cipher invented in 2000 by Johan Borst. ...
The Hasty Pudding Cipher (abbreviated HPC) is a variable-block-size block cipher which was an unsuccessful candidate in the competition for selecting the U.S. Advanced Encryption Standard. ...
In cryptography, Hierocrypt-L1 and Hierocrypt-3 are block ciphers created by Toshiba in 2000. ...
General Designer(s) Matthew Kwan First published 1997 Derived from (DES) Cipher(s) based on this design - Algorithm detail Block size(s) 64 bits Key size(s) 64 bits for ICE, 64n for ICE-n Structure Feistel network Number of rounds 16 for ICE, 8 for Thin-ICE, 16n for...
In cryptography, the International Data Encryption Algorithm (IDEA) is a block cipher designed by Xuejia Lai (ä¾å¸å) and James L. Massey of ETH Zurich and was first described in 1991. ...
In cryptography, the IDEA NXT algorithm (previously known as FOX) is a block cipher designed by Pascal Junod and Serge Vaudenay of EPFL (Lausanne, Switzerland). ...
In cryptography, the Intel Cascaded Cipher, is a relatively new, high bandwidth block cipher, used as an optional component of the Output Content Protection DRM scheme of the Microsoft Windows Vista operating system. ...
In cryptography, KASUMI, also termed A5/3, is a block cipher used in the confidentiality (f8) and integrity algorithms (f9) for 3GPP mobile communications. ...
In cryptography, KHAZAD is a block cipher designed by Paulo S. L. M. Barreto together with Vincent Rijmen, one of the designers of the Advanced Encryption Standard (Rijndael). ...
In cryptography, Khufu and Khafre are two block ciphers designed by Ralph Merkle in 1989 while working at Xeroxs Palo Alto Research Center. ...
In cryptography, KN-Cipher is a block cipher created by Kaisa Nyberg and Lars Knudsen in 1995. ...
Libelle is a German cipher system, developed by the Federal Office for Information Security. ...
It has been suggested that Loki and the dwarfs be merged into this article or section. ...
In cryptography, LOKI97 is a block cipher which was a candidate in the Advanced Encryption Standard competition. ...
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 Encryption Standard. ...
In cryptography, M6 is a block cipher proposed by Hitachi in 1997 for use in the IEEE 1394 FireWire standard. ...
In cryptography, MacGuffin is a block cipher created in 1994 by Bruce Schneier and Matt Blaze at a Fast Software Encryption workshop. ...
In cryptography, Madryga is a block cipher created in 1984 by W. E. Madryga. ...
Magenta is a color made up of equal parts of red and blue light. ...
Adjectives: Martian Atmosphere Surface pressure: 0. ...
In cryptography, Mercy is a block cipher designed by Paul Crowley for disk encryption. ...
In cryptography, MESH is a block cipher designed in 2002 by Jorge Nakahara, Jr. ...
In cryptography, MISTY1 (or MISTY-1) is a block cipher designed in 1995 by Mitsuru Matsui and others for Mitsubishi Electric. ...
In cryptography, MMB (Modular Multiplication-based Block cipher) is a block cipher designed by Joan Daemen as an improved replacement for the IDEA cipher. ...
This article is about the MWA encryption algorithm. ...
MULTI2 is a block cipher, developed by Hitachi in 1988. ...
In cryptography, NewDES is a symmetric key block cipher. ...
Noekeon is a block cipher with a block and key length of 128 bits. ...
In cryptography, NUSH is a block cipher invented by Anatoly Lebedev and Alexey Volchkov for LAN Crypto, a Russian company. ...
In cryptography, Q is a block cipher invented by Leslie McBride. ...
In cryptography, RC2 is a block cipher designed by Ron Rivest in 1987. ...
RC5 is a block cipher notable for its simplicity. ...
In cryptography, RC6 is a symmetric key block cipher derived from RC5. ...
In cryptography, REDOC II and REDOC III are block ciphers designed by Michael Wood for Cryptech Inc and are optimised for use in software. ...
Red Pike is a classified United Kingdom government cipher, proposed for use by the National Health Service by GCHQ, but designed for a broad range of applications in the British government [1]. Little is publicly known about Red Pike, except that it is a block cipher with a 64-bit...
Uplandia Regiment, or Upplands regemente, also S 1, is a Swedish Army signaling regiment that traces its origins back to the 19th Century. ...
This article is about the encryption algorithm. ...
In cryptography, SC2000 is a block cipher invented by a research group at Fujitsu Labs. ...
A ripe red jalapeño cut open to show the seeds For other uses, see Seed (disambiguation). ...
Serpent is a symmetric key block cipher which was a finalist in the Advanced Encryption Standard contest, where it came second to Rijndael. ...
SHACAL-1 and SHACAL-2 are block ciphers based on cryptographic hash function from the SHA family. ...
Orders Carcharhiniformes Heterodontiformes Hexanchiformes Lamniformes Orectolobiformes Pristiophoriformes Squaliformes Squatiniformes â Symmoriida Sharks (superorder Selachimorpha) are fish with a full cartilaginous skeleton [1] and a streamlined body. ...
In cryptography, Skipjack is a block cipher â an algorithm for encryption â developed by the U.S. National Security Agency (NSA). ...
SMS4 is a block cipher used in Chinese National Standard for Wireless LAN WAPI (Wired Authentication and Privacy Infrastructure). ...
In cryptography, Square (sometimes written SQUARE) is a block cipher invented by Joan Daemen and Vincent Rijmen. ...
General Designer(s) Roger Needham and David Wheeler First published 1994 Derived from - Cipher(s) based on this design XTEA Algorithm detail Block size(s) 64 bits Key size(s) 128 bits Structure Feistel network Number of rounds variable; recommended 64 Feistel rounds; 32 cycles Best cryptanalysis TEA suffers from...
In cryptography, Twofish is a symmetric key block cipher with a block size of 128 bits and key sizes up to 256 bits. ...
This article is about the block cipher. ...
In cryptography, Xenon is a block cipher designed in 2000 by Chang-Hyi Lee for the Korean firm SoftForum. ...
In cryptography, xmx is a block cipher designed in 1997 by David MRaïhi, David Naccache, Jacques Stern, and Serge Vaudenay. ...
General Designer(s) Roger Needham and David Wheeler First published 1997 Derived from Tiny Encryption Algorithm (TEA) Cipher(s) based on this design - Algorithm detail Block size(s) 64 bits Key size(s) 128 bits Structure Feistel network Number of rounds variable; recommended 64 Feistel rounds; 32 cycles Best cryptanalysis...
In cryptography, Corrected Block TEA (often referred to as XXTEA) is a block cipher designed to correct weaknesses in the original Block TEA (Tiny Encryption Algorithm), which was first published together with a paper on âTea extensionsâ. The cipherâs designers were Roger Needham and David Wheeler of the Cambridge...
In cryptography, Zodiac is a block cipher designed in 2000 by Chang-Hyi Lee for the Korean firm SoftForum. ...
In cryptography, a Feistel cipher is a block cipher with a symmetric structure, named after IBM cryptographer Horst Feistel; it is also commonly known as a Feistel network. ...
The key-schedule of DES (<<< denotes a left rotation) In cryptography, the so-called product ciphers are a certain kind of ciphers, where the (de-)ciphering of data is done in rounds. The general setup of each round is the same, except for some hard-coded parameters and a part...
In cryptography, a product cipher is a popular type of block cipher that works by executing in sequence a number of simple transformations such as substitution, permutation, and modular arithmetic. ...
In cryptography, a substitution box (or S-box) is a basic component of symmetric key algorithms. ...
In cryptography, an SP-network, or substitution-permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES. These networks consist of S-boxes and P-boxes that transform blocks of input bits into output bits. ...
The EFFs US$250,000 DES cracking machine contained over 1,800 custom chips and could brute force a DES key in a matter of days â the photograph shows a DES Cracker circuit board fitted with several Deep Crack chips. ...
In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. ...
Differential cryptanalysis is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. ...
In cryptography, integral cryptanalysis is a cryptanalytic attack that is particularly applicable to block ciphers based around Substitution-permutation networks. ...
Cryptanalysis (from the Greek kryptós, hidden, and analýein, to loosen or to untie) is the study of methods for obtaining the meaning of encrypted information, without access to the secret information which is normally required to do so. ...
In cryptography, mod n cryptanalysis is an attack applicable to block and stream ciphers. ...
In cryptography, a related-key attack is any form of cryptanalysis where the attacker can observe the operation of a cipher under several different keys whose values are initially unknown, but where some mathematical relationship connecting the keys is known to the attacker. ...
The idea of the slide attack was originally published by Edna Grossman and Bryant Tuckerman in an IBM Technical Report in 1977. ...
New Scientist magazine featured the XSL attack in June 2003 with an article billed as Cipher crisis: the end of internet privacy. In cryptography, the XSL attack is a method of cryptanalysis for block ciphers. ...
| | Standardization: AES process | CRYPTREC | NESSIE Misc: Avalanche effect | Block size | IV | Key size | Modes of operation | Piling-up lemma | Weak key The Advanced Encryption Standard (AES), the block cipher ratified as a standard by National Institute of Standards and Technology (NIST), was chosen using a process markedly more open and transparent than its predecessor, the ageing Data Encryption Standard (DES). ...
CRYPTREC is the Cryptography Research and Evaluation Committee set up by the Japanese Government to evaluate and recommend cryptographic techniques for government and industrial use. ...
NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000–2003 to identify secure cryptographic primitives. ...
This article is about cryptography; for other meanings, see snowball effect. ...
In modern cryptography, symmetric key ciphers are generally divided into stream ciphers and block ciphers. ...
In cryptography, an initialization vector (IV) is a block of bits that is required to allow a stream cipher or a block cipher executed in any of several streaming modes of operation to produce a unique stream independent from other streams produced by the same encryption key, without having to...
In cryptography, the key size (alternatively key length) is the size of the digits used to create an encrypted text; it is therefore also a measure of the number of possible keys which can be used in a cipher, and the number of keys which must be tested to break...
In cryptography, a block cipher operates on blocks of fixed length, often 64 or 128 bits. ...
In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. ...
In cryptography, a weak key is a key which when used with a specific cipher, makes the cipher behave in some undesirable way. ...
| | | | History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography | | Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers | |