On Wed, 5 Mar 2003, Vernon Schryver wrote:
See http://www.dcc-servers.net/dcc/graphs/
Those graphs are interesting, but hardly constitute proof that
a checksum scheme can't be defeated.
It's very easy to prove that any (useful) checksum algorithm can be
thwarted.
In theory, yes. In practice, that has not been true since I started
compute spam checksums to prove that that is right and Paul Vixie was
wrong half a dozen years ago.
Only because not enough people use DCC to make it a problem for spammers.
It's the usual situation that a tool that works well now, stops working
well once lots of people use it. Catch-22. :-)
--
David.
_______________________________________________
Asrg mailing list
Asrg(_at_)ietf(_dot_)org
https://www1.ietf.org/mailman/listinfo/asrg