Implementation of the Time Lock Puzzle as described by Rivest, Shamir and Wagner in [0].
This is a testing ground. This code does not work (mainly because it's unclear from the paper how the key K is generated and used with C_K = K + 2^a^t (mod n). The only possible way I can think of is generating and using a 160+bit integer). It is also extremely inefficient.