Brute-force: Difference between revisions

From Computer Science Wiki
No edit summary
 
(5 intermediate revisions by the same user not shown)
Line 7: Line 7:
[[file:Studying.png|right|frame|Case study notes<ref>http://www.flaticon.com/</ref>]]
[[file:Studying.png|right|frame|Case study notes<ref>http://www.flaticon.com/</ref>]]


== Introduction ==
== An Introduction to Brute Force==


* Brute force is a method by which malicious attackers try many passwords and passphrase's to correctly guess a victim's credentials. The malicious attacker's programs an algorithm that systematically checks all passwords until the correct one is identified.  
* Brute force is a method by which malicious attackers try many passwords and passphrase's to correctly guess a victim's credentials. The malicious attacker's programs an algorithm that systematically checks all passwords until the correct one is identified.  
Line 15: Line 15:
* Brute force can be very efficient for smaller passwords but VERY inefficient for big passwords. For bigger passwords, dictionary attack's would be more relevant
* Brute force can be very efficient for smaller passwords but VERY inefficient for big passwords. For bigger passwords, dictionary attack's would be more relevant


<nowiki>
 
  <ref> https://en.wikipedia.org/wiki/Brute-force_attack </ref>
  <ref> https://en.wikipedia.org/wiki/Brute-force_attack </ref>
</nowiki>


== How does it work or a deeper look ==
== How does it work practically ==
 
* Let’s say that you have a number lock with you. But you forgot the number. What are your options to get it open ?


* If you are discussing a THING YOU CAN TOUCH, you must explain how it works, and the parts it is made of. Google around for an "exploded technical diagram" of your thing, [http://cdiok.com/wp-content/uploads/2012/01/MRI-Technology.jpg maybe like this example of an MRI]  It is likely you will reference outside links. Please attribute your work.
You could try and remember the key, but what if you can’t. Then your probable option is to try each and every combination until the lock finally opens. And that’s basically what brute force is all about. Test each and every possibility until you get your required result.
* If you are discussing a PROCESS OR ABSTRACT CONCEPT (like [[fuzzy logic]]) you must deeply explain how it works.


== Examples ==
In terms of programming, the easiest example is that of a linear search where you search for an element in an array by checking each and every element, starting from the first, with the element that you want to find.


Please include some example of how your concept is actually used. Your example must include WHERE it is used, and WHAT IS BENEFIT of it being used.
<ref> https://www.quora.com/What-is-brute-force-in-programming </ref>


== Pictures, diagrams ==
== Pictures, diagrams ==
Line 37: Line 37:
== External links ==
== External links ==


* It would be helpful
<ref>https://en.wiktionary.org/wiki/brute_force </ref>
* to include many links
<ref>https://www.lifewire.com/brute-force-dictionary-hacking-4061418 </ref>
* to other internet resources
<ref> https://www.owasp.org/index.php/Brute_force_attack </ref>
* to help fellow students
<ref> https://www.howtogeek.com/166832/brute-force-attacks-explained-how-all-encryption-is-vulnerable/ </ref>
* Please make sure the content is good
* and don't link to a google search results, please


== References ==
== References ==

Latest revision as of 22:20, 14 September 2017

Exclamation.png This is student work which has not yet been approved as correct by the instructor

Case study notes[1]

An Introduction to Brute Force[edit]

  • Brute force is a method by which malicious attackers try many passwords and passphrase's to correctly guess a victim's credentials. The malicious attacker's programs an algorithm that systematically checks all passwords until the correct one is identified.
  • A brute force attack is a cryptoanalytic attack that theoretically could be used against any type of encryption.
  • Brute force can be very efficient for smaller passwords but VERY inefficient for big passwords. For bigger passwords, dictionary attack's would be more relevant


[2]

How does it work practically[edit]

  • Let’s say that you have a number lock with you. But you forgot the number. What are your options to get it open ?

You could try and remember the key, but what if you can’t. Then your probable option is to try each and every combination until the lock finally opens. And that’s basically what brute force is all about. Test each and every possibility until you get your required result.

In terms of programming, the easiest example is that of a linear search where you search for an element in an array by checking each and every element, starting from the first, with the element that you want to find.

[3]

Pictures, diagrams[edit]

Pictures and diagrams go a LONG way to helping someone understand a topic. Especially if your topic is a little abstract or complex. Using a picture or diagram is a two part process:

  1. upload a file
  2. use the file on a wiki page

External links[edit]

[4] [5] [6] [7]

References[edit]