Search results
Jump to navigation
Jump to search
- Like a [[brute force attack]] (try all possible keys) or an [[algebraic attack]] (write the cipher as a6 KB (1,064 words) - 02:04, 24 January 2017
- ...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
- :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
- {{Notice|Brute force attack|AA}}3 KB (415 words) - 10:32, 30 July 2023
- An algebraic attack is similar to a [[brute force attack]] or a [[code book attack]] in that it can, in theory, break any [[symmetri6 KB (882 words) - 05:49, 8 April 2024
- ...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 t16 KB (2,456 words) - 05:48, 8 April 2024
- ...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 faste12 KB (1,744 words) - 05:48, 8 April 2024
- ...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]] — try all possible keys32 KB (4,913 words) - 14:38, 18 March 2024
- ...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]] — try all possible keys32 KB (4,916 words) - 05:49, 8 April 2024
- #[[Brute force attack/Citable Version]]9 KB (1,161 words) - 03:09, 8 March 2024
- <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 t41 KB (6,813 words) - 14:57, 20 March 2024
- ...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 keys53 KB (8,371 words) - 05:48, 8 April 2024
- ...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
- ...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 w19 KB (3,052 words) - 14:38, 18 March 2024
- ...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
- {{rpr|Brute force attack}} (August 13)10 KB (1,530 words) - 05:06, 8 March 2024
- {{rpr|Brute force attack}} (August 13)16 KB (1,744 words) - 09:45, 26 April 2024
- ...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<sup>55</sup> decryptions, tr51 KB (7,594 words) - 02:25, 1 April 2024
- ...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<sup>55</sup> decryptions, tr52 KB (7,723 words) - 02:25, 1 April 2024
- ...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 Augus69 KB (10,750 words) - 09:02, 4 May 2024