Comments on: Crypto Series: Discrete Logarithm

By: Eloi Sanfèlix

Eloi Sanfèlix — Wed, 17 Feb 2010 18:31:46 +0000

@schilly Cool, thanks for the tips!

I’m not much of a Python guy, I’m more of a C coder. I’ll update the post with your suggestions

By: schilly

schilly — Tue, 16 Feb 2010 17:17:35 +0000

Hi, very cool article – and welcome to sage

Just some picky comments about the python code:

1. you can create the powers list more pythonic:

sage: powers = [ g^i for i in range(100) ]

2. you can visualize it’s “randomness” via list_plot(powers)

3. the while loop is a bit odd, this looks better:

sage: a = g^-100; y=G(8938); j=1
sage: while not y*a^j in powers: j += 1
….:
sage: j
79

By: Crypto Series – ElGamal Cryptosystem « Limited Entropy Dot Com

Crypto Series – ElGamal Cryptosystem « Limited Entropy Dot Com — Fri, 12 Feb 2010 17:25:22 +0000

[...] our last post we learnt about the Discrete Lograithm problem, why it is a difficult problem and how we can attempt to solve it if the numbers are [...]

By: vierito5

vierito5 — Thu, 04 Feb 2010 20:37:17 +0000

Awesome article and great explained