Brute force attack/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Sandy Harris |
imported>Howard C. Berkowitz No edit summary |
||
| Line 4: | Line 4: | ||
==Parent topics== | ==Parent topics== | ||
{{r|Computability theory}} | |||
{{r|Computational complexity theory}} | |||
{{r|Complexity of algorithms}} | |||
{{r|Cryptanalysis}} | {{r|Cryptanalysis}} | ||
{{r| | {{r|Passive attack}} | ||
==Subtopics== | ==Subtopics== | ||
{{r|Plaintext recognition}} | |||
==Other related topics== | ==Other related topics== | ||
{{r|Parallel computation}} | |||
Revision as of 08:03, 2 April 2009
- See also changes related to Brute force attack, or pages that link to Brute force attack or to this page or whose text contains "Brute force attack".
Parent topics
- Computability theory [r]: Add brief definition or description
- Computational complexity theory [r]: Add brief definition or description
- Complexity of algorithms [r]: How fast the execution time (or memory usage) increases as the data set to be processed grows. [e]
- Cryptanalysis [r]: The sub-field of cryptology which deals with breaking into existing codes and ciphers. [e]
- Passive attack [r]: An attack on a communications system in which the attacker reads messages he is not supposed to but does not alter them. [e]