I was trying to understand the Wikipedia page on this topic with some difficulty. Your video did an excellent job of explaining it simply. Thanks a lot.
@@sharonomonua1747 Mod or modulo only returns the remainder of a division operation. For instance, if you divide 5 into 5, the result is 1. But if you divide 5 into 3, the remainder is 2. Therefore, we write 5 modulo 3 = 2. These videos might help: 1 - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-6dZLq77gSGU.html 2 - ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-4zahvcJ9glg.html
Nice simple introduction and the slow transitioning of deeper and technical understanding with step by step interactivity in processing the RSA algorithm. Finally, ending with a real life example using Amazon's cart totally amazed me how it all works together. I'm sharing this with one of my Math Faculty members who teaches math for teachers, she'll be impressed to see how cryptography applies in real life and that most people don't know it. Thank you for taking the time out and scripting this too, good job, and an A+!
This video was such a gem that it explained almost everything of the concept clearly in just a couple of minites Thanks mate, you made me very happy today
I just wanted to say that the way you showed the extended Euclidean algorithm was not something I had seen before and it made my work SO much easier. You've more-than earned my like.
extended euclidean algorithm is far easier than this technique and less time consuming. whereever you go there's just a matter of time and if you are slower then no one cares :)
As Edward Snowdon said recently and as Gordon Welchman said 70 years ago, a computer generated algorithm thats creates a cypher can always be decrypted. The only true unbreakable encryption is a non computer generated one time pad. Its still used today. There is a guy in Switzerland who has a barrel with 50,000 dice and it spits out five dice in a row it then grabs them back and the next turn does the same. He will manually create one time pads for you at a cost of $500, good for 10,000 characters. No machine, not even a simple typewriter is used. They are written out by hand and you get both copies. He keeps no records of who buys them. Swiss banks now use them to protect their clients transactions after the US got a court order for computer records of US Taxpayers. Now not even the banks know.
There is an encryption program out there named Vial 7 - Only way to get a copy is if you know the person. Each copy is made to order and it will only work on the users computer. He hard codes the key into the program and puts the location of the file somewhere on the computer at the request of the client. When you try to use the program it looks for the key and if it's not found it will close the program, so everyone that wants to communicate with that program they have to have a custom made version to work on their computer. The encryption math is said to make RSA look like 1+1. If you are not government USA, you will never own it. After it locates the key to use it then the real encryption begins and if you use the same password every time, the encryption out put will always be different, that means there is no standard algorithm with the exception of unlocking the program for use. Estimated bit strength - Unknown because the more text there is the higher the bit strength gets.
OMG! so I am being taught Maths in uni and its basically everything in this getting me ready for next year. I find it hard to follow the lecturer sometimes and this is amazing! I need to also program a crypto algorithm and this gives me a good base! THANK YOU!
Thank you very much for this video! It is of excellent quality and I could understand it easily despite I'm only at secondary school. It is the best explanation I've come across both in print and on the internet. Many thanks!
Thanks for the video. It helped that I already understood the process, but this is still useful. It would perhaps have been informative to explain to people why we use phi = (p-1)(q-1), but hopefully they will search the Internet to see why that is so.
This is actually super useful for what I am currently working on. I'm attempting to generate rsa keys using a seeded rng which uses bitcoin's bip39 seed or "mnemonic phrase".
u made my day & saved my time & I love you not rly but great video & u explained everything so well & simply that even I could follow & now I wrote a working python script & I'm happy ^^
Hello, very nice explanation. Now, I read somewhere that if I want to have a 8bits key, my 'n' needs to be less than 2^(8), but I saw many resolutions where they use a 'n' that is > 2^(key lenght that they want). Could someone light me up?
Good explanation, but is important to point that e must be coprime with phi and N. With small numbers, it's relatively easy to pick a value for e, but if p and q have 30 digits each...
Hi! I love your video and it is helping me a lot with my Internal Assessment from IB Maths HL. I really need to do something original with RSA encryption (or look at it at a different way), so I was wondering if you (or anyone reading this comment) could have any idea about an original idea or a further step to RSA encryption. Thanks ;)
Amazing video. TO ANYONE CONFUSED: LEARN ABOUT THE EUCLIDEAN ALGORITHM AND THEN STUDY THE EXTENDED EUCLIDEAN ALGORITHM INDEPENDENT OF RSA. That might help.
where did he get that rule about e > 2? Art of the Problem said e has to be a odd number greater than 1....and I dont know where he got that either. Anyone know the conditions of e and why this is? Also, sources would be appreciated. Thanks
The initial 8-bit LFSR 10101010 and the feedback tabs polynomial is x5+x3+x1+1. Use Excel to generate a keystream of a sufficient length to encrypt your name “space”, showing all the steps?
I had a problem when applying the extended euclids theorom to my example. One one occasion i was left with such a high minus number, that when mod it with my Phi number, it returned another -minus number, therefore i could not continue the algorithm, as yours provided in the xample returned a positive after
+michael 0184 did you try putting the mod calculation into that wolfram site? Also the answer i got from modulus at the end of the calculation was negative also, but if you mod it again or a few times depending on the number your modding by, eventually you get the positive, which explains the answer i got from the wolfram site. For the record my final inputs for the Euclid algorithm to find d was -617 mod 360. which would give me - 257, but if you mod it again it gives 103, which matches the answer wolframAlpha gives :)
