I'm running a password cracker on my own password and I'm trying to calculate how long it will take. I know the rate the software is checking at and I also know the password.
The password is $14$ characters long and is all lower case. Thus the total number of possibilities is $26$ to the $14$th power, which works out to $64,509,974,703,297,200,000$ according to Excel.
Let's assume the password is: fakepassokayab. The algorithm will start with $14$ character long passwords, so it will begin with
aaaaaaaaaaaaaa
aaaaaaaaaaaaab
etc, until it reaches
zzzzzzzzzzzzzz
Once it finds the matching password, it will stop and display it.
Two questions:
To calculate the position of the password in the entire sequence, I figured it would be the factoral of every letter's position in the alphabet, so that if the fake password is fakepassokayab, that would be $6\times1\times11\times5\times16\times1\times19\times19\times15\times11\times1\times25\times2$, or $15,725,160,000$. Is this correct? Since there are some 1s in there, it seems like those positions wouldn't be counted correctly
Currently the password cracker is at $182.629,132$. How can I calculate which position this is, given that it will run in alphabetical order and use all 26 letters?
If I need to provide additional information please ask me rather than mark this as a negative. I'm new to this part of Stack Exchange.