obviously you would need to define "brute-forcing program" and "weak" first.

Your question doesn't make any sense. Turing can generate lots of passwords quickly, but how can it use them? It can't really interact with anything to try them.

well thats what i was wondering if it was somehow possible to make it interact with my desktop stuff and see if it could figure out the passwords for certain things, like password encrypted files and such that i have on my pc... it is just a little experiment that im trying to do

it is just a little experiment that im trying to do

i wasnt intending to use this on websites lol i just wanted to create a little program and see if i could get it to guess my pass

btw this is just for educational purposes and to have something that could take a while to do, or just simply to annoy my sis when im bored lol

lol im just making sure that people understand that its just for fun... u never know there might be people out there that are so paranoid that they believe that everything is for mailcious purposes

Let's do the math just for fun. Let's assume your password is 4 characters long, using only lowercase english letters. Using <a href="http://en.wikipedia.org/wiki/Permutation">permutations</a>, that's more than 350 thousand combinations.

Assuming that you can interact with a website, and there is no retry limit, and that a round-trip response takes 1 second, that's about 4 days of continuous "brute-forcing."

Include numbers and upper-case letters, and that grows to 155 days of computation time.

Change that to a 5-character password and that grows to 24.6 years.

I think you can see where this is going.

In many cases efficient algorithms and data structures in Turing will significantly outperform naive implementations in C++. The compiler can only do so much for you.

But the problem is that no website in the real world supports user authentication this way...if they did they definitely wouldn't have any members!

Let's do the math just for fun. Let's assume your password is 4 characters long, using only lowercase english letters. Using <a href="http://en.wikipedia.org/wiki/Permutation">permutations</a>, that's more than 350 thousand combinations.

umm ouch? lol guess thats a waste of time... how could you make it brute force faster though? cause arnt there some that can figure out your pass in like minutes? i think?

A bubble sort will compare each item against each other item and is said to have O(n^2) complexity. That's 1024*1024 = 1,048,576 comparisons.

...what if...the brute forcing program was able to check each character one by one instead of trying everything at once.

is there a way for the program to only check an individual character...

(And Bubble-Sort is n^2 in worst case and average case.)

umm ouch? lol guess thats a waste of time... how could you make it brute force faster though? cause arnt there some that can figure out your pass in like minutes? i think?

Generally, if it can run in a minute, it's not going to be brute forcing, it will probably be exploiting weaknesses in whatever was used.

Brute-forcing takes way too long for it to be efficient, so it is mainly used for website hacking, even then finding an exploit is far easier than bruteforcing the form. Rainbow tables are the way to go nowadays.