Who knows, maybe they went on a journey to learn C# or Python to be able to run the provided code!!!
At least that question led me to add a new feature to FinderOuter to make it possible for users to recover their WIFs missing up to 11 characters at the end.
At least that question led me to add a new feature to FinderOuter to make it possible for users to recover their WIFs missing up to 11 characters at the end.
Here we are 426 days + later and...nothing happens
Well, all thanks to you and your FinderOuter, its amazing and works perfect. But I will like to know if its dependent on GPU and/or CPU ? How can the speed be increased ?? As I noticed its faster with fewer characters to find and slower with much more characters...For CPU you may also try https://github.com/PawelGorny/WifSolver
For GPU: https://github.com/PawelGorny/WifSolverCuda but it will not work for cases where the end is totally destroyed (it is using checksum collision algorithm).
For the case from the OP, the best would be BitCrack, simple iteration over possible keys. But as I do not know the number of known/missing characters, it is difficult to evaluate the time needed.