Send a Message
to Anthea Lawn

Comments

7

Joined

Oct 19, 2008

Anthea Lawn Profile

Forums Owned

Recent Posts

Cryptography

RSA Implementation Consideration

If you REALLY want to get into large primes (for example on evenings when the TV programmes are a bit boring) then you can check out this page : http://www.mersenn e.org/ That in turn will get you into the Lucas-Lehmer test for testimg primality. http://en.wikipedi a.org/wiki/Lucas%E 2%80%93Lehmer_test Enjoy !  (May 26, 2009 | post #7)

Cryptography

Hash collision question

It's probably too late for you now, this post being at least a year old, but for anyone else, there's a reasonable Wikipedia page. Try : http://en.wikipedi a.org/wiki/Hash_co llision That being said, the page still does not give hard mathematical definitions for "strong" and "weak" resistance. To understand the differences between stong and weak, you'll also need to understand the principles behind the "Birthday Attack".  (Oct 19, 2008 | post #2)

Cryptography

Sherlock Holmes Challenge

There is danger - may come soon. One 'Douglas' [a] rich country [gentleman] now at Birlstone.  (Oct 19, 2008 | post #7)

Cryptography

Possibly uncrackable code

Nice try though ! It gets round the obvious issue of substitution ciphers of letter frequency (ie E and T are very frequent, X,Q and Z not so much so) and the spotting of double-letters (eg as in the word MEET) Nearly all modern cryptographic algorithms have systems in place to stop this kind of "frequency analysis" as it is called. Sometimes only to find that in "block ciphers" the issue reappears at a "block" level. And, as has been pointed out, the Viginere cipher is actually easier to crack than you might think, once you've discovered Babbage's ingenious technique.  (Oct 19, 2008 | post #4)

Cryptography

Funny cryptography song "Crypto"

Crypto gets behind the times Crook finds how to factor primes. (gulp)  (Oct 19, 2008 | post #2)

Cryptography

Cipher

Or "Programming in PERL" hehe.. But seriously, thanks for the links, these are good bits of info.  (Oct 19, 2008 | post #8)