Very striking that breaking discrete log was a curiosity while breaking factoring was a major event. I guess in those days RSA was *the* algorithm. Today we mostly prefer discrete-log based algorithms.
@@ionman6237 Probably already discovered it but DL is used on Diffie-Helman based problems which stems a plethora of schemes. One for encryption is ElGamal encryption and there is even a signature-based scheme for ElGamal. Much more on this. For examples pairing-based cryptography is also based on the fact on the hardness of DL.
At 2:44, he says he told someone (Vazirani) that he knows how to factor large numbers in a QC, then at 3:11 suggests that he is surprised that people knew that he solved the factoring problem instead of Discrete Log.
At 1:53, the paper's title seems to suggest he already solved the factoring problem, then he says later 2:31 that he managed to solved it later in a few days.
This is an amusing video, but the sequence and story are confusing in certain parts. It made more sense than it should since I've heard him tell this story before.
Thanks for watching! This is a condensed version of the story behind Shor's Algorithm, but we have the full interview with Peter Shor here that may help fill in the gaps for you! ruclips.net/video/6qD9XElTpCE/видео.html
It's exciting to see how historical discoveries are done.
Very striking that breaking discrete log was a curiosity while breaking factoring was a major event. I guess in those days RSA was *the* algorithm. Today we mostly prefer discrete-log based algorithms.
what do we use discrete-log based algorithms for today? i'm interested to know some examples.
@@ionman6237 Probably already discovered it but DL is used on Diffie-Helman based problems which stems a plethora of schemes. One for encryption is ElGamal encryption and there is even a signature-based scheme for ElGamal. Much more on this. For examples pairing-based cryptography is also based on the fact on the hardness of DL.
Amazing work! Thanks for sharing the background with such a fun animation.
Video design ... excellent. I don't know anything about Shor's Algorithm, but it seems to be considered above average.
We need a video on how much funding into the field of quantum computing Shor's Algorithm has attracted. It is beautiful 😍
At 2:44, he says he told someone (Vazirani) that he knows how to factor large numbers in a QC, then at 3:11 suggests that he is surprised that people knew that he solved the factoring problem instead of Discrete Log.
The video cut short, watch the original talk where he later corrected himself.
At 1:53, the paper's title seems to suggest he already solved the factoring problem, then he says later 2:31 that he managed to solved it later in a few days.
This is an amusing video, but the sequence and story are confusing in certain parts. It made more sense than it should since I've heard him tell this story before.
Really interesting. Thanks for the information.
03:05 this is called Chinese whisper 😊
Like who sent him his paper? (1:53)
One of the best
1:50 makes it look like Simon actually ghost-wrote the factoring paper and sent it to Shor. I don't understand that part.
I couldn't make out what word he said when the video showed Simon's paper and his paper getting accepted to "Fox"???
FOCS: Foundations of Computer Science Conference
@@qiskit Thanks!
Isn't Shores algorithm polynomial instead of exponential?
First comment
Is that the voice of peter shor?
"The story of how Shor's Algorithm came to be, told by Peter Shor himself."
Nice video. Now can you make another one explaining what the hell this is about? No, really. It seems fascinating, i just don’t understand it
Thanks for watching! This is a condensed version of the story behind Shor's Algorithm, but we have the full interview with Peter Shor here that may help fill in the gaps for you! ruclips.net/video/6qD9XElTpCE/видео.html
Just Super. (Superlative) & Suprisingly Savvy of you to ( Cee _++++++++++ the Future ) with this Wonderful Piece of Work ...Fly on !👍⚜️🖖🙀
Interesting
🤯