News for hackers. Stuff that matters.
Re:The Day When Computers Can Break All Encryption Is Coming by credit_guy on Sunday June 09, 2019 @07:54AM (#20138632)
> they just haven't yet been able to factor large enough numbers to be dangerous.

According to [1], the current highest factorization using Schor's algorithm is 21=3 * 7 published in 2012, up from the 15=3 * 5 that was demonstrated in 2001. This pace is not all that promising.

Sure, there are other quantum factorizations, but they are either stunts (work only for very narrow classes), or are based on a different algorithm than Schor, which does not show hope to scale up.

[1] https://crypto.stackexchange.com/questions/59795/largest-int...

Re:The Day When Computers Can Break All Encryption Is Coming by todd8 on Sunday June 09, 2019 @08:11AM (#20138700)
Your 3 * 7 and 3 * 5 got interpreted as a highlighting of the text surrounded by the asterisks. You can edit your comment to fix it. Here are the complete HN markup rules:

Blank lines separate paragraphs.

Text surrounded by asterisks is italicized, if the character after the first asterisk isn't whitespace.

Text after a blank line that is indented by two or more spaces is reproduced verbatim. (This is intended for code.)

Urls become links, except in the text field of a submission.

Re:The Day When Computers Can Break All Encryption Is Coming by credit_guy on Sunday June 09, 2019 @08:29AM (#20138764)
Many thanks, updated.