Naive implementation of Rainbow Table and/or Hellman's trade-off

This question is the same one I asked here. Since I haven't got any response or even a comment I will post it here as well.

Is there any naive implementation of Hellman's cryptanalytic time memory tradeoff in C and/or a naive implementation of Oechslin's rainbow table algorithm in C as well?

I have seen some implementations of rainbow table but they are always focused on being fast through the usage of assembly-level operations or being designed to work on a specific platform such as CUDA or FPGAs.