Originally posted by Siga
and considering google probably uses a form of sha 2 you'll never get passed it , and there is the passphase :despise: the only part that is pointless to try and brute
Well, you don't need that as it is a try and a miss. You would look for whether or not you get into the account or not, if it is false, then you try again and again until the program reads true.
You could probably develop your own brute for this, efficient enough to do the job, nope as it would take a long time for it to actually reach the correct combination. :/