Does anyone know of a recent brute-force work
factor calculation for the various common symmetric ciphers?
I.e. it'll take X 3.2gh Xeons Y years to brute cipher Z.
I know there's a table of these in Schneier and there's the Seven
Cryptographers paper but they're both pretty old at this point.
I visited that 419eaters site, and I must say I have really mixed feelings
about what the people are doing there.
It's certainly unethical for Nigerians to try and make a living by bilking
foreigners with elaborate schemes that promise vast riches in return for an
advance fee.
But Nigeria is a
Eric Cordian wrote:
But Nigeria is a very poor country, with high unemployment, where
people are forced by economic circumstances to do almost anything to
try and feed their families. I see no reason to be proud of
reverse-scamming a Nigerian out of $80 when it might be his entire
family's
I know there are readers here who are good at optimizing code. Here are
my attempts to make simple and short versions of base64 encode/decode
in C. I'd like to hear suggestions on how to simplify them even more.
Base64 encoding is a way of turning arbitrary binary data into printable
Eric Cordian wrote:
It's certainly unethical for Nigerians to try and make a living by bilking
foreigners with elaborate schemes that promise vast riches in return for an
advance fee.
Granted.
But Nigeria is a very poor country, with high unemployment, where people are
forced by economic
David Howe writes:
Presumably these are the Nigerians who have only $80 for food that
month, yet somehow can still afford to bulkspam thousands of inboxes
each day, process bank transactions and take part in international phone
calls.
Email is free. That is why we have a spam problem.
