[Autoit] Combinations n^r

04/20/2016 23:00 elmarcia#1
Hi everybody, i've been bored so i decided to make a combination algorithm i explain how i get to those step by step.

Usage:
1)Get any combination n^r where:
n is a set of symbols like {"a","b",...}
r is the length of the string
(Getting all combinations of 5 letters in a text file for fun lasts 1 hour (14million aprox) limited by hard disc writting time (Remember all combinations of 5 letters means all words in any language that have that length :o))

2)Brute force passwords..
Nehh a password that contains {A,B,...}U{a,b,...}U {0,1,...} Where n = aprox 65 with a length of 10 has: 65^10 possible combinations or 1.34627433446289e18 -> lets say your computer can process 1millon per second that gives us a total of = 1346274334462.89 secs = 711.501318314989 years-> great :D

Code with tutorial:

Give me the [2239695393] code:
04/28/2016 11:44 Lawliet#2
[Only registered and activated users can see links. Click Here To Register...]