10-21-2020, 05:21 PM
Again, I want to emphasize that this is a theoretical solution, but it's not very practical...
You can't just run a very long 6 unknown bytes mask against an SCRYPT hash.... that's already very infeasible.
The fact that you know some of the 12 characters, doesn't make the problem much smaller or feasible (and you btw don't even know the position and order of them, which is also very bad)...
It's already hard to crack length 3,4,5 random bytes with SCRYPT hashes (depending on the N, r, p settings)...
so again, while above I try to explain how you could approach such a problem in theory, it's not very useful/practical here, because you are trying to crack 6 unknown bytes against a SCRYPT hash with high cost factor.
You can't just run a very long 6 unknown bytes mask against an SCRYPT hash.... that's already very infeasible.
The fact that you know some of the 12 characters, doesn't make the problem much smaller or feasible (and you btw don't even know the position and order of them, which is also very bad)...
It's already hard to crack length 3,4,5 random bytes with SCRYPT hashes (depending on the N, r, p settings)...
so again, while above I try to explain how you could approach such a problem in theory, it's not very useful/practical here, because you are trying to crack 6 unknown bytes against a SCRYPT hash with high cost factor.