Hacker News
A more efficient implementation of Shor's algorithm
fguerraz
|next
[-]
smj-edison
|next
|previous
[-]
lima
|root
|parent
|next
[-]
They're closely related, ECC and RSA are both instances of the hidden subgroup problem.
bjoli
|root
|parent
|next
|previous
[-]
Genbox
|next
|previous
[-]
adrian_b
|root
|parent
|next
[-]
Hundreds of years ago, it was not unusual to publish an encrypted solution of some mathematical problem, in order to establish priority without disclosing the algorithm that was used.
Of course, at that time very simple encryption methods were used, for instance an anagram of the solution was published (i.e. encryption by letter transposition).
coherentpony
|root
|parent
|previous
[-]
riffraff
|root
|parent
[-]
QuaternionsBhop
|root
|parent
|next
[-]
cubefox
|next
|previous
[-]
... and the world could well have been unsafer. There is pretty strong reason not to release insights which could be used as an attack on public key cryptography. We already know the fix anyway, post quantum cryptography algorithms.
Sometimes scientific curiosity has to step back when it comes to potentially dangerous research. Scott Aaronson recently [1] compared this case to when scientists stopped publishing on nuclear fission research because the possibility of developing an atomic bomb became concrete:
> When I got an early heads-up about these results—especially the Google team’s choice to “publish” via a zero-knowledge proof—I thought of Frisch and Peierls, calculating how much U-235 was needed for a chain reaction in 1940, but not publishing it, even though the latest results on nuclear fission had been openly published just the year prior.