Search results

Page title matches

• Brute force attack
  In the simplest brute force attack, the attacker has some [[Cryptanalysis#Known_plaintext | known plaintext]] ...2^n-1 encryptions, to find the key. A large enough key makes any brute force attack wildly impractical.
  11 KB (1,819 words) - 05:48, 8 April 2024
• Talk:Brute force attack
  <s>[[EFF]]'s DES Cracker was a machine designed and built for a fast brute force attack on the [[Data Encryption Standard]]. The book on it, '''Cracking DES - Secr ...lems of brute force. It may or may not be a good example to suggest that a brute force attack against 1000 characters could produce plaintexts of every possible string t
  41 KB (6,813 words) - 14:57, 20 March 2024
• Brute Force attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:08, 24 October 2008
• Brute Force Attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:09, 24 October 2008
• Brute force Attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:09, 24 October 2008
• Brute force attack/Approval
  941 bytes (92 words) - 11:27, 19 February 2021
• Talk:Brute force attack/Draft
  #REDIRECT [[Talk:Brute force attack]]
  37 bytes (5 words) - 11:25, 19 February 2021
• Template:Brute force attack/Metadata
  | pagename = Brute force attack | abc = Brute force attack
  966 bytes (102 words) - 13:30, 1 October 2020
• Brute force attack/Definition
  133 bytes (20 words) - 23:54, 4 September 2008
• Brute force attack/Bibliography
  1 KB (163 words) - 22:27, 26 March 2009
• Brute force attack/External Links
  428 bytes (62 words) - 22:30, 26 March 2009
• Talk:Brute force attack/Related Articles
  190 bytes (34 words) - 09:32, 2 April 2009
• Brute force attack/Related Articles
  266 bytes (29 words) - 09:03, 2 April 2009

Page text matches

• Brute Force Attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:09, 24 October 2008
• Brute force Attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:09, 24 October 2008
• Brute force
  #REDIRECT [[Brute force attack]]
  32 bytes (4 words) - 12:59, 8 August 2008
• Brute Force attack
  #Redirect [[Brute force attack]]
  32 bytes (4 words) - 15:08, 24 October 2008
• Talk:Brute force attack/Draft
  #REDIRECT [[Talk:Brute force attack]]
  37 bytes (5 words) - 11:25, 19 February 2021
• Passive attack/Related Articles
  {{r|brute force attack}}
  237 bytes (29 words) - 01:06, 22 March 2009
• Template:Brute force attack/Metadata
  | pagename = Brute force attack | abc = Brute force attack
  966 bytes (102 words) - 13:30, 1 October 2020
• Cryptanalysis/Related Articles
  {{r|Brute force attack}}
  701 bytes (92 words) - 10:46, 5 January 2009
• Triple DES
  4 KB (685 words) - 05:48, 8 April 2024
• Passive attack
  * [[brute force attack]] &mdash; try all possible keys
  3 KB (440 words) - 05:49, 8 April 2024
• Advanced Encryption Standard/Related Articles
  {{r|Brute force attack}}
  784 bytes (100 words) - 14:41, 18 March 2024
• User:Sandy Harris/Articles
  {{rpl|Brute force attack}}
  2 KB (243 words) - 17:48, 13 March 2024
• Blowfish (cipher)/Related Articles
  {{r|Brute force attack}}
  525 bytes (69 words) - 10:50, 1 March 2010
• Parallel computation/Related Articles
  {{r|Brute force attack}}
  603 bytes (75 words) - 19:22, 11 January 2010
• Computational complexity theory/Related Articles
  {{r|Brute force attack}}
  774 bytes (99 words) - 15:36, 11 January 2010
• One-time pad/Related Articles
  {{r|Brute force attack}}
  724 bytes (100 words) - 14:31, 22 March 2024
• Brute force attack
  In the simplest brute force attack, the attacker has some [[Cryptanalysis#Known_plaintext | known plaintext]] ...2^n-1 encryptions, to find the key. A large enough key makes any brute force attack wildly impractical.
  11 KB (1,819 words) - 05:48, 8 April 2024
• Data Encryption Standard/Related Articles
  {{r|Brute force attack}}
  973 bytes (125 words) - 14:41, 18 March 2024
• Meet-in-the-middle attack
  ...t be tried is approximately the square root of the number required for a [[brute force attack]]. For example, against a 128-bit key brute force takes 2¹²⁷ ste ...g two 56-bit DES keys. You do indeed obtain that if the attacker tries a [[brute force attack]] searching all possible combinations of keys. However, attackers cannot be
  6 KB (921 words) - 05:48, 8 April 2024
• Birthday attack
  ...rge as the key size of the [[cipher]]s they are intended for use with. A [[brute force attack]] on a [[block cipher]] with a 128-bit key, for example, needs on average 2
  3 KB (415 words) - 05:48, 8 April 2024
• Code book attack
  Like a [[brute force attack]] (try all possible keys) or an [[algebraic attack]] (write the cipher as a
  6 KB (1,064 words) - 02:04, 24 January 2017
• GOST cipher
  ...o uses a 256-bit key which makes it, unlike DES, thoroughly resistant to [[brute force attack]]s.
  1 KB (228 words) - 05:49, 8 April 2024
• Talk:Block cipher/Draft
  :Add to "In theory, any '''block''' cipher can be broken by a brute force attack"...so the statement doesn't conflict with one-time pads. Yes, it's time to ..."In theory, any cipher '''except a [[one-time pad]]''' can be broken by a brute force attack", since stream ciphers are also vulnerable.
  6 KB (924 words) - 15:28, 2 October 2013
• CZ:Approval Announcements/2009
  {{Notice|Brute force attack|AA}}
  3 KB (415 words) - 10:32, 30 July 2023
• 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 [[symmetri
  6 KB (882 words) - 05:49, 8 April 2024
• Data Encryption Standard
  ...is now considered obsolete; its small key size makes it vulnerable to a [[brute force attack]] DES uses a 56-bit key. That is simply too small to resist a [[brute force attack]], an exhaustive search in which the enemy just tries keys until he finds t
  16 KB (2,456 words) - 05:48, 8 April 2024
• Cipher
  ...ciple combines two objectives. The key needs to be long enough to make a [[brute force attack]] impractical and the cipher internals robust enough that ''no attack faste
  12 KB (1,744 words) - 05:48, 8 April 2024
• Cryptanalysis/Citable Version
  ...except a one-time pad can be broken with enough computational effort (by [[brute force attack]] if nothing else), but the amount of effort needed to break a cipher may b * [[brute force attack]] &mdash; try all possible keys
  32 KB (4,913 words) - 14:38, 18 March 2024
• Cryptanalysis
  ...except a one-time pad can be broken with enough computational effort (by [[brute force attack]] if nothing else), but the amount of effort needed to break a cipher may b * [[brute force attack]] &mdash; try all possible keys
  32 KB (4,916 words) - 05:49, 8 April 2024
• CZ:Sign-up page for Council members to review Citable Articles
  #[[Brute force attack/Citable Version]]
  9 KB (1,161 words) - 03:09, 8 March 2024
• Talk:Brute force attack
  <s>[[EFF]]'s DES Cracker was a machine designed and built for a fast brute force attack on the [[Data Encryption Standard]]. The book on it, '''Cracking DES - Secr ...lems of brute force. It may or may not be a good example to suggest that a brute force attack against 1000 characters could produce plaintexts of every possible string t
  41 KB (6,813 words) - 14:57, 20 March 2024
• Block cipher
  ...ld be large enough and sufficiently random that searching for the key (a [[brute force attack]]) is effectively impossible, and in any application which encrypts large v * make the '''key size large enough''' that he cannot use a [[brute force attack]], trying all possible keys
  53 KB (8,371 words) - 05:48, 8 April 2024
• Hash (cryptography)
  ...irthday attack then roughly matches the strength of the cipher against a [[brute force attack]].
  16 KB (2,641 words) - 15:51, 8 April 2024
• User talk:Pat Palmer/Archive 3
  ...ew minutes to put on your Computers Editor hat and review the article on [[brute force attack]]s? Howard has nominated it for approval but I think it would be best if w
  19 KB (3,052 words) - 14:38, 18 March 2024
• AES competition
  ...its 56-bit [[Block_cipher#Key size | key size]] was inadequate to resist [[brute force attack]]s, given modern technology.
  21 KB (3,252 words) - 05:49, 8 April 2024
• Archive:Article of the Week
  {{rpr|Brute force attack}} (August 13)
  10 KB (1,530 words) - 05:06, 8 March 2024
• CZ:Featured article
  {{rpr|Brute force attack}} (August 13)
  16 KB (1,744 words) - 09:45, 26 April 2024
• User:Pat Palmer/sandbox/test10
  ...except a one-time pad can be broken with enough computational effort (by [[brute force attack]] if nothing else), but the amount of effort needed to break a cipher may b ...any attack that could be against a perfect cipher. For example, a simple brute force attack against DES requires one known plaintext and 2⁵⁵ decryptions, tr
  51 KB (7,594 words) - 02:25, 1 April 2024
• User:Pat Palmer/sandbox/todo list/Cryptography
  ...except a one-time pad can be broken with enough computational effort (by [[brute force attack]] if nothing else), but the amount of effort needed to break a cipher may b ...any attack that could be against a perfect cipher. For example, a simple brute force attack against DES requires one known plaintext and 2⁵⁵ decryptions, tr
  52 KB (7,723 words) - 02:25, 1 April 2024
• Talk:Cryptography/Archive 1
  ...or most of the articles they point to. Examples so far [[One-time pad]], [[Brute force attack]], [[random number]], ... [[User:Sandy Harris|Sandy Harris]] 12:20, 4 Augus
  69 KB (10,750 words) - 09:02, 4 May 2024
• Cryptography
  ...velopments. For instance, the effects of [[Moore's Law]] on the speed of [[brute force attack]]s must be taken into account when specifying [[cryptographic key#key lengt Hardware can also be used to facilitate attacks on ciphers. [[Brute force attack]]s on [[cipher]]s work very well on parallel hardware; in effect you can ma
  52 KB (8,332 words) - 05:49, 8 April 2024
• User talk:Joe Quick/Archive 5
  == brute force attack article approval ==
  44 KB (7,375 words) - 02:59, 21 March 2024
• User talk:Sandy Harris
  *Yes, I still support the approval nomination of [[Brute force attack]] and have said so on the article's Talk page.
  54 KB (8,743 words) - 14:38, 18 March 2024
• User talk:Howard C. Berkowitz/Archive 2
  ...block cipher]]. Smaller ones include [[passive attack]] and its children [[Brute force attack]], [[Algebraic attack]] and [[Code book attack]] plus [[active attack]], [[ == [[Brute force attack]] ==
  64 KB (10,458 words) - 18:02, 1 April 2024
• Talk:Snake oil (cryptography)
  ...be a bottom-up writer; I've been creating things like [[one-time pad]], [[brute force attack]] and [[meet-in-the-middle attack]]; perhaps that can complement Howard's m
  53 KB (8,698 words) - 15:00, 20 March 2024
• User:Howard C. Berkowitz/Editor
  *[[Brute force attack]]
  35 KB (4,991 words) - 09:02, 4 May 2024
• User talk:Milton Beychok/Archive 6
  Thank you for becoming an approving editor on [[brute force attack]]. There's been discussion and some change to the article since it was prop
  27 KB (4,375 words) - 05:06, 8 March 2024
• DVD
  ...1999. One source suggests the 1996 encoding scheme was susceptible to a [[brute force attack]] because export regulations of the [[United States of America]] discourage
  28 KB (4,066 words) - 11:55, 8 May 2024
• Digital rights management
  ...key makes any cipher inherently weak see [[Brute_force#Choosing_key_sizes|brute force attack]]. For discussion of debate about those laws see [[politics of cryptography
  47 KB (7,475 words) - 05:49, 8 April 2024
• User talk:J. Noel Chiappa
  Hi, Noel. Do you have a few minutes to look at the article on [[brute force attack]]s? Howard has nominated it for approval but he did make some minor contri
  37 KB (6,085 words) - 05:43, 6 March 2024
• User talk:Howard C. Berkowitz/Archive 1
  ...ngs &mdash; [[Man-in-the-middle attack]], [[Meet-in-the-middle attack]], [[Brute force attack]], [[Diffie-Hellman]], [[Discrete logarithm]] &mdash; are complete enough f
  119 KB (20,018 words) - 18:02, 1 April 2024