4 ms·
Sure, but a hash collision for a specified value is still a needle in a haystack. The sheer size of the keyspace (2^128) means that rainbow tables can only eve
by alexkus 14y ago
Sure, but a hash collision for a specified value is still a needle in a haystack.
The sheer size of the keyspace (2^128) means that rainbow tables can only ever exist for a subset of the keyspace.
1M machines running for a year each capable of doing 20M MD5 hashes a second will still only cover 1/539514153540300709th of the MD5 keyspace.
But, yes, salting would prevent the use of rainbow tables completely.
- Freaky 14y ago20M? Doesn't alter your point, but a pair of 3-gen-old ATI graphics cards manage on the order of 5000-6000M: Hash type: MD5, Hash: 6df23dc03f9b54cc38a0fc1483df6e21 Device #0: [RV870] 850.00 Mhz 1600 SP Device #1: [RV870] 850.00 Mhz 1600 SP CURPWD: @uX5G DONE: 22.30% ETA: 1m 34s CURSPD: 6436.3M=3217.8M+3218.6M http://www.golubev.com/hashgpu.htm http://www.golubev.com/hashgpu.htm
- duaneb 14y agoThis doesn't really change your statement, but 20M MD5 hashes/second is pretty damn wimpy these days. IIRC 20 BILLION is more accurate.