Advances in Solving the Discrete Log Problem
At Eurocrypt this year, researchers presented a paper that completely breaks the discrete log problem in any field with a small characteristic. It’s nice work, and builds on a bunch of advances in this direction over the last several years. Despite headlines to the contrary, this does not have any cryptanalytic application—unless they can generalize the result, which seems unlikely to me.
Gweihir • May 20, 2014 8:08 AM
Thanks for that comment. About what I expected, i.e. not a problem at this time and possibly not ever. I got the same impression from the paper, but this is far enough from my area of expertise that I could have been mistaken.
On a related note, what the press writes these days seems to be restricted to recognizing keywords, but actual interpretation, meaning or context seems to be far, far to complicated for them, making them worthless as a source. Basically the press is only useful to find out “something” has happened and the gross area it has happened in.