Wow, that was really worth while. So if the theory is correct and there are at least 2 numbers.
The result is a mask file with 247 lines (after removing the 9 which you kindly pointed out would be redundant).
Total time to crack is significantly reduced due to splitting the charsets.
As I now have charset 1, 7 chars long together with charset 2, 21 chars long resulting in a worst case of:
21^6 * 7^2 = 4,202,539,929 = ?1?1?1?1?1?1?2?2 which at 1MH/s is about 1 hour of processing time.
But most of them are less than that, its been running for about 10 minutes and I've already processed 9/247 so yep, this is definately worth the effort. Thanks again.
The result is a mask file with 247 lines (after removing the 9 which you kindly pointed out would be redundant).
Total time to crack is significantly reduced due to splitting the charsets.
As I now have charset 1, 7 chars long together with charset 2, 21 chars long resulting in a worst case of:
21^6 * 7^2 = 4,202,539,929 = ?1?1?1?1?1?1?2?2 which at 1MH/s is about 1 hour of processing time.
But most of them are less than that, its been running for about 10 minutes and I've already processed 9/247 so yep, this is definately worth the effort. Thanks again.