4 ms·
> The authors hint in a footnote that at the heart of their computation is an asymptotically fast algorithm, allowing them to bring the running time of the comp
by sublupo 8y ago
> The authors hint in a footnote that at the heart of their computation is an asymptotically fast algorithm, allowing them to bring the running time of the computation down to nearly linear; but the actual description of the algorithm is kept a secret from the reader
How could something like that pass peer review? Their claim is effectively unable to be reproduced.
- codezero 8y agoIt’s not clear to me that the journal it was published in is peer reviewed. Not all are. https://www.springer.com/computer/theoretical+computer+science/journal/145?detailsPage=editorialBoard https://www.springer.com/computer/theoretical+computer+scien... It’s useful to have such places to publish things, but unfortunate that it’s not clear whether it’s peer reviewed.
- ric2b 8y agoMaybe the reviewers had access.
- rincebrain 8y agoA number of CS publications (or non-CS publications with custom software) don't include the source/enough exact parameters/... to reproduce their results.
- andreareina 8y agoIf I'm reading the numbers right, even using the slow way you'd expect to break on the order of tens of keys per day. Thus the claim that "two out of every one thousand RSA moduli [...] offer no security" is easily verified. The secret algorithm doesn't compute secret data that can't be verified.