
Ep 194: David Deutsch’s ”The Fabric of Reality” Chapter 9 ”Quantum Computers” Part 4: Shor’s Algorithm
ToKCast
How to Crack RSA Security
P equals the greatest common divisor of 8 to the power of R over 2 minus 1 And n Is q This is because in this original formula here Okay P must divide neatly into either A or p. Now we've collapsed all of this down into Finding the greatestCommonDivisor Of 35 and 63 Which is 7 7 is the number that is Biggest that will go into both of those By the same argument Q is the greatest commondivisor of 65 and 35 Which is 5 So that's it That's what you do That's how you crack RSA security Right, what's the problem? Well, the problem is That finding R in the first place Or for a huge number
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.