>>6
Me thinks you don't understand rainbow tables
You use a set of reduction functions and chains of various lengths, and then only store the start and end of each chain. This reduces your storage requirements by orders of magnitude at the cost of trivially small increases in lookup speed. It is certainly feasible for someone to generate a table that covers the entire keyspace (2**56, the salt is not a salt and DES's key is 56 bits) and store within a reasonable limit.
It would not even take a large effort to do so. An average computer can do 500k-1,000k per second, but a PS3 can do 14,000k. 2^56 / 14000000 / 3600 / 24 / 365 = 163 PS3s to do it in a year. I'm not sure why you would bother though as anyone willing to spend a few thousand can do an exhaustive search in three months(~$2,000) to 7 days (for only $12,000 almost a year ago now). When it gets that fast why even bother with precomputation?