[Ach] {Disarmed} Merry chrisis

[Michael Zeltner]

On 24 Dec 15:30, Pepi Zawodsky wrote:
> Kenn White (@kennwhite)
> 24.12.13 13:49
> Discreet logarithm breakthrough: “What would have taken 3 years to decipher could now be done in a day” m.cacm.acm.org/news/170850-fr… H/T @senykam

http://cacm.acm.org/news/170850-french-team-invents-faster-code-breaking-algorithm/fulltext

I'm no math-crypto buff so I still need to read more to fully understand the
post but this section suggests to me that not all hope is lost:

--- snip ---
Yet as Joux points out, the new algorithm is not efficient against all discrete
logarithms. The algorithm is intended for use on finite fields of small
characteristic. The elements of a finite field can be expressed as polynomials,
and for small characteristic finite fields, the coefficients of the polynomials
are small integers. In a "binary finite field," for example, the coefficients
are 0 and 1, and the characteristic is 2. However, for large characteristic
finite fields, used for example in the digital signature algorithm (DSA),
solving for the discrete logarithm remains a problem of sub-exponential
complexity L(1/3).
--- snip ---

Best, Michael
-- 
https://niij.org/
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 801 bytes
Desc: not available
URL: <http://lists.cert.at/pipermail/ach/attachments/20131224/a952a069/attachment.sig>