Re:Crown Sterling Claims to Factor RSA Keylengths First Fact...
by gus_massa on Saturday September 21, 2019 @01:58PM
(#21036835)
Reposting from another thread:
From the video: in a computer with 200GB of RAM, and 32 cores, they factorized the key in 52 seconds.
The first key (in decimal) is 83473593554391843334619428139045661537976651941410655062632649869770538548577
This page https://www.alpertron.com.ar/ECM.HTM solved it in 3 minutes, 37 seconds. I guess they are not using a so powerful machine. (It says "This is the WebAssembly version.")
I'm too lazy to copy the second number, but I guess it will be as easy as factorize as the first.
Can someone just repeat this demonstration in travis-ci or something like that using an standard package?
From the video: in a computer with 200GB of RAM, and 32 cores, they factorized the key in 52 seconds.
The first key (in decimal) is 83473593554391843334619428139045661537976651941410655062632649869770538548577
This page https://www.alpertron.com.ar/ECM.HTM solved it in 3 minutes, 37 seconds. I guess they are not using a so powerful machine. (It says "This is the WebAssembly version.")
I'm too lazy to copy the second number, but I guess it will be as easy as factorize as the first.
Can someone just repeat this demonstration in travis-ci or something like that using an standard package?