A standard technique from the cryptanalysis is to use exhaustive search that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the hash value. But this will take a lot of storage space and the time spent on query will be very long. In this paper, we introduce multiple Bloom filter, which improves performance when the password is attacked by brute-force or dictionary. Bloom filters can be used represent the password dicti