Brute-force

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:

External links[edit]

It would be helpful
to include many links
to other internet resources
to help fellow students
Please make sure the content is good
and don't link to a google search results, please

References[edit]

[1] ttp://www.flaticon.com/

[2] ttps://en.wikipedia.org/wiki/Brute-force_attack

[3] ttps://www.quora.com/What-is-brute-force-in-programming

[1]

[2]

[3]