+ 7
Brute force
Can you help me with Brute force? Please, give me a simple example... How does it work?
17 Answers
+ 6
so do you use it xd? TA .A?
+ 6
Azat_Hajiev Yeah Thanks . Goodluck ^ ^
+ 5
Oh really? I see~
+ 5
Azat_Hajiev Yeah but still there exist ways to avoid being detected XD .
+ 5
hahaha oh cool; Good job^^ TA .A
+ 4
It's good that you tried to use Google, usually people would assume you did not.
In simple terms, Brute forcing means to try and check every possible answer for a solution.
For example, if you forgot your PIN of five digits, you would try to recall what you last set it to, or try your birthday, your favourite number, etc.
But using a computer, you can simply try every combination of numbers till you get the right one. That is
00000
00001,
00002,
.
.
.
99997
99998
99999
This would take too long for a human to do but a computer could do it in under a second.
Hope this clarifies your doubt :)
+ 4
Thanks; You tooTA .A
+ 3
Thank you!
+ 3
brute forcing is harder nowadays , coz most websites now ,use "anti_bruteforcing softwares " :$ , and some of them may detect you even if you use proxy .
+ 3
Azat_Hajiev when i started studying ethical hacking course yes , i used to use hydra and medusa , and for bruteforcing wifi passwords i used aircrack . but now im more passionate in coding :)
+ 2
Thank you; But I tried to find efficient information in Google; But I can't
+ 2
In C++
+ 2
Thanks a lot :)
+ 1
Try to google such questions before posting them, you are likely to find an answer much faster that way.
+ 1
First of all - what language do you wanna make it in?
0
I hope that help you
https://stackoverflow.com/questions/14094864/explain-brute-force-algorithm
0
3 main types of programming.
Greedy: Pick the SINGLE best outcome at every stage and use that as a base result for the next stage.
Dynamic: Pick the BEST of EVERY TYPE of combination at that stage by using the best previous combinations as the base of the results.
Brute Force: Go through every POSSIBLE combination.