Search results

Jump to navigation Jump to search

Page title matches

  • * The [[Data Encryption Standard]] itself, the first well-known Feistel cipher, using 16 rounds and eight 6 by 4 S-boxes. ...T cipher]], a Soviet standard similar in design to DES, a 32-round Feistel cipher using eight 4 by 4 S-boxes.
    4 KB (551 words) - 12:36, 13 April 2016
  • <th>Cipher</th><th>Type</th><th>Block size</th><th>Key size</th><th>Rounds</th><th>S-b <td>[[CAST cipher#CAST-128|CAST-128]]</td><td>Feistel</td><td>64</td><td>40 to 128</td><td>16
    7 KB (1,292 words) - 12:20, 27 July 2010
  • ...can be [[cryptography#two-way encryption|encrypted]] in two basic ways, '''cipher''' and [[code]]. For a discussion of the applications of each, see the [[Cr ...re of linguistic structure such as words. It would make no difference to a cipher if its inputs were the complete works of [[William Shakespeare]], a digitiz
    12 KB (1,744 words) - 05:48, 8 April 2024
  • ...ersy, with many people citing [[Kerckhoffs' Principle]] and arguing that a cipher whose details were classified could not be trusted. Some felt that nothing ...ally, the algorithm was de-classified. Skipjack is an unbalanced [[Feistel cipher]] with 64-bit blocks, an 80-bit key and 32 rounds. Once the algorithm was p
    1 KB (187 words) - 05:48, 8 April 2024
  • ...rther down the alphabet. It was named after [[Julius Caesar]] who used the cipher with a shift of 3 in order to communicate with his generals during his vari One Caesar cipher is still in use; [[rot 13]] is used to hide "spoilers" such as the ending o
    714 bytes (116 words) - 05:48, 8 April 2024
  • '''CAST''' is a general procedure for constructing a family of [[block cipher]]s; individual ciphers have names like [[#CAST-128|CAST-128]] and [[#CAST-2 CAST ciphers are [[Feistel cipher]]s using large S-boxes, 8*32 rather than the 6*4 of DES. They are primarily
    9 KB (1,452 words) - 05:49, 8 April 2024
  • | title = CRYPTON: A New 128-bit Block Cipher - Specification and Analysis (Version 1.0) | title = Hardware Design and Performance Estimation of The 128-bit Block Cipher CRYPTON
    1,005 bytes (151 words) - 14:12, 30 September 2009
  • 40 bytes (4 words) - 05:38, 2 November 2008
  • The '''Blowfish''' [[block cipher]] | title=Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish)
    2 KB (377 words) - 05:49, 8 April 2024
  • '''E2''' is a [[block cipher]] from [[Nippon Telephone and Telegraph]]. It was candidate in the [[AES co | title = Cryptanalysis of a Reduced Version of the Block Cipher E2
    941 bytes (134 words) - 05:48, 8 April 2024
  • | title = Twofish: A 128-Bit Block Cipher ...s of 128, 192 or 256 bits. It is a 16-round [[#Feistel structure | Feistel cipher]] using four key-dependent 8*8 S-boxes.
    1 KB (176 words) - 05:48, 8 April 2024
  • #REDIRECT [[CAST (cipher)]]
    27 bytes (3 words) - 12:43, 23 July 2009
  • ...iving a block of [[ciphertext]] for each. The other main type are [[stream cipher]]s, which generate a continuous stream of keying material to be mixed with ...ial components in many security systems. However, just having a good block cipher does not give you security, much as just having good tires does not give yo
    53 KB (8,371 words) - 05:48, 8 April 2024
  • In [[cryptography]], a '''stream cipher''' is a symmetric [[cipher]] which encrypts data by combining the plaintext with pseudorandom data to ...&mdash; to infer the internal state of the generator; that would break the cipher completely.
    24 KB (3,851 words) - 05:49, 8 April 2024
  • is a [[block cipher]] that was a candidate in the [[AES competition]]; it did not make it into DEAL is a [[Feistel cipher]] using [[Data Encryption Standard|DES]] as the F function. Six rounds were
    1 KB (215 words) - 14:23, 30 September 2009
  • 30 bytes (4 words) - 10:18, 16 March 2010
  • '''Camellia''' is a [[block cipher]] from [[Mitsubshi]] and [[Nippon Telephone and Telegraph]]. It can be used ...er keys. Some of the design is quite similar to NTT's earlier cipher [[E2 (cipher)|E2]], which was a candidate in the [[AES competition]].
    783 bytes (126 words) - 05:48, 8 April 2024
  • ...t blocks and supports key sizes of 128, 192 or 256 bits. It is a [[Feistel cipher]] with six or eight rounds. | title = The MAGENTA Block Cipher Algorithm
    2 KB (235 words) - 05:49, 8 April 2024
  • ...n be used to hide information or send secret messages. Below is the Atbash Cipher: Basically, the cipher uses a reverse alphabet, so you subject a letter for its corresponding reve
    717 bytes (145 words) - 23:21, 24 September 2007
  • ...urity Agency]] (KISA) and widely used in Korea. It is a 16-round [[Feistel cipher]] using two 8 by 8 S-boxes.
    435 bytes (67 words) - 05:48, 8 April 2024
  • ...Secure and Fast Encryption Routine''', is the name for a series of [[block cipher]]s designed by [[James Massey]] and co-workers for [[Cylink]] Corporation. ...ly stands for 'Stop Knudsen', a wise precaution in the design of any block cipher".
    1 KB (221 words) - 05:48, 8 April 2024
  • ...to a computer nor to carry anything that might be incriminating, such as a cipher machine or a book of [[one-time pad]] material. ...by [[Ian Goldberg]]. There are other implementations; see the [[Solitaire_(cipher)/External_Links|links]].
    949 bytes (145 words) - 23:50, 12 May 2011
  • '''Serpent''' is a [[block cipher]] designed by an international team of well-known researchers &mdash; [[Ros Serpent is an [[Block cipher#SP network | SP network]] with 32 rounds. It uses eight 4 by 4 S-boxes, but
    903 bytes (147 words) - 05:49, 8 April 2024
  • #Redirect [[Stream cipher]]
    27 bytes (3 words) - 15:14, 24 October 2008
  • '''LOKI''' is the name of a series of [[block cipher]]s from an Australian group led by [[Jennifer Seberry]]. The original LOKI, later renamed '''LOKI89''', was a [[Feistel cipher]] with 64-bit blocks taking a 64-bit key. It had some weaknesses. LOKI was
    1 KB (192 words) - 05:48, 8 April 2024
  • '''MARS''' is a [[block cipher]] designed by [[IBM]] as a candidate for the [[AES competition]]; it was ch It uses a variant of the [[Feistel cipher | Feistel structure]] which they call a "type 3 Feistel network"; the 128-b
    792 bytes (128 words) - 05:49, 8 April 2024
  • #Redirect [[Block cipher]]
    26 bytes (3 words) - 17:18, 24 October 2008
  • ...inning candidate in the [[AES competition]]. Like AES, Square is a [[Block cipher#SP networks|substitution-permutation network]] operating on 128-bit blocks. ...quare attack''', to break Square. It was published at the same time as the cipher itself.
    659 bytes (101 words) - 05:48, 8 April 2024
  • 352 bytes (48 words) - 22:02, 31 July 2008
  • is a [[block cipher]] designed as a candidate for the [[AES competition]]; it did not make it i ...dding]], FROG is a [[Block cipher#Large block ciphers| variable size block cipher]] and a rather unorthodox design. It supports block sizes from 8 to 128 byt
    1 KB (225 words) - 14:53, 30 September 2009
  • 44 bytes (5 words) - 04:51, 26 October 2008
  • ARIA is a [[block cipher]] developed in [[South Korea]], and an official standard (KS X 1213) there. There is a [http://210.104.33.10/ARIA/index-e.html home page] for the cipher. Internet RFC 5794 gives a specification of the algorithm for Internet use
    664 bytes (101 words) - 10:08, 2 December 2013
  • The '''GOST cipher''' was a standard [[block cipher]] in the [[Soviet Union]]. GOST was a Soviet national standards body. There The GOST cipher
    1 KB (228 words) - 05:49, 8 April 2024
  • #REDIRECT [[De-correlated Fast Cipher]]
    39 bytes (4 words) - 22:17, 24 July 2009
  • A block cipher that is a South Korean government standard.
    94 bytes (13 words) - 14:45, 2 December 2013
  • A block cipher that was IBM's submission to the Advanced Encryption Standard process.
    122 bytes (16 words) - 00:22, 1 October 2009
  • A block cipher developed by the Korean Information Security Agency, used broadly throughou
    179 bytes (23 words) - 06:59, 1 October 2009
  • A block cipher which was a finalist in the Advanced Encryption Standard (AES) contest, des
    179 bytes (26 words) - 05:41, 14 June 2010
  • One of the first [[cipher]]s, developed by [[Julius Caesar]]
    96 bytes (13 words) - 18:40, 9 August 2008
  • A block cipher developed by the U.S. National Security Agency (NSA); initially classified,
    197 bytes (28 words) - 07:02, 1 October 2009
  • ...pher, designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products.
    160 bytes (23 words) - 05:59, 14 June 2010
  • A [[block cipher]] invented by Joan Daemen and Vincent Rijmen, and a forerunner to the [[Rij
    211 bytes (29 words) - 17:13, 22 January 2010
  • A block cipher developed jointly by Mitsubishi and NTT in 2000, which has similar design e
    174 bytes (25 words) - 06:27, 1 October 2009
  • The '''Hasty Pudding Cipher''' or '''HPC''' is a [[block cipher]] designed by [[Rich Schroeppel]]. It was, in some ways, the most interesti ...erefore might be ideal for things like encrypting disk blocks; see [[Block cipher#Large-block ciphers| large block ciphers]]. Also, quoting the home page "Ar
    1 KB (179 words) - 05:49, 8 April 2024
  • A block cipher efficient in hardware implementations, designed by Chae Hoon Lim of Future
    139 bytes (19 words) - 06:31, 1 October 2009
  • 100 bytes (13 words) - 06:22, 4 September 2009
  • A symmetric cipher that operates on fixed-size blocks of plaintext, giving a block of cipherte
    141 bytes (20 words) - 10:24, 22 October 2008
  • There are several theses that contributed important ideas to block cipher design: ...etwork Cryptosystems'', Queen's University (1990), introducing the [[CAST (cipher)|CAST ciphers]]
    2 KB (315 words) - 09:05, 27 September 2009
  • Simple substitution cipher for the Hebrew alphabet, involving aleph (the first letter) for tav (the la
    224 bytes (33 words) - 05:15, 16 September 2009
  • A block cipher derived from the Data Encryption Standard (DES), from a design proposed in
    160 bytes (24 words) - 06:39, 1 October 2009
  • A cipher that encrypts data by mixing it with the output of a pseudorandom number ge
    266 bytes (44 words) - 05:45, 24 October 2008
  • 138 bytes (18 words) - 21:42, 29 April 2009
  • A bock cipher from Schneier and others that was a finalist in the AES competition.
    118 bytes (18 words) - 21:35, 30 September 2009
  • 12 bytes (1 word) - 23:20, 24 September 2007
  • A block cipher which was created in 1998 by NTT and submitted to the AES competition.
    122 bytes (18 words) - 06:42, 1 October 2009
  • <noinclude>{{Subpages}}</noinclude>A stream cipher that uses a shuffled deck of cards as its main mechanism.
    108 bytes (17 words) - 23:24, 12 May 2011
  • A block cipher authored by Georgoudis, Leroux and Chaves, which can work with any block si
    202 bytes (29 words) - 06:45, 1 October 2009
  • ...Catalogs/Cipher list|list of block ciphers]] and a [[Block cipher/Catalogs/Cipher table|table]] showing some of their properties.
    281 bytes (42 words) - 16:57, 10 August 2009
  • 144 bytes (18 words) - 00:15, 1 October 2009
  • ...n government standard symmetric key block cipher; also based on this block cipher is the GOST hash function.
    164 bytes (24 words) - 06:48, 1 October 2009
  • A block cipher developed by Michael Jacobson Jr. and Klaus Huber for Deutsche Telekom.
    123 bytes (17 words) - 06:47, 14 June 2010
  • {{r|Block cipher}} {{r|Stream cipher}}
    844 bytes (96 words) - 14:48, 4 April 2024
  • 161 bytes (24 words) - 06:57, 1 October 2009
  • {{r|Cipher}} {{r|Block cipher modes of operation}}
    640 bytes (81 words) - 04:17, 27 April 2010
  • Auto-populated based on [[Special:WhatLinksHere/Caesar cipher]]. Needs checking by a human. {{r|Cipher}}
    547 bytes (70 words) - 11:35, 11 January 2010
  • '''DFC''' or '''De-correlated Fast Cipher''' | author= Decorrelated Fast Cipher: an AES candidate
    2 KB (309 words) - 05:48, 8 April 2024
  • #REDIRECT [[Block cipher/Catalogs/Cipher list]]
    47 bytes (6 words) - 01:46, 9 August 2009
  • Auto-populated based on [[Special:WhatLinksHere/Blowfish (cipher)]]. Needs checking by a human. {{r|Block cipher}}
    525 bytes (69 words) - 10:50, 1 March 2010
  • 141 bytes (16 words) - 06:04, 31 March 2009
  • Auto-populated based on [[Special:WhatLinksHere/CAST (cipher)]]. Needs checking by a human. {{r|Block cipher}}
    466 bytes (62 words) - 11:41, 11 January 2010
  • These pages are all maintained by the cipher designers. They include links to the design papers, to implementations, and There are other RFCs covering [[block cipher modes of operation]] and how these ciphers should be used in protocols such
    4 KB (600 words) - 23:49, 7 June 2012
  • A variable-block-size block cipher designed by Richard Schroeppel, which has its input block size and key leng
    202 bytes (28 words) - 23:59, 30 September 2009
  • 151 bytes (21 words) - 00:17, 13 May 2011
  • ...he wrong mode for the task at hand may give an insecure system even if the cipher itself is secure. ...r Modes of Operation" <ref>{{cite paper | title = Recommendation for Block Cipher Modes of Operation | publisher = National Institute for Standards & Technol
    8 KB (1,297 words) - 05:48, 8 April 2024
  • 50 bytes (6 words) - 22:47, 24 July 2009
  • A block cipher which was created in 1998 by a group of researchers from École Normale Sup
    202 bytes (32 words) - 06:34, 1 October 2009
  • 81 bytes (10 words) - 02:46, 25 November 2010
  • 169 bytes (19 words) - 16:51, 30 October 2008
  • Methods of combining multiple block cipher operations to achieve a larger goal.
    115 bytes (15 words) - 03:31, 23 May 2009
  • Auto-populated based on [[Special:WhatLinksHere/Block cipher modes of operation]]. Needs checking by a human. {{r|Block cipher}}
    597 bytes (79 words) - 11:25, 11 January 2010

Page text matches

  • {{r|Block cipher}} {{r|Blowfish (cipher)}}
    899 bytes (119 words) - 07:46, 8 January 2010
  • #REDIRECT [[Block cipher/Catalogs/Cipher list]]
    47 bytes (6 words) - 01:46, 9 August 2009
  • ...design of the [[Data Encryption Standard]] and its predecessor, [[Lucifer (cipher)|Lucifer]]. [[Feistel cipher]]s, a class of [[block cipher]], are named after him.
    269 bytes (38 words) - 09:03, 6 October 2010
  • ...ert, best known for designing the [[CAST (cipher)|CAST]] family of [[block cipher]]s.
    157 bytes (21 words) - 14:01, 22 May 2011
  • ...Catalogs/Cipher list|list of block ciphers]] and a [[Block cipher/Catalogs/Cipher table|table]] showing some of their properties.
    281 bytes (42 words) - 16:57, 10 August 2009
  • ...n government standard symmetric key block cipher; also based on this block cipher is the GOST hash function.
    164 bytes (24 words) - 06:48, 1 October 2009
  • {{r|Cipher}} {{r|Block cipher modes of operation}}
    640 bytes (81 words) - 04:17, 27 April 2010
  • ...our; the objective is to build up an overall approximation that breaks the cipher.
    194 bytes (26 words) - 02:00, 2 November 2008
  • ...pher, designed in 1993 by Bruce Schneier and included in a large number of cipher suites and encryption products.
    160 bytes (23 words) - 05:59, 14 June 2010
  • {{r|Block cipher}} {{r|Stream cipher}}
    844 bytes (96 words) - 14:48, 4 April 2024
  • ...ing]], a [[Block_cipher_modes_of_operation|mode of operation]] for [[block cipher]]s.
    285 bytes (39 words) - 21:40, 24 November 2011
  • Auto-populated based on [[Special:WhatLinksHere/Blowfish (cipher)]]. Needs checking by a human. {{r|Block cipher}}
    525 bytes (69 words) - 10:50, 1 March 2010
  • '''Camellia''' is a [[block cipher]] from [[Mitsubshi]] and [[Nippon Telephone and Telegraph]]. It can be used ...er keys. Some of the design is quite similar to NTT's earlier cipher [[E2 (cipher)|E2]], which was a candidate in the [[AES competition]].
    783 bytes (126 words) - 05:48, 8 April 2024
  • ...that security in a cipher should not depend on keeping the details of the cipher secret; it should depend only on keeping the key secret.
    222 bytes (34 words) - 05:48, 15 May 2009
  • ...rther down the alphabet. It was named after [[Julius Caesar]] who used the cipher with a shift of 3 in order to communicate with his generals during his vari One Caesar cipher is still in use; [[rot 13]] is used to hide "spoilers" such as the ending o
    714 bytes (116 words) - 05:48, 8 April 2024
  • ...block cipher, named because it applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.
    223 bytes (32 words) - 00:50, 1 October 2009
  • ...e was the main designer of the [[SAFER (cipher)| SAFER]] series of [[block cipher]]s for [[Cylink]] corporation and, with his student [[Xuejia Lai]], co-desi
    296 bytes (41 words) - 05:48, 8 April 2024
  • {{r|Block cipher}} {{r|Cipher}}
    973 bytes (125 words) - 14:41, 18 March 2024
  • ...the middle) in two independent ways, starting either from the input of the cipher (plaintext) or from the output ( ciphertext); he calculates some possible v
    352 bytes (53 words) - 00:56, 2 November 2008
  • The '''Hasty Pudding Cipher''' or '''HPC''' is a [[block cipher]] designed by [[Rich Schroeppel]]. It was, in some ways, the most interesti ...erefore might be ideal for things like encrypting disk blocks; see [[Block cipher#Large-block ciphers| large block ciphers]]. Also, quoting the home page "Ar
    1 KB (179 words) - 05:49, 8 April 2024
  • ...gong]]. Her work has included the [[LOKI (cipher)|LOKI]] family of [[block cipher]]s and the [[HAVAL]] family of [[cryptographic hash]] algorithms.
    308 bytes (46 words) - 09:35, 13 October 2010
  • ...inning candidate in the [[AES competition]]. Like AES, Square is a [[Block cipher#SP networks|substitution-permutation network]] operating on 128-bit blocks. ...quare attack''', to break Square. It was published at the same time as the cipher itself.
    659 bytes (101 words) - 05:48, 8 April 2024
  • {{r|Block cipher}} {{r|Caesar cipher}}
    1 KB (132 words) - 14:31, 22 March 2024
  • | title = Twofish: A 128-Bit Block Cipher ...s of 128, 192 or 256 bits. It is a 16-round [[#Feistel structure | Feistel cipher]] using four key-dependent 8*8 S-boxes.
    1 KB (176 words) - 05:48, 8 April 2024
  • Auto-populated based on [[Special:WhatLinksHere/Block cipher modes of operation]]. Needs checking by a human. {{r|Block cipher}}
    597 bytes (79 words) - 11:25, 11 January 2010
  • {{r|Block cipher modes of operation}} {{r|Block cipher}}
    587 bytes (76 words) - 20:45, 11 January 2010
  • #Redirect [[Block cipher]]
    26 bytes (3 words) - 17:18, 24 October 2008
  • #REDIRECT [[Blowfish (cipher)]]
    31 bytes (3 words) - 22:58, 14 November 2011
  • #REDIRECT [[Twofish (cipher)]]
    30 bytes (3 words) - 21:29, 30 September 2009
  • #REDIRECT [[CAST (cipher)]]
    27 bytes (3 words) - 12:43, 23 July 2009
  • #Redirect [[Stream cipher]]
    27 bytes (3 words) - 15:14, 24 October 2008
  • ...to a computer nor to carry anything that might be incriminating, such as a cipher machine or a book of [[one-time pad]] material. ...by [[Ian Goldberg]]. There are other implementations; see the [[Solitaire_(cipher)/External_Links|links]].
    949 bytes (145 words) - 23:50, 12 May 2011
  • ...ork]] such as Square, k is often chosen to be the size of a single [[Block cipher#S-boxes|S-box]]. The attack has since been applied to a number of other cip
    1 KB (171 words) - 05:48, 8 April 2024
  • #REDIRECT [[De-correlated Fast Cipher]]
    39 bytes (4 words) - 22:17, 24 July 2009
  • {{r|Block cipher}} {{r|CAST (cipher)}}
    251 bytes (31 words) - 18:32, 13 March 2024
  • | title = CRYPTON: A New 128-bit Block Cipher - Specification and Analysis (Version 1.0) | title = Hardware Design and Performance Estimation of The 128-bit Block Cipher CRYPTON
    1,005 bytes (151 words) - 14:12, 30 September 2009
  • In cryptology: {{r|Serpent (cipher)||}}
    53 bytes (6 words) - 18:32, 30 September 2009
  • {{r|Block cipher}} {{r|Caesar cipher}}
    828 bytes (106 words) - 14:41, 18 March 2024
  • {{r|Block cipher}} {{r|Stream cipher}}
    287 bytes (37 words) - 18:47, 3 January 2009
  • is a [[block cipher]] that was a candidate in the [[AES competition]]; it did not make it into DEAL is a [[Feistel cipher]] using [[Data Encryption Standard|DES]] as the F function. Six rounds were
    1 KB (215 words) - 14:23, 30 September 2009
  • The '''GOST cipher''' was a standard [[block cipher]] in the [[Soviet Union]]. GOST was a Soviet national standards body. There The GOST cipher
    1 KB (228 words) - 05:49, 8 April 2024
  • * The [[Data Encryption Standard]] itself, the first well-known Feistel cipher, using 16 rounds and eight 6 by 4 S-boxes. ...T cipher]], a Soviet standard similar in design to DES, a 32-round Feistel cipher using eight 4 by 4 S-boxes.
    4 KB (551 words) - 12:36, 13 April 2016
  • {{r|Block cipher}} {{r|Cipher}}
    605 bytes (77 words) - 14:41, 18 March 2024
  • One of the first [[cipher]]s, developed by [[Julius Caesar]]
    96 bytes (13 words) - 18:40, 9 August 2008
  • ...n be used to hide information or send secret messages. Below is the Atbash Cipher: Basically, the cipher uses a reverse alphabet, so you subject a letter for its corresponding reve
    717 bytes (145 words) - 23:21, 24 September 2007
  • ...urity Agency]] (KISA) and widely used in Korea. It is a 16-round [[Feistel cipher]] using two 8 by 8 S-boxes.
    435 bytes (67 words) - 05:48, 8 April 2024
  • '''MARS''' is a [[block cipher]] designed by [[IBM]] as a candidate for the [[AES competition]]; it was ch It uses a variant of the [[Feistel cipher | Feistel structure]] which they call a "type 3 Feistel network"; the 128-b
    792 bytes (128 words) - 05:49, 8 April 2024
  • Methods of combining multiple block cipher operations to achieve a larger goal.
    115 bytes (15 words) - 03:31, 23 May 2009
  • Attacking a cipher by writing equations that describe its operation, then solving for the key.
    130 bytes (18 words) - 18:42, 3 January 2009
  • '''LOKI''' is the name of a series of [[block cipher]]s from an Australian group led by [[Jennifer Seberry]]. The original LOKI, later renamed '''LOKI89''', was a [[Feistel cipher]] with 64-bit blocks taking a 64-bit key. It had some weaknesses. LOKI was
    1 KB (192 words) - 05:48, 8 April 2024
  • A [[Caesar cipher]] not used for security, but only to hide [[spoiler]]s in online discussion
    130 bytes (19 words) - 00:25, 7 October 2010
  • A block cipher developed by Michael Jacobson Jr. and Klaus Huber for Deutsche Telekom.
    123 bytes (17 words) - 06:47, 14 June 2010
  • ...peration which, when repeated many times, can be used to build an iterated cipher or hash.
    147 bytes (22 words) - 21:51, 5 June 2009
  • A block cipher which was created in 1998 by NTT and submitted to the AES competition.
    122 bytes (18 words) - 06:42, 1 October 2009
  • {{r|Block cipher}} {{r|CAST (cipher)}}
    451 bytes (59 words) - 11:19, 11 January 2010
  • A block cipher that is a South Korean government standard.
    94 bytes (13 words) - 14:45, 2 December 2013
  • '''E2''' is a [[block cipher]] from [[Nippon Telephone and Telegraph]]. It was candidate in the [[AES co | title = Cryptanalysis of a Reduced Version of the Block Cipher E2
    941 bytes (134 words) - 05:48, 8 April 2024
  • Auto-populated based on [[Special:WhatLinksHere/CAST (cipher)]]. Needs checking by a human. {{r|Block cipher}}
    466 bytes (62 words) - 11:41, 11 January 2010
  • A block cipher efficient in hardware implementations, designed by Chae Hoon Lim of Future
    139 bytes (19 words) - 06:31, 1 October 2009
  • <th>Cipher</th><th>Type</th><th>Block size</th><th>Key size</th><th>Rounds</th><th>S-b <td>[[CAST cipher#CAST-128|CAST-128]]</td><td>Feistel</td><td>64</td><td>40 to 128</td><td>16
    7 KB (1,292 words) - 12:20, 27 July 2010
  • <noinclude>{{Subpages}}</noinclude>A stream cipher that uses a shuffled deck of cards as its main mechanism.
    108 bytes (17 words) - 23:24, 12 May 2011
  • A bock cipher from Schneier and others that was a finalist in the AES competition.
    118 bytes (18 words) - 21:35, 30 September 2009
  • '''Serpent''' is a [[block cipher]] designed by an international team of well-known researchers &mdash; [[Ros Serpent is an [[Block cipher#SP network | SP network]] with 32 rounds. It uses eight 4 by 4 S-boxes, but
    903 bytes (147 words) - 05:49, 8 April 2024
  • Attacking a [[block cipher]] by creating a code book, collecting plaintext/ciphertext pairs.
    128 bytes (16 words) - 00:42, 2 November 2008
  • An attempt to break a cipher by trying all possible keys; long enough keys make this impractical.
    133 bytes (20 words) - 23:54, 4 September 2008
  • '''DFC''' or '''De-correlated Fast Cipher''' | author= Decorrelated Fast Cipher: an AES candidate
    2 KB (309 words) - 05:48, 8 April 2024
  • A block cipher that was IBM's submission to the Advanced Encryption Standard process.
    122 bytes (16 words) - 00:22, 1 October 2009
  • A [[cryptographer]] specializing in [[block cipher]] design and analysis at [[Queens University]] in [[Canada]].
    148 bytes (17 words) - 14:55, 22 May 2011
  • {{r|Block cipher}} {{r|Stream cipher}}
    568 bytes (75 words) - 20:10, 29 July 2010
  • #REDIRECT [[CAST (cipher)#CAST-128]]
    36 bytes (4 words) - 12:49, 23 July 2009
  • Auto-populated based on [[Special:WhatLinksHere/Caesar cipher]]. Needs checking by a human. {{r|Cipher}}
    547 bytes (70 words) - 11:35, 11 January 2010
  • {{r|Cipher}} {{r|Feistel cipher}}
    2 KB (194 words) - 14:48, 4 April 2024
  • A block cipher developed by the Korean Information Security Agency, used broadly throughou
    179 bytes (23 words) - 06:59, 1 October 2009
  • {{r|Caesar cipher}} {{r|Stream cipher}}
    654 bytes (85 words) - 17:13, 11 January 2010
  • ...t blocks and supports key sizes of 128, 192 or 256 bits. It is a [[Feistel cipher]] with six or eight rounds. | title = The MAGENTA Block Cipher Algorithm
    2 KB (235 words) - 05:49, 8 April 2024
  • A symmetric cipher that operates on fixed-size blocks of plaintext, giving a block of cipherte
    141 bytes (20 words) - 10:24, 22 October 2008
  • A [[block cipher]] designed by [[James Massey]] and [[Xuejia Lai]] in 1991, intended as a re
    176 bytes (23 words) - 14:27, 22 May 2011
  • {{r|Block cipher modes of operation}} {{r|Block cipher}}
    657 bytes (85 words) - 17:19, 11 January 2010
  • A block cipher which was a finalist in the Advanced Encryption Standard (AES) contest, des
    179 bytes (26 words) - 05:41, 14 June 2010
  • ...gns are designated as '''RC'''''n''. Officially, "RC" stands for '''Rivest Cipher'''; it may also be taken as '''Ron's Code'''. ...Corporation]] for use in their [[Lotus Notes]] software. It is a [[Feistel cipher]] with 18 rounds and a 64-bit block size. Details are in RFC 2268.
    3 KB (436 words) - 05:49, 8 April 2024
  • Attacking a [[cipher]] by studying the way that small changes in input, such as complementing a
    162 bytes (24 words) - 02:02, 2 November 2008
  • The '''Blowfish''' [[block cipher]] | title=Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish)
    2 KB (377 words) - 05:49, 8 April 2024
  • A US government standard issued in 2002 for a stronger [[block cipher]] to succeed the earlier [[Data Encryption Standard]].
    160 bytes (21 words) - 03:27, 26 October 2008
  • {{r|Block cipher modes of operation}} {{r|Block cipher}}
    618 bytes (78 words) - 17:06, 11 January 2010
  • In describing a [[cipher]], '''plaintext''' is the unencrypted message, contrasted with the encrypte
    214 bytes (26 words) - 05:48, 8 April 2024
  • A block cipher designed by Bruce Schneier and others which was a finalist in the competiti
    172 bytes (25 words) - 22:32, 6 October 2009
  • {{r|Cipher}} {{r|Stream cipher}}
    724 bytes (100 words) - 14:31, 22 March 2024
  • {{r|Cipher}} {{r|Block cipher}}
    1 KB (173 words) - 14:49, 4 April 2024
  • A block cipher developed by the U.S. National Security Agency (NSA); initially classified,
    197 bytes (28 words) - 07:02, 1 October 2009
  • ...ime pad]]; variants of these work for either [[block cipher]]s or [[stream cipher]]s: * [[algebraic attack]] &mdash; write the cipher as a system of equations and solve for the key
    3 KB (440 words) - 05:49, 8 April 2024
  • ...ert, best known for designing the [[CAST (cipher)|CAST]] family of [[block cipher]]s.
    799 bytes (109 words) - 21:26, 8 October 2020
  • ARIA is a [[block cipher]] developed in [[South Korea]], and an official standard (KS X 1213) there. There is a [http://210.104.33.10/ARIA/index-e.html home page] for the cipher. Internet RFC 5794 gives a specification of the algorithm for Internet use
    664 bytes (101 words) - 10:08, 2 December 2013
  • is a [[block cipher]] designed as a candidate for the [[AES competition]]; it did not make it i ...dding]], FROG is a [[Block cipher#Large block ciphers| variable size block cipher]] and a rather unorthodox design. It supports block sizes from 8 to 128 byt
    1 KB (225 words) - 14:53, 30 September 2009
  • A block cipher developed jointly by Mitsubishi and NTT in 2000, which has similar design e
    174 bytes (25 words) - 06:27, 1 October 2009
  • A desirable property for operations in a cipher or hash, where a small change (even a single bit) quickly builds up to crea
    178 bytes (28 words) - 21:58, 5 June 2009
  • {{r|Block cipher}} {{r|Cipher}}
    784 bytes (100 words) - 14:41, 18 March 2024
  • '''Symmetric key cryptography''' uses the same key for both [[cipher#Encryption and decryption=|encryption and decryption]]. Since compromise o ...titutions such as the [[Caesar cipher]], as well as simple [[transposition cipher]]. All used symmetric keying, as, indeed, did every known system until the
    4 KB (546 words) - 05:48, 8 April 2024
  • A block cipher derived from the Data Encryption Standard (DES), from a design proposed in
    160 bytes (24 words) - 06:39, 1 October 2009
  • ...ersy, with many people citing [[Kerckhoffs' Principle]] and arguing that a cipher whose details were classified could not be trusted. Some felt that nothing ...ally, the algorithm was de-classified. Skipjack is an unbalanced [[Feistel cipher]] with 64-bit blocks, an 80-bit key and 32 rounds. Once the algorithm was p
    1 KB (187 words) - 05:48, 8 April 2024
  • A block cipher which was created in 1998 by a group of researchers from École Normale Sup
    202 bytes (32 words) - 06:34, 1 October 2009
  • [[Cryptographer]] and main designer of SAFER [[block cipher]]s, and, with student [[Xuejia Lai]], co-designer of the [[International Da
    197 bytes (24 words) - 14:30, 22 May 2011
  • ...by the US National Institute of Standards and Technology to chose a block cipher to become the Advanced Encryption Standard.
    178 bytes (26 words) - 05:18, 14 June 2010
  • ...wn work was as co-designer with [[Vincent Rijmen]] of the Rijndael [[block cipher]] which won the [[AES competition]] to become the [[Advanced Encryption Sta
    240 bytes (32 words) - 21:52, 23 August 2010
  • A block cipher notable for its simplicity of description and implementation (typically a f
    190 bytes (27 words) - 00:46, 1 October 2009
  • A [[block cipher]] invented by Joan Daemen and Vincent Rijmen, and a forerunner to the [[Rij
    211 bytes (29 words) - 17:13, 22 January 2010
  • *{{r|Solitaire (cipher)}}
    105 bytes (13 words) - 23:11, 12 May 2011
  • ...the encryption and decryption routines are under 10 lines each. No [[Block cipher#S-boxes|S-boxes]] are used, so the data space required is also tiny. ...(computing)|hacking]] [[Microsoft]]'s [[Xbox]] [[game console]], where the cipher was used as a hash function.
    3 KB (367 words) - 05:49, 8 April 2024
  • {{r|Block cipher}} {{r|Cipher}}
    854 bytes (123 words) - 01:07, 2 November 2008
  • A block cipher authored by Georgoudis, Leroux and Chaves, which can work with any block si
    202 bytes (29 words) - 06:45, 1 October 2009
  • ...inear and differential cryptanalysis &mdash; [[Carlisle Adams]] in [[CAST (cipher)|CAST]], [[Serge Vaudenay]] with his [[decorrelation theory]], and [[Lars K ...direct ancestor of [[Rijndael]], the winning AES candidate, was [[Square (cipher)|Square]], designed by [[Joan Daemen]] and [[Vincent Rijmen]]. Knudsen inve
    5 KB (823 words) - 20:23, 19 September 2011
  • '''Rot 13''' is a [[cipher]] that is never used for real security. It simply replaces every letter wit ...a [[Caesar cipher]], a type of cipher once used by Julius Caesar. A Caesar cipher may rotate the alphabet by any amount. Caesar himself used three, so a was
    2 KB (325 words) - 20:53, 17 April 2012
  • Simple substitution cipher for the Hebrew alphabet, involving aleph (the first letter) for tav (the la
    224 bytes (33 words) - 05:15, 16 September 2009
  • A block cipher specification issued by the U.S. government in 1976, intended for sensitive
    261 bytes (36 words) - 06:33, 14 June 2010
  • ...ially [[cryptanalysis|cryptanalyzed]] by the British [[Government Code and Cipher School]], with French, Polish, and U.S. help.
    321 bytes (39 words) - 10:20, 14 June 2010
  • A variable-block-size block cipher designed by Richard Schroeppel, which has its input block size and key leng
    202 bytes (28 words) - 23:59, 30 September 2009
  • ...] who teaches at [[Queens University]] in Canada. His specialty is [[block cipher]] design and analysis; he has published extensively in that area. ...85 }} </ref>. This is a strong version of the requirement for good [[Block cipher#Avalanche|avalanche properties]] in block ciphers; complementing any single
    1 KB (209 words) - 21:41, 26 November 2010
  • * When two output blocks from a [[block cipher]] are identical, the enemy gains some information. Assuming the key has not ...64</sup> hash operations, to find a repeated ciphertext for a 64-bit block cipher or a repetition of a 64-bit challenge, he needs to collect and store about
    3 KB (415 words) - 05:48, 8 April 2024
  • ...known work was as co-designer with [[Joan Daemen]] of the Rijndael [[block cipher]] which won the [[AES competition]] to become the [[Advanced Encryption Sta
    396 bytes (58 words) - 05:49, 8 April 2024
  • ...Standard''', or '''AES''', is a US government specification for a [[block cipher]] to replace the earlier and weaker [[Data Encryption Standard]] (DES). AES ...ute of Standards and Technology]] (NIST) ran a competition to find a block cipher to replace DES. Fifteen candidates were submitted; for descriptions of the
    3 KB (507 words) - 05:48, 8 April 2024
  • ...not protect against a thief who knows the combination. Even an excellent [[cipher]] cannot protect against an enemy who knows the [[Key (cryptography) | key] ...not.''' Enemies can sometimes read encrypted messages without breaking the cipher; they use [[Cryptanalysis#Practical_cryptanalysis | practical cryptanalysis
    3 KB (459 words) - 05:49, 8 April 2024
  • ...hy|secret key]] (symmetric) techniques such as [[block cipher]]s, [[stream cipher]]s and [[cryptographic hash]]es. Because asymmetric techniques are typicall ...de authentication and to securely transport the symmetric keys for a block cipher.
    3 KB (544 words) - 05:49, 8 April 2024
  • ...ond to which plaintexts. There is also a variant usable against a [[stream cipher]]; the attacker attempts to build a listing of the entire output stream, un ...orrespond to which plaintexts. If he can fill in all 256 entries, then the cipher is broken; he can read everything ever sent with that key. Such tiny block
    6 KB (1,064 words) - 02:04, 24 January 2017
  • A cipher system in which the cryptographic key, i.e. the secret used to encrypt and
    262 bytes (45 words) - 03:46, 21 August 2008
  • An '''algebraic attack''' is a method of [[cryptanalysis]] against a [[cipher]]. It involves: * expressing the cipher operations as a system of equations
    6 KB (882 words) - 05:49, 8 April 2024
  • ...of telephone conversations. It used a [[block cipher]] called [[Skipjack (cipher)|skipjack]], developed by the [[NSA]].
    1 KB (183 words) - 05:48, 8 April 2024
  • {{r|Stream cipher}}
    187 bytes (21 words) - 14:54, 25 October 2008
  • A cipher that encrypts data by mixing it with the output of a pseudorandom number ge
    266 bytes (44 words) - 05:45, 24 October 2008
  • These pages are all maintained by the cipher designers. They include links to the design papers, to implementations, and There are other RFCs covering [[block cipher modes of operation]] and how these ciphers should be used in protocols such
    4 KB (600 words) - 23:49, 7 June 2012
  • {{r|Government Code and Cipher School}}
    297 bytes (41 words) - 16:47, 30 October 2008
  • ..."Rivest Cipher" or perhaps "Ron's Code". RC4 is a very widely used stream cipher. RC6 was a finalist in the AES contest.
    1 KB (195 words) - 07:35, 18 March 2024
  • {{r|Stream cipher}}
    200 bytes (23 words) - 20:13, 11 September 2009
  • ...d in the design of both the 1970s [[Data Encryption Standard]] and [[MARS (cipher)|MARS]], IBM's entry in the [[AES competition]] at about the turn of the ce
    335 bytes (54 words) - 22:59, 22 October 2010
  • ...he wrong mode for the task at hand may give an insecure system even if the cipher itself is secure. ...r Modes of Operation" <ref>{{cite paper | title = Recommendation for Block Cipher Modes of Operation | publisher = National Institute for Standards & Technol
    8 KB (1,297 words) - 05:48, 8 April 2024
  • {{r|The Cipher}}
    481 bytes (67 words) - 03:12, 17 February 2010
  • {{r|Caesar cipher}}
    116 bytes (12 words) - 10:28, 28 February 2010
  • {{r|Cipher}}
    219 bytes (24 words) - 14:41, 18 March 2024
  • {{r|Square (cipher)|In cryptology}}
    384 bytes (49 words) - 16:43, 22 January 2010
  • ...Secure and Fast Encryption Routine''', is the name for a series of [[block cipher]]s designed by [[James Massey]] and co-workers for [[Cylink]] Corporation. ...ly stands for 'Stop Knudsen', a wise precaution in the design of any block cipher".
    1 KB (221 words) - 05:48, 8 April 2024
  • {{r|block cipher}}
    160 bytes (18 words) - 02:26, 31 March 2009
  • {{r|Cipher}}
    167 bytes (18 words) - 14:21, 8 March 2024
  • ...]]. It later became part of the [[Second World War]] [[Government Code and Cipher School]] in [[Bletchley Park]], which, in turn, became the [[Government Com
    531 bytes (78 words) - 21:47, 12 July 2008
  • ...ard [[block cipher]]. Block size is 64 bits, key size 128 bits. No [[Block cipher#S-boxes|S-boxes]] are used. The design was the PhD thesis of [[Xuejia Lai]] ...modified so that the "x*0 yields zero for all x" case does not weaken the cipher.
    4 KB (558 words) - 05:49, 8 April 2024
  • In [[encryption]] using a [[cipher]]-based cryptosystem, '''ciphertext''' is the result of applying the algori
    411 bytes (57 words) - 18:12, 28 July 2008
  • {{r|Caesar cipher}}
    573 bytes (81 words) - 15:13, 23 August 2009
  • {{r|block cipher}}
    288 bytes (45 words) - 14:56, 22 May 2011
  • {{r|Government Code and Cipher School}}
    715 bytes (96 words) - 02:45, 25 November 2010
  • {{r|Block cipher}}
    482 bytes (61 words) - 17:51, 11 January 2010
  • {{r|Skipjack (cipher)}}
    219 bytes (28 words) - 15:35, 30 September 2009
  • ...the middle attack''' is a technique of [[cryptanalysis]] against a [[block cipher]]. It is a [[passive attack]]; it may allow the attacker to read messages w ...middle) in two ''independent'' ways, starting either from the input of the cipher ([[plaintext]]) or from the output ([[ciphertext]]). The attacker calculate
    6 KB (921 words) - 05:48, 8 April 2024
  • {{r|Cipher}}
    608 bytes (82 words) - 21:28, 11 January 2010
  • {{r|Block cipher}}
    763 bytes (99 words) - 02:28, 1 April 2024
  • There are several theses that contributed important ideas to block cipher design: ...etwork Cryptosystems'', Queen's University (1990), introducing the [[CAST (cipher)|CAST ciphers]]
    2 KB (315 words) - 09:05, 27 September 2009
  • {{r|Stream cipher}}
    712 bytes (96 words) - 14:31, 22 March 2024
  • {{r|Cipher}}
    830 bytes (103 words) - 14:41, 18 March 2024
  • # the user encrypts C with a [[block cipher]], using the hash of his password as key, to generate the response R There are many variations. The example uses a block cipher, but it can also be done with [[public key]] techniques &mdash; the user en
    2 KB (382 words) - 05:49, 8 April 2024
  • ...ot for signatures), and [[Digital Signature Algorithm]]. Supported [[block cipher]]s are [[IDEA]], [[Triple DES]], [[CAST-128]], [[AES]] and [[Twofish]].
    910 bytes (125 words) - 05:49, 8 April 2024
  • '''CAST''' is a general procedure for constructing a family of [[block cipher]]s; individual ciphers have names like [[#CAST-128|CAST-128]] and [[#CAST-2 CAST ciphers are [[Feistel cipher]]s using large S-boxes, 8*32 rather than the 6*4 of DES. They are primarily
    9 KB (1,452 words) - 05:49, 8 April 2024
  • ...[[Data Encryption Standard]], or DES, is in some ways an excellent [[block cipher]]; it has withstood decades of analysis with no catastrophic flaws found. H The most widely used method of deriving a stronger cipher from DES is '''Triple DES''' or '''3DES'''; apply DES three times with diff
    4 KB (685 words) - 05:48, 8 April 2024
  • ...ute force''' or '''exhaustive search''' attack is an attempt to break a [[cipher]] by trying all possible [[Key|keys]] in a systematic manner. Finding a key ...so, the system may be weak in various ways that have little to do with the cipher itself &mdash; easily guessed passwords, poorly chosen keys, poorly designe
    11 KB (1,819 words) - 05:48, 8 April 2024
  • ...hy]], primarily [[block cipher]] design. It was introduced in the [[SAFER (cipher)|SAFER]] ciphers and has been used in others such as [[Twofish]]. Its main
    2 KB (395 words) - 05:48, 8 April 2024
  • ...rther down the alphabet. It was named after [[Julius Caesar]] who used the cipher with a shift of 3 in order to communicate with his generals during his vari ...er) are enciphered using a different key. In the polyalphabetic [[Vigenère cipher]], for instance, encryption uses a ''key word'', which controls letter enci
    9 KB (1,312 words) - 05:49, 8 April 2024
  • ...in [[cryptography]], in the construction of [[stream cipher]]s or [[block cipher]]s. Bent functions are a specific case of [[plateaued function]]s.
    3 KB (435 words) - 23:36, 14 February 2010
  • ...can be [[cryptography#two-way encryption|encrypted]] in two basic ways, '''cipher''' and [[code]]. For a discussion of the applications of each, see the [[Cr ...re of linguistic structure such as words. It would make no difference to a cipher if its inputs were the complete works of [[William Shakespeare]], a digitiz
    12 KB (1,744 words) - 05:48, 8 April 2024
  • ...ock cipher]] to replace the [[Data Encryption Standard]], DES. The winning cipher, previously known as [[Rijndael]] became the [[Advanced Encryption Standard The final requirements specified a block cipher with 128-bit [[Block_cipher#Block_size | block size]] and support for 128,
    21 KB (3,252 words) - 05:49, 8 April 2024
  • A '''one-time pad''' is a [[cipher]] system in which the [[cryptographic key]], i.e. the secret used to encryp The name is derived from the physical implementation of the first cipher to use this approach. which used pads containing pages of printed [[random
    12 KB (1,878 words) - 05:48, 8 April 2024
  • ...ign. A real attacker will very likely have both, so demonstrating that the cipher is secure against attackers with neither proves almost nothing. The main re ...it is a stream cipher based on a random number generator. Secure [[stream cipher]]s and secure [[random number]] generators certainly exist (see the links f
    6 KB (921 words) - 05:48, 8 April 2024
  • ...r]], was deeply involved in mechanised attacks on the [[Enigma machine]] [[cipher]]s and was primarily responsible for breaking the four-rotor U-boat enigma. ...Gregory J.|coauthors=Philip Hawkes|date=2003|chapter=Turing: A Fast Stream Cipher|url=http://download.springer.com/static/pdf/386/chp%253A10.1007%252F978-3-5
    5 KB (782 words) - 05:57, 8 April 2024
  • ...ritish [[signals intelligence]] organization, then the Government Code and Cipher School (now the [[Government Communications Headquarters]] (GCHQ)), which r
    2 KB (225 words) - 14:20, 22 March 2024
  • {{r|SAFER (cipher)}}
    2 KB (223 words) - 13:46, 10 March 2024
  • The COMINT organization was called the Government Code and Cipher School (GCCS), which reported to the [[Secret Intelligence Service]]. Event ...ch moved with every character encrypted to give a complex [[polyalphabetic cipher]]. Some versions had an additional complication, a plugboard similar to an
    5 KB (854 words) - 05:49, 8 April 2024
  • For purposes of analysing [[cipher]]s, Kerckhoffs' Principle neatly divides any design into two components. Th {{quote|That the security of a cipher system should depend on the key and not the algorithm has become a truism i
    7 KB (1,186 words) - 14:20, 8 March 2024
  • For purposes of analysing [[cipher]]s, Kerckhoffs' Principle neatly divides any design into two components. Th {{quote|That the security of a cipher system should depend on the key and not the algorithm has become a truism i
    8 KB (1,338 words) - 05:49, 8 April 2024
  • Many applications use both a [[block cipher]] for secrecy and an HMAC for data authentication. Such a system must make
    2 KB (313 words) - 05:49, 8 April 2024
  • ...with artists and their relationship with their art: her first novel, ''The Cipher'', was about a [[poet]]; ''Bad Brains'' was about a [[painter]]; ''Skin'' w
    2 KB (274 words) - 03:14, 6 October 2009
  • In [[cryptography]], a '''stream cipher''' is a symmetric [[cipher]] which encrypts data by combining the plaintext with pseudorandom data to ...&mdash; to infer the internal state of the generator; that would break the cipher completely.
    24 KB (3,851 words) - 05:49, 8 April 2024
  • ...one value but that does not give him the key, or even help him attack the cipher. However, a law enforcement or national security agency can obtain a warran
    2 KB (334 words) - 05:49, 8 April 2024
  • ...osystem to provide [[digital signature]]s and to manage keys for a [[block cipher]] which does the actual message encryption. ...ginal PGP version 1.0 in 1990; it used a block cipher called [[BassOmatic (cipher)|BassOmatic]], devised by Zimmerman. This was quickly shown to be weak, and
    7 KB (1,143 words) - 05:49, 8 April 2024
  • ...''DES''', is among the the best known and most thoroughly analyzed [[block cipher]]s. It was invented by [[IBM]], and was made a US government standard for n DES operates on 64-bit blocks and takes a 56-bit key. It is a [[Feistel cipher]] with 16 rounds and a 48-bit round key for each round, To generate the rou
    16 KB (2,456 words) - 05:48, 8 April 2024
  • ...scendant of the [[Second World War]] organization, the Government Code and Cipher School, which was responsible for the [[ULTRA]] cryptanalysis of the [[Enig
    3 KB (353 words) - 05:48, 8 April 2024
  • ...red secret as a [[cryptographic key]] for a [[block cipher]] or a [[stream cipher]], or as the basis for a further key exchange.
    6 KB (954 words) - 05:48, 8 April 2024
  • ...he hash against a birthday attack then roughly matches the strength of the cipher against a [[brute force attack]]. ...a few rounds later. See the [[Block_cipher#Iterated_block_ciphers | block cipher]] article for a discussion of these concepts.
    16 KB (2,641 words) - 15:51, 8 April 2024
  • There are things like [[rewrite attack]] or [[Feistel cipher]] that should likely be added, but since they are only redirects, I'm not s
    3 KB (428 words) - 14:37, 18 March 2024
  • ...iving a block of [[ciphertext]] for each. The other main type are [[stream cipher]]s, which generate a continuous stream of keying material to be mixed with ...ial components in many security systems. However, just having a good block cipher does not give you security, much as just having good tires does not give yo
    53 KB (8,371 words) - 05:48, 8 April 2024
  • ...fluences the behavior of a [[cryptography | cryptographic algorithm]]. A [[cipher]] uses an encryption key for encryption and a decryption key for decryption
    3 KB (523 words) - 05:49, 8 April 2024
  • {{r|Cipher}}
    3 KB (417 words) - 07:29, 24 April 2024
  • ...work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random numbers|random] ...dependent on the key size, as compared to the effort needed to ''use'' the cipher. In such cases, effective security can still be achieved if some conditions
    32 KB (4,913 words) - 14:38, 18 March 2024
  • ...work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random numbers|random] ...dependent on the key size, as compared to the effort needed to ''use'' the cipher. In such cases, effective security can still be achieved if some conditions
    32 KB (4,916 words) - 05:49, 8 April 2024
  • ...sh that is based on a block cipher, but it would be unusual to use a block cipher directly. ...such devices use a [[cryptographic hash]] to mix the data, and some use a cipher for output processing as well &mdash; the Yarrow
    23 KB (3,650 words) - 05:49, 8 April 2024
  • * Harvey G. Cragon, "From Fish to Colossus: How the German Lorenz Cipher was Broken at Bletchley Park", Cragon, Dallas, 2003 - A detailed descriptio ...wski, "An Application of the Theory of Permutations in Breaking the Enigma Cipher," Applicationes mathematicae, 16(4), 1980 ([http://cryptocellar.web.cern.ch
    8 KB (1,107 words) - 20:30, 10 February 2010
  • Byte[] bytHash; // byte array for cipher string
    4 KB (586 words) - 15:45, 8 April 2024
  • *{{pl|Block cipher}} '''Re-approval''' *{{pl|Block cipher}} '''Re-approval'''
    9 KB (1,159 words) - 17:35, 14 March 2024
  • ...ars but no charges were filed<ref name="zim">[http://www.ieee-security.org/Cipher/Newsbriefs/1996/960214.zimmerman.html "Case Closed on Zimmermann PGP Invest ...d States, is influence of the [[National Security Agency]] in high quality cipher development and policy. NSA, or any of the similar agencies in other countr
    20 KB (2,946 words) - 05:49, 8 April 2024
  • ...times. There is also an algorithm called [[Bcrypt]], based on [[Blowfish (cipher)|Blowfish]] and used in [[OpenBSD]], where the number of iterations is cont
    12 KB (1,937 words) - 15:51, 8 April 2024
  • ...reinvented by Bazeries in the First World War, and, changed from a set of cipher wheels on an axle (e.g., U.S. M-94), to a sliding strip system, only began ...], had French intercept personnel not captured the message in the [[ADFGVX cipher]], there would have been nothing to cryptanalyze.
    16 KB (2,460 words) - 06:04, 8 April 2024
  • Morse originally devised a cipher code similar to that used in existing semaphore telegraphs, by which words
    5 KB (751 words) - 13:19, 2 March 2010
  • ...cryptography]] is in use (often ''both'' an authentication mechanism and a cipher), and send off his bogus message; he also has to block delivery of the genu
    6 KB (903 words) - 05:49, 8 April 2024
  • ...rge organisations can too: Deutsche Telekom's [[MAGENTA (cipher)|Magenta]] cipher was broken<ref>{{citation ...not mean their designs are necessarily safe. Blaze and Schneier designed a cipher called MacGuffin<ref>{{citation
    52 KB (8,332 words) - 05:49, 8 April 2024
  • ...metaphorical. We talk about a genetic code, where code originally meant a cipher; we talk about the solar system model of the atom as though the atom were l
    6 KB (1,033 words) - 17:25, 6 February 2010
  • *[[Atbash Cipher/Definition]] *[[Block cipher modes of operation/Definition]]
    15 KB (1,521 words) - 09:02, 2 March 2024
  • ...] with names of the form RC''n'' including [[RC4]], a widely used [[stream cipher]].
    7 KB (1,171 words) - 05:48, 8 April 2024
  • ...oad (ESP). ESP encryption this is done using a [[block cipher]] in [[Block cipher modes of operation | CBC mode]]. In the most used setup, keys are automatic The encryption in the ESP encapsulation protocol is done with a [[block cipher]]. The only required ciphers in the original RFCs were null encryption and
    40 KB (6,219 words) - 05:49, 8 April 2024
  • ...ptography export laws of the time (mid-90s). For why a short key makes any cipher inherently weak see [[Brute_force#Choosing_key_sizes|brute force attack]]. ...r workings were trade secrets. This violates [[Kerckhoffs'_Principle]]; no cipher should be trusted until it is published and reviewed. See [[Cryptography#Cr
    47 KB (7,475 words) - 05:49, 8 April 2024
  • ...fore inserting it in the image then &mdash; since the output of any good [[cipher]] is apparently random &mdash; it generally becomes very difficult for any
    11 KB (1,766 words) - 09:26, 31 October 2015
  • ...s essential to modern [[cryptography]]&mdash;in particular to [[public key cipher]]s that are crucial to Internet commerce, wireless networks, and military a
    14 KB (2,281 words) - 12:20, 13 September 2013
  • For one thing, something much like it has come up before; see [[Talk:Cipher]]. In one case there I changed an external citation to a wikilink and wrote ...ce, Knuth) because I thought it belonged in [[Random number]] but not in [[Cipher]]. This now seems to me a debatable decision; perhaps seminal works like Kn
    66 KB (10,879 words) - 17:02, 5 March 2024
  • ...ef> It suggested 75 bits was the ''minimum'' key size to allow an existing cipher to be considered secure and kept in service. At the time, the Data Encrypti ...was the US government publication of the Data Encryption Standard, a block cipher which became very widely used. The other was the publication by Whitfield D
    35 KB (5,430 words) - 07:27, 18 March 2024
  • ...e then, new codes have been used to encrypt DVDs such as the [[Cryptomeria cipher]].
    28 KB (4,091 words) - 11:48, 2 February 2023
  • *Encoding several letters with same symbol (polyphonic cipher, telephone keypad)
    11 KB (1,491 words) - 10:28, 8 November 2009
  • ...essential to modern [[cryptography]] &mdash; in particular to [[public key cipher]]s that are crucial to Internet commerce, wireless networks, and military a
    18 KB (2,917 words) - 10:27, 30 August 2014
  • * cypher (acceptable variant of [[cipher]])
    27 KB (3,338 words) - 15:33, 8 March 2023
  • ...vision or impoverishment.' He warned that Delaware 'would become at once a cipher in the union' if the principle of equal representation embodied in the New
    23 KB (3,054 words) - 08:54, 2 March 2024
  • ...[[cryptography]]. A simple encryption system, for example, is the [[Caesar cipher]]. Electronic interception appeared as early as 1900, during the Boer War.
    36 KB (5,247 words) - 05:49, 8 April 2024
  • ...clusive. Grant did not open his heart much to acquaintances. He could be a cipher even to those who got close to them. To friend David Niven, Grant was a “
    15 KB (2,409 words) - 15:40, 20 January 2012
  • ...on the scale of IQ. Further documents, including a literally "unbreakable" cipher code (which also cannot be effectively decoded by anyone including the reci
    19 KB (3,185 words) - 00:07, 17 February 2010
  • ...AST-128]] and [[Feistel cipher]] for example, currently point into [[block cipher]]. That eliminates red links in other articles, and if someone wants to wri
    52 KB (8,701 words) - 18:02, 1 April 2024
  • ...f World War II. Then, during 1948, in rapid succession, every one of these cipher systems went dark, as a result of espionage by a Soviet agent, [[William We
    25 KB (3,805 words) - 22:34, 14 June 2009
  • |cipher, zero
    61 KB (9,656 words) - 09:17, 2 March 2024
  • ...f World War II. Then, during 1948, in rapid succession, every one of these cipher systems went dark, as a result of espionage by a Soviet agent, [[William We
    72 KB (10,689 words) - 05:49, 8 April 2024
View (previous 250 | ) (20 | 50 | 100 | 250 | 500)