Search results

Page title matches

• Code book attack
  A '''code book attack''' is a technique for [[cryptanalysis]]. The name comes from the attack on ...h the same key. If the cipher user changes keys at reasonable intervals, a code book attack is impossible.
  6 KB (1,064 words) - 02:04, 24 January 2017
• Code book attack/Definition
  128 bytes (16 words) - 00:42, 2 November 2008
• Code book attack/Related Articles
  287 bytes (37 words) - 18:47, 3 January 2009

Page text matches

• Passive attack/Related Articles
  {{r|code book attack}}
  237 bytes (29 words) - 01:06, 22 March 2009
• Cryptanalysis/Related Articles
  {{r|Code book attack}}
  701 bytes (92 words) - 10:46, 5 January 2009
• Meet-in-the-middle attack/Related Articles
  {{r|Code book attack}}
  854 bytes (123 words) - 01:07, 2 November 2008
• Passive attack
  * [[code book attack]] — collect all possible plaintext/ciphertext pairs for a [[block ci ...h the same key. If the cipher user changes keys at reasonable intervals, a code book attack is impossible.
  3 KB (440 words) - 05:49, 8 April 2024
• Block cipher modes of operation/Related Articles
  {{r|Code book attack}}
  597 bytes (79 words) - 11:25, 11 January 2010
• Code book attack
  A '''code book attack''' is a technique for [[cryptanalysis]]. The name comes from the attack on ...h the same key. If the cipher user changes keys at reasonable intervals, a code book attack is impossible.
  6 KB (1,064 words) - 02:04, 24 January 2017
• Birthday attack
  ...ey has not changed, he then knows the two input blocks were identical. A [[code book attack]] is based on accumulating such information.
  3 KB (415 words) - 05:48, 8 April 2024
• Block cipher modes of operation
  ...enough blocks are encrypted this way, the system becomes vulnerable to a [[code book attack]]. ECB is therefore '''generally not used'''.
  8 KB (1,297 words) - 05:48, 8 April 2024
• Key management
  ...ith a single key. Such a collection facilitates some attacks — see [[code book attack]], [[linear cryptanalysis]] and [[differential cryptanalysis]] in particula
  3 KB (459 words) - 05:49, 8 April 2024
• Algebraic attack
  An algebraic attack is similar to a [[brute force attack]] or a [[code book attack]] in that it can, in theory, break any [[symmetric cipher]] but in practice
  6 KB (882 words) - 05:49, 8 April 2024
• Brute force attack
  Two other attacks — an [[algebraic attack]] and a [[code book attack]] — are similar to brute force in that they can, ''in theory'', break
  11 KB (1,819 words) - 05:48, 8 April 2024
• Cryptanalysis/Citable Version
  * [[code book attack]] — collect all possible plaintext/ciphertext pairs for a [[block ci ...h the same key. If the cipher user changes keys at reasonable intervals, a code book attack is impossible.
  32 KB (4,913 words) - 14:38, 18 March 2024
• Cryptanalysis
  * [[code book attack]] — collect all possible plaintext/ciphertext pairs for a [[block ci ...h the same key. If the cipher user changes keys at reasonable intervals, a code book attack is impossible.
  32 KB (4,916 words) - 05:49, 8 April 2024
• Stream cipher
  ...be very long. Without this, a variant of [[Code_book_attack#Stream_ciphers|code book attack]] can break the cipher; an enemy with enough known plaintext can collect th
  24 KB (3,851 words) - 05:49, 8 April 2024
• Block cipher
  * make the '''block size large enough''' that an enemy cannot create a [[code book attack | code book]], collecting so many known plaintext/ciphertext pairs that the ...ntations simpler. However, it must also be large enough to guard against [[code book attack]]s.
  53 KB (8,371 words) - 05:48, 8 April 2024