Comment Re:Somewhat (Score 1) 114
This is not at all relevant to most implementations of DH, which use prime fields of large characteristic.
Exactly. Probably more interesting is that their solution is applicable to a wider range of finite fields than recent improvements.
From the paper:
Although we insist on the case of finite fields of small characteristic, where quasi-polynomial complexity is obtained, our new algorithm improves the com- plexity of discrete logarithm computations in a much larger range of finite fields.
I see no good basis for the ScienceDaily author's leap from the paper's results to his conclusion that
Since solving this variant of the discrete logarithm is now within the capacity of current computers, relying on its difficulty for cryptographic applications is therefore no longer an option. This work is still at a theoretical stage and the algorithm still needs to be refined before it is possible to provide a practical demonstration of the weakness of this variant of the discrete logarithm. Nonetheless, these results reveal a flaw in cryptographic security and open the way to additional research. For instance, the algorithm could be adapted in order to test the robustness of other cryptographic applications.