Please keep this type of in-depth video coming! I learned a tremendous amount from your clear explanations, and am able to implement my own programs based on your clear, and logical, step-by-step walk through. Please, more like this!!! 😃
@Peacfull
11 ай бұрын
here is the code if you are lazy to write: import random import math # n= p.q #phi(n) = phi(p.q)=phi(p).phi(q) = (p-1). (q-1) #phi(n) = (p-1.q-1) def is_prime (number): if number < 2: return False for i in range (2, number // 2 +1): if number % i == 0: return False return True def generate_prime (min_value, max_value): prime = random.randint (min_value, max_value) while not is_prime(prime): prime = random.randint(min_value, max_value) return prime def mod_inverse(e, phi): for d in range (3, phi): if (d * e) % phi == 1: return d raise ValueError ("Mod_inverse does not exist!") p, q = generate_prime(1000, 50000), generate_prime ( 1000, 50000) while p==q: q= generate_prime(1000, 50000) n = p * q phi_n = (p-1) * (q-1) e = random.randint (3, phi_n-1) while math.gcd(e, phi_n) != 1: #gcd=greater common denometer != not equal e = random.randint (3, phi_n - 1) d = mod_inverse(e, phi_n) message = input("Enter your message to Encrypt ") print ("Prime number P: ", p) print ("Prime number q: ", q) print ("Public Key: ", e) print ("Private Key: ", d) print ("n: ", n) print ("Phi of n: ", phi_n, " Secret") message_encoded = [ord(ch) for ch in message] print ("Message in ASCII code: ", message_encoded) # (m ^ e) mod n = c ciphertext = [pow(ch, e, n) for ch in message_encoded] print (message," Ciphered in: ", ciphertext) Decodemsg= [pow(ch, d, n) for ch in ciphertext] print ("back to ASCII: ", Decodemsg) msg = "".join (chr(ch) for ch in Decodemsg) print("from ASCII to TEXT: ", msg)
@mattanderson2074
Ай бұрын
A year late to the party, but thanks for the great explanation and the fantastic demo in Python. I'm familiar with the concepts of RSA already, but it's always good to have it explained clearly for folk who haven't looked at the concepts and logic behind it and your explanation was great.
@efox29
Жыл бұрын
I havent watched the video yet, but title alone and topic. Thumbs up.
@tanzir3678
Жыл бұрын
Good one. Yes, thorough explanation covering Maths and all is much beneficial than just demonstration of using some libraries. There are tons of people out there who would follow the second approach. And that makes you standout.
@sl3262
7 ай бұрын
I really like these more in depth videos. For me, learning the fundamental principles of how something works is by far the best way to understand it. Definitely do what has been suggested elsewhere: watch the theory then try and implement it in Python before seeing how it's done! More of these please, if you can!
@borisakelovic9930
5 ай бұрын
This "from the scratch" is sooo well done , Bravo
@Radical9535
Жыл бұрын
thanks i really like this being on the cyber security side of things i have to teach myself coding basically so these videos are great on stuff like this and now i have an understanding of how rsa works mathematically so thanks!
@aritraghosh999
3 ай бұрын
Please make more videos like this it helps us code by understanding the concepts
@huliang9001
9 ай бұрын
I really like these more theory based videos explained from scratch. In this way, I really learned something deep.
@amirabas8817
26 күн бұрын
Brother, you didn't put any corner of Python outside of your empire That's impressive 👏
@lennuard_6998
Жыл бұрын
coding challange: only watch the math part and (try to) implement it yourself before watching the coding part
@micleh
Жыл бұрын
Exactly. I often do this in my lessons (flipped classroom principle): watching a video at home, ironing out diffuculties in class and them implementing it in the lessons so as to figure out if the theory has been understood.
@certitolla202
Жыл бұрын
Done 😸✅✅
@ghAmputeeAtheist
Жыл бұрын
you can get the inverse of e mod phi with pow(e,-1,phi)
@Abomin81onVlog
Жыл бұрын
I enjoyed this video greatly.
@lintop3908
Жыл бұрын
Yeah, I really wanted you to release a video on this topic from scratch
@micleh
Жыл бұрын
I like such videos a lot. I'll definitely use this video in my upper sixth computer science course here in Germany since RSA is a topics on the curriculum. The implementaion will be in JAVA, though, since this is the language used in Years 11-13.
@silentkille4
8 ай бұрын
loving the content its helping me alot
@Ungerlogik
Жыл бұрын
I live the mix of these kind of videos and cool usefull stuff (like pomodoro). 😊
@paulthomas1052
Жыл бұрын
Thanks - another really useful lecture and practical demo. Cheers 😃
@TritdawG
9 ай бұрын
Great video; thank you for sharing.. super helpful!
@aryanlivi3553
7 ай бұрын
Great Explanation!!
@RajapuRishitha-jc6xy
3 ай бұрын
If n is known, since n can be written as the product of p and q only(given p and q are prime numbers), we can find p and q right?
@bartektrybaa3922
Жыл бұрын
I found this usefull for my studies. Thanks :D
@nicolamombelli2149
Жыл бұрын
Great explanation and nice example in Python. Thanks.
@ahmehhhd
Жыл бұрын
amazing video. we need more of these
@huliang9001
9 ай бұрын
Really awesome! Thanks bro!😀
@DroughtBee
3 ай бұрын
Doesn’t this leave itself open to frequency analysis because all the letters are just given (effectively for our purposes) random numbers? Why is this better than just any other mono-alphabetical code?
@tcgvsocg1458
Жыл бұрын
really interesting these day i look in aes 256 bits encry^tion i don t know whitch is best but both are really interresting
@salahtamimy5322
5 ай бұрын
Thank you 👍
@user-ku6gw1wm6b
19 күн бұрын
Nice one.
@harsharya828
Жыл бұрын
Thanks for this knowledge.
@Peacfull
11 ай бұрын
nice work but where you selected 7, and that part i did not get it completely how did you come up with 7. I have wachted that part again and it was not clear for me. but still your explanation was very good. thank you. keep up the good work.
@prosodyspeaks4036
10 ай бұрын
yeah! more like this!
@khairysuleiman4
9 ай бұрын
Thanks Mr. Best!
@danielw8620
Жыл бұрын
May I ask what your educational background is? Are you self taught, did you go to college for a Math degree/CS degree? Thanks
@nejathakan5521
Жыл бұрын
Keep this kind of videos please.
@WahranRai
10 ай бұрын
27:43 Which calculator did you use
@garydunken7934
6 ай бұрын
Microsoft Windows calculator
@WahranRai
6 ай бұрын
@@garydunken7934 Thank you, i already found it !
@cpp705
Жыл бұрын
thanks i needed it
@chyldstudios
Жыл бұрын
awesome, thanks for making this video,.
@seeesh_
Жыл бұрын
Hi, I would like to ask some Pandera tutorial to do data quality, doing some advance transformation on data. That's possible?
@PawitSahare
Жыл бұрын
And awesome video bro
@JO06
11 ай бұрын
Thank you brother
@piotrmazgaj
Жыл бұрын
Very nice.
@CthRage8946
Ай бұрын
You can make someone very rich!
@bhagyalakshmi1053
Жыл бұрын
How to create vlu ?
@Andr_e_y
3 ай бұрын
It's a shame there's no salt here. Thank you😊
@JarppaGuru
6 ай бұрын
29:01 so how hard brute force private key if we know s n and m. bob can do s=m^d mod n too mean try every thing 141=15^d mod 143 why we sign using d and n when we should sign using phi_n alices=m^d mod phi_n-1 bobs=alices^m mod e = 1 if message and sign match at least all test i calculated LOL now bob cant brute force alice d... or i have formula for that do its same simple LOL but u made tutorial i say dont do s=m^d mod n you give away private key. he knows all but one. you need have atleast 2 unkown number in equation to make it harder
@JarppaGuru
6 ай бұрын
26:26 bob know e n and he make c. and m=c^d mod n r we clear yet? how hard is find out d? bob know all but d. we can brute force private key so long as we get our original m=15 alice public key need hold something its e and n alice privet key have to have some number and p q. n and phi we can calculate and e is just mod inverse d so how hard brute force m=c^d mod n. if we know all but not d xD
@raspberryPi1337
Жыл бұрын
Hello, how old are you?
@heptex8989
Жыл бұрын
What kind of question is that lmfao
@zstar8397
9 ай бұрын
Hey hope you are doing alright just I wanna say that GOD loved the world so much he sent his only begotten son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD.
Пікірлер: 60