Archives

Archive for the ‘Cryptography’ Category

When it comes to the Diffie-Hellman algorithm, there seem to be many confusions from newbies in Cryptography as to whether an attacker could easily recompute the shared key by intercepting the prime numbers + public keys. While the answer is “no”, understanding why, requires an understanding the discrete logarithm problem. So here we go. Discrete Logarithm [...]

Oct 31st, 2011 | Filed under Cryptography