encryption,hash,md5,rainbowtable

The question depends on what your understanding of "simple values" is. Generally speaking cryptographic hash function try to emulate a random mapping of arbitrary length inputs to fixed length outputs. The most fundamental security notion of those cryptographic hashes is so called collision resistance, i.e. it is computational infeasible to...

c,multithreading,table,rainbowtable

The best way to parallelize the above function without facing concurrency issues is to create as many memory streams as many threads you wish to use and then divide the task into fractions, like if you have 4 threads, one thread performs the task from 0 to mMax / 4...

c,table,cryptography,rainbowtable

Ok, after much fiddeling I found that the endpoints i created was done wrong, and my reduction function was wrong. The online phase should create t points that will be checked with the table first one will be the last used reduction function on the Ciphertext, the second the last...