Categories: Cryptography stubs | Block ciphers 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, BaseKing is a block cipher designed in 1994 by Joan Daemen. ... General Designer(s) Bruce Schneier First published 1993 Derived from - Cipher(s) based on this design Twofish Algorithm detail Block size(s) 64 bits Key size(s) 32-448 bits in steps of 8 bits; default 128 bits Structure Feistel network Number of rounds 16 Best cryptanalysis Four rounds of... 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, 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, Crab is a block cipher created by Burt Kaliski and Matt Robshaw in 1993. ... 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. ... 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 frog is an amphibian in the order Anura (meaning tail-less from Greek an-, without + oura, tail). ... 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). ... 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. ... 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, 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. ... Libelle is a German cipher system, developed by the Federal Office for Information Security. ... This picture, from an 18th century Icelandic manuscript, shows Loki with his invention - the fishing net. ... General Designer(s) Lawrie Brown, assisted by Jennifer Seberry and Josef Pieprzyk First published 1998 Derived from LOKI91 Cipher(s) based on this design - Algorithm detail Block size(s) 128 bits Key size(s) 128, 192 or 256 bits Structure Feistel network Number of rounds 16 Best cryptanalysis Linear cryptanalysis... 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, 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. ... Note: This article contains special characters. ... 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. ... 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. ... General Designer(s) Ron Rivest First published 1994 Derived from - Cipher(s) based on this design RC6, Akelarre Algorithm detail Block size(s) 32, 64 or 128 bits (64 suggested) Key size(s) 0 to 2040 bits (128 suggested) Structure Feistel network Number of rounds 12 suggested originally Best cryptanalysis... 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 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 US 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, Triple DES (also 3DES) is a block cipher formed from the Data Encryption Standard (DES) cipher. ... In cryptography, Twofish is a symmetric key block cipher with a block size of 128 bits and key sizes up to 256 bits. ... 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... Feistel cipher - Wikipedia /**/ @import /skins-1. ... The key-schedule of DES In cryptography, the algorithm for computing the subkeys for each round in a product cipher from the encryption (or decryption) key is called the key schedule. ... 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 cryptanalysis, a brute force attack is a method... 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. ... 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 a measure of the number of possible keys which can be used in a cipher. ... 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. ... 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 γράφειν gráfein to write) is the study of message secrecy. ... The history of cryptography dates back thousands of years. ... 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. ... This article is intended to be an analytic glossary, or alternatively, an organized collection of annotated pointers. ... Symmetric-key algorithms are a class of algorithms for cryptography that use trivially related cryptographic keys for both decryption and encryption. ... 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 operation of A5/1, a LFSR-based stream cipher used to encrypt mobile phone conversations. ... Public key cryptography is a form of cryptography which generally allows users to communicate securely without having prior access to a shared secret key. ... In cryptography, a cryptographic hash function is a hash function with certain additional security properties to make it suitable for use as a primitive in various information security applications, such as authentication and message integrity. ... A cryptographic message authentication code (MAC) is a short piece of information used to authenticate a message. ... A cryptographically secure pseudo-random number generator (CSPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography. ...