However, the author managed to squeeze the word "however" eleven times in this article, however.
pixelpoet 12 minutes ago [-]
How did the author squeeze the word "however"?
I did notice a stray apostrophe here and there, I'm guessing the editor noted out at the wall of quite technical writing.
flimflamm 1 hours ago [-]
However, there was only 57 however's in the paper it self.
smj-edison 3 hours ago [-]
Wait, the article mentions that Shor's algorithm is factoring (which is what I understood), but then it's talking about elliptic curve cryptography? I thought ECC didn't use the same mathematical foundations of RSA, and RSA has been slowly phased out anyways...
lima 3 hours ago [-]
Shor published multiple quantum algorithms, including one for discrete logarithms. The term is sometimes used interchangeably.
They're closely related, ECC and RSA are both instances of the hidden subgroup problem.
bjoli 3 hours ago [-]
Quite the contrary. Shor's algorithm actually works better for the shorter keys of ECC. The rule of thumb is 2n qbits for RSA keys and 6n qbits for ecc. I believe it has something to do with hownit applies to the hidden subgroup problem of finite abelian groups rather than factorisation, but I am really not a cryptographer not especially mathsy. I just asked the same question you did, and someone in the know pointed me to that.
raverbashing 3 hours ago [-]
> I thought ECC didn't use the same mathematical foundations of RSA
It kinda does, it just uses them differently
The basis here is the discrete inverse logarithm in a specific group (elliptic curves over rationals or multiplicative group module n)
Genbox 2 days ago [-]
Publishing a zero knowledge proof rather than the solution is pretty clever.
adrian_b 13 minutes ago [-]
This has been used for centuries. It is not a new invention.
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 6 hours ago [-]
Is it? Nobody else can really build on their work.
riffraff 5 hours ago [-]
AIU the intent of this publication is not to further research but to make it clear to anyone that we need to move to post quantum cryptography ASAP.
QuaternionsBhop 4 hours ago [-]
If only AI safety research had a mechanism this clear. "We have proof that building the machine will kill everybody, so get to work making a provably safe version."
AnthonyMouse 48 minutes ago [-]
"AI safety" is essentially incoherent. It's like trying to build an all-purpose chemistry lab that can't produce explosives.
cubefox 22 minutes ago [-]
Neat, an ontological argument against AI safety. Similar argument:
"God doesn't exist" is essentially incoherent. God is the perfect being, and if he didn't exist, he wouldn't be perfect.
I think the logical mistake is obvious.
adastra22 40 minutes ago [-]
That may be the intent, but it is very anti-science.
cubefox 4 hours ago [-]
> If the paper's authors had chosen to release their circuit, they would certainly have been recognized for the important progress they made in the science of quantum computing. Other researchers would have gone on to build on their work, and the entire scientific community would be richer for it.
... 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.
I did notice a stray apostrophe here and there, I'm guessing the editor noted out at the wall of quite technical writing.
They're closely related, ECC and RSA are both instances of the hidden subgroup problem.
It kinda does, it just uses them differently
The basis here is the discrete inverse logarithm in a specific group (elliptic curves over rationals or multiplicative group module n)
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).
"God doesn't exist" is essentially incoherent. God is the perfect being, and if he didn't exist, he wouldn't be perfect.
I think the logical mistake is obvious.
... 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.
1: https://scottaaronson.blog/?p=9665