Which is faster – brute-forcing, or using a dictionary attack that contains all possible permutations?

Assuming a 6-character password uses the mixalphanumeric charset, giving each character a character set of 62 and the entire password a keyspace of 62^6 = 46.6 billion (if my calculations are correct)…

Would it be faster t… Continue reading Which is faster – brute-forcing, or using a dictionary attack that contains all possible permutations?

Which is faster – brute-forcing, or using a dictionary attack that contains all possible permutations?

Assuming a 6-character password uses the mixalphanumeric charset, giving each character a character set of 62 and the entire password a keyspace of 62^6 = 46.6 billion (if my calculations are correct), would it be faster to b… Continue reading Which is faster – brute-forcing, or using a dictionary attack that contains all possible permutations?