mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Operation Kibibit

Reply
 
Thread Tools
Old 2016-01-28, 23:43   #1
jwaltos
 
jwaltos's Avatar
 
Apr 2012

22·3·29 Posts
Default ..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.
jwaltos is offline   Reply With Quote
Old 2016-01-29, 00:07   #2
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

23×727 Posts
Default

Quote:
Originally Posted by jwaltos View Post
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"
retina is online now   Reply With Quote
Old 2016-01-29, 17:46   #3
Till
 
Till's Avatar
 
"Tilman Neumann"
Jan 2016
Germany

3·139 Posts
Default

Is this what you're talking about?
https://eprint.iacr.org/2013/095.pdf
Till is offline   Reply With Quote
Old 2016-01-29, 20:58   #4
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

32×659 Posts
Default

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.
CRGreathouse is offline   Reply With Quote
Old 2016-01-30, 06:40   #5
Till
 
Till's Avatar
 
"Tilman Neumann"
Jan 2016
Germany

3·139 Posts
Default

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

Quote:
Originally Posted by CRGreathouse View Post
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.
Till is offline   Reply With Quote
Old 2016-01-30, 09:33   #6
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

34·53 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
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.
xilman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
CUDA and cryptography ET_ GPU Computing 10 2012-09-24 10:27
Metrosexual/Bi-Curious Cryptography article ewmayer Math 4 2012-09-09 06:43
GIMPS and cryptography Rodrigo Lounge 4 2012-07-31 16:03
"ODD" Square root Algorithm petrw1 Math 3 2008-03-15 07:35
Distributed Internet Cryptography ewmayer Math 1 2006-08-21 20:53

All times are UTC. The time now is 01:23.

Tue Oct 27 01:23:15 UTC 2020 up 46 days, 22:34, 0 users, load averages: 2.40, 2.05, 1.83

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.