..New algorithm shakes up cryptography"?

http://www2.cnrs.fr/en/2393.htm

"..considered to be one of the 'holy grails' of algorithmic number theory.."

I haven't heard much shakin' going on.

[retina]

Originally Posted by jwaltos

http://www2.cnrs.fr/en/2393.htm

"..considered to be one of the 'holy grails' of algorithmic number theory.."

I haven't heard much shakin' going on.

Standard click bait.

"Amazing breakthrough that will make you doubt the foundations of modern science!!!!!"
"See 73 things that will astound you and make you question your beliefs!!!!!"
"Researches discover major flaw in Internet security, OMG the world is coming to an end!!!111eleven"

[Till]

Is this what you're talking about?
https://eprint.iacr.org/2013/095.pdf

[CRGreathouse]

Are there any major cryptosystems working in finite fields of small characteristic -- i.e., with exponents > 1? I didn't think there were many in use before the Joux L(1/4) algorithm, and surely (?) after that any remaining would have been abandoned in droves.

[Till]

There was another improvement:
https://eprint.iacr.org/2013/400.pdf

Originally Posted by CRGreathouse

Are there any major cryptosystems working in finite fields of small characteristic -- i.e., with exponents > 1? I didn't think there were many in use before the Joux L(1/4) algorithm, and surely (?) after that any remaining would have been abandoned in droves.

I don't know if any such cryptosystems exist(ed). Probably the major concern is that some of the improvements might be transferred to systems that are widely used.

[xilman]

Originally Posted by CRGreathouse

Are there any major cryptosystems working in finite fields of small characteristic -- i.e., with exponents > 1? I didn't think there were many in use before the Joux L(1/4) algorithm, and surely (?) after that any remaining would have been abandoned in droves.

Hint: do a literature search on characteristic 2.

Char 2 has nice properties which makes arithmetic on binary computers rather easy.