Thank you so much for your explanation...really means a lot.... because of this vedio I got 14 marks in my semester exam....thank you so much.... worth watching it👍
i m 15 and i am super crazy about coding...ethical hacking etc....but other videos on youtube are super complicated for me to understand...but thank you so much brother for making videos too easy to understand❤🤙😃
thank you for teaching so well. I had understood it but today no numericals were there in the paper except for Miller-Rabin. No CRT, extended euclidean, nothing.
sir in topic ki bhi video bna dyein plz malware ips and ids firewall database security risk mangnment sir apki wjha s mry mid k marks achy ayein hain sir ap isi week m yeh video bna dy plz m apni friend sb ko apkaa channel share kia hua hai hmy bhut fada hota h ap bhut acha smjhaty hai
'e' ki value ke liye zaruri hai.. ki highest cofactor lena hai?? ya fir koi bhi co factor le saktehai??.... like 4:59 yaha pe 7 ki jagah 9 le sakte hai kya??
Thank U so much bhaiya. Ek question hai encryptex text ka koi constraint hai kya... Jaise encryptex text p and Q dono se chota hona chahiye ya waisa kuch?
Thank you so much for your explanation...really means a lot.... because of this vedio I got 14 marks in my semester exam....thank you so much.... worth watching it👍
14/100 🐈
@@billionairediarie 1 unit 14 ka aata hai bhai
@@billionairediarie 16/20
This helps me during my exam.Thank you so much❤️
sir apki wja se mjy netwrk security subj aya hai thnku so much sir ...love from pakistan 💜
My Sir watches your videos. Big fan
Thank you, watching this a night before exam and its very helpful 🔥
no other channel could explain better than you 🙏
Bahut bahut dhanyawad guruji🙏❤️😇 really appreciating job done by u😇
bestt video sir thanku i m a bca student
i m 15 and i am super crazy about coding...ethical hacking etc....but other videos on youtube are super complicated for me to understand...but thank you so much brother for making videos too easy to understand❤🤙😃
Welcome 😊✌️
Bhai coding mat le, bohot tough hai
me also bro
I m just 10 year old n m loving coding
I Am just born now and love coding
Mauj kar di bhai...
Awesome explanation 🔥🔥🔥
thank you for teaching so well. I had understood it but today no numericals were there in the paper except for Miller-Rabin. No CRT, extended euclidean, nothing.
This content is on par with one of the best videos available on this topic nice work
Thanos chup baithh jyada mat bol 😡
Engg lelo beta apne ap sab gayab hogaa so called interest😂😂😂😂
Very well Explained !! 👍👍
Thank you so much sir for this
Aap bahut acha pdate ho...
Sb smz mai aajata h 🥰🥰🥰🥰
Hi bro thanks a lot because of ur video only i could understand rsa algorithm properly and i completed my diploma thanks a lot for ur help 🎉🥳😊👏
Kaphi Acha explain Kar raha hai bro, keep going
Brooo...😉😉💕💕,Thank u so much u helped me in Exam
best playlist of cryptography 🙏 , thank you soo much sir
Anna tumba dhanyawadagalu ...thanks a lot💯🔥
sir in topic ki bhi video bna dyein plz
malware
ips and ids
firewall
database security
risk mangnment
sir apki wjha s mry mid k marks achy ayein hain sir ap isi week m yeh video bna dy plz m apni friend sb ko apkaa channel share kia hua hai hmy bhut fada hota h ap bhut acha smjhaty hai
excellent explaination each and every point
thanks sir
i dnt understood single word of hindi but I understood your concept perfectly.. thank you
Thank you so much @Abhishek Sharma
when abishek is here why fear thanks abhishek i am doing this before the day of my
exam
Your video's are so much helpful .. great job
Thankyou so much this is very useful for me today is my exam and it is easy to understand 👌👌
u r way better than my teacher
Sir you are amazing I watch last Saturday your. Lecture about Des it's very helpful for us Amazing ❤
best explanation with super flow...thanks alot
I also Love to make things simple ❤💯
Video toh badhiya banaai hai... Keep it up
Bhai you are a legend❤❤❤❤❤
Ye to understand h, ye to too good h 😃
nice explanation of RSA algorithm bro
Very good channel for better understanding
Badhiya explaination!
This is best video for rsa.
Amazing explanation .... ❤❤❤
In a public-key system using RSA, you intercept the ciphertext C = 20 sent to a user, whose public key is e=13 n = 77. Calculate the plaintext M.
Bhai tumara help kabhi nahi bhisareyga today my exam wrote well it is u r pleasure bhai ❤️❤️
Very helpful brother 👌👏👏👏❤
Great presentation of Concepts.
Bahut badhiya explanation.
Thanks alot man. You are a life saver!
@3:30, please explain it in detail--> ed MOD phi(n) = 1
Amazing explain appreciated 😊
Very Informative class. Very easy to understand
Good explanation and also given pre requisite in description 💯
Really appreciable work done by you🙌👏
AKTU student👩🎓
Thanks a lot sir this video really helpful to understand the concept
Excellent explanation thanks sir...
for finding d=1+k(phi)/e where k=0,1,2,... and d is not in decimal point.
Thank you sir.. Your videos are very helpful for me..Keep it up🙏🙏
Well explained bro.. 🔥
U the best ❤️🙌🙌🙌🙌🙌
very nice explanation bro.
Video dekh ke padhne ka maza badh gya 👍
Bhai thxxx , bhot acha explain kiya ❤❤❤
Very nice and clear explanation 👍
Amazing work 💯
'e' ki value ke liye zaruri hai.. ki highest cofactor lena hai?? ya fir koi bhi co factor le saktehai??.... like 4:59 yaha pe 7 ki jagah 9 le sakte hai kya??
Very good explanation sir thank you so much it's very helpful for me sir thanks again 🙏
Thankuu so much sir, for explaining this topic in a simple manner.🙏🙏
Amazingly explained THanks a lot !!!
Very good yar 👌🏻
Lots of love❤️... I'm writing my exams watching this 🙏
Perfect explanation. Thank u sir
Great sir👍
very great and clear explanation thank you bhai
You explained it in very present and easy manner I like it.
Can u help me with one question?
1. What mathematics courses or topics do I need to learn to understand the alogrithm
Thank u Sir..
Well explained👏👏
🇵🇰
How do you solve 31^7 mod 33??
It's easy bro 31 is congruent to -2 mod 33
Thank you so much❤😊👍
Thank u so much sir ... Your video is Very helpful for me...
point to be noted--->[To find the value of e]
The value of e should not multiply of sai and not devided by sai...
nice video :)
Good explanation...
From where you take 33 in public and private key?
Thanks a lot bhiya 🙏🙏🙏
Ur the best🔥
superb video
thank you sir its very helpful 🙏
Very good explanation !
excellent. make more video like that.
Thanks sir ❤
we can also use e=3 as hcf of (20,3) is also 1?
yes
Thsnkuu so much 💞💞💞sir Auesome lecture
aag laga di sir aag
Dhanyavaad sirf aaj paas jauga m
Thank You sir!!
Let a, b, and m be integers. If m ≥ 2 and a ≡ b (mod m), then gcd(a, m) = gcd(b, m). Can u solve this by RSA
yes
well explained thanks bhaijaan
I am soldier and love codding too much ❤❤❤
Well explained, thanks a lot!!
Nice explanation
Thanks man
very well explained . jazakallah
Achcha Samjhaya Bhai.
Thank U so much bhaiya.
Ek question hai encryptex text ka koi constraint hai kya... Jaise encryptex text p and Q dono se chota hona chahiye ya waisa kuch?