Talk:Discrete logarithm
From Wikipedia, the free encyclopedia
Contents |
[edit] P is 7?
This article could use a -little- more explaination, or at least an easy to follow (more laymans) example. For instance, in the existing example is p supposed to be 7? (I would fix it myself, but IANAMW [I am not a math wiz]).
C needs to be explained further
[edit] {0,1,...,p-1}
I think (Zp)× is {0,1, …, p − 1}, not {1, …, p − 1}
No, it isn't Z_p is {0..p-1} (additive group), but (Z_p)^× is {1..p-1}, without zero (multiplicative group -- that × in the exponent connotes multiplication). Veky 09:30, 10 January 2006 (UTC)
[edit] Quantum Computing
Should we add a few sentences about quantum computing and Shor's efficient quantum solution of the discrete log problem? WindowMaker 22:24, 18 April 2006 (UTC)
- Sure; please do. I'm not familiar with it. If it's a modification of Shor's algorithm for factoring, perhaps it would be best treated there, and just cited here? Joshua Davis 00:34, 19 April 2006 (UTC)
[edit] Typo?
"This algorithm requires running time linear in the size of the group G and thus exponential in the number of digits in the size of the group"
Other way 'round. No?
- No, I don't think so. If the size of the group is 256, then the algorithm takes (proportional to) 256 steps, so an exponential number of steps in log 256 = 8, the number of bits needed to represent 256. (I'm using base 2 for exponentials and logs.) Make sense? Joshua Davis 13:09, 1 November 2006 (UTC)
