09-04-2012, 01:56 PM
Hi,
I came across your discussion searching for information on how to make a custom 'smarter' brute-force program.
Including prioritized charter set and as discussed here to limit the re-occurrences of the same charter.
And my view of the whole is not to filter but rather to customize a permutation process mathematically (if possible) or by rewriting a simple brute-force program to 'skip-ahead' when re-occurrences occur to avoid testing all those extra useless generated passwords (simpler).
Now I want a mathematical solution so that I can 'reverse it' and later include all those permutations that where skipped IF the brute-force was unsuccessful with the 'optimized' method, so that I wont be forced to retry all those once again. But hey that's just me
/Dan
I came across your discussion searching for information on how to make a custom 'smarter' brute-force program.
Including prioritized charter set and as discussed here to limit the re-occurrences of the same charter.
And my view of the whole is not to filter but rather to customize a permutation process mathematically (if possible) or by rewriting a simple brute-force program to 'skip-ahead' when re-occurrences occur to avoid testing all those extra useless generated passwords (simpler).
Now I want a mathematical solution so that I can 'reverse it' and later include all those permutations that where skipped IF the brute-force was unsuccessful with the 'optimized' method, so that I wont be forced to retry all those once again. But hey that's just me
/Dan