RSA Algorithm in Cryptography and Network Security

RSA Algorithm In Cryptography and Network Security
#RSA #RSAalgorithm #NetworkSecurity #Cryptography
Courses on my Website ( Huge discounts)
www.abhisheksh...
This is the series of Cryptography and Network Security.
In this video, i have explained the concept of RSA ALGORITHM in Cryptography and Network Security.
#AbhishekDit
what is RSA algorithm in Cryptography
RSA ALGORITHM in hindi
RSA encryption algorithm
RSA ALGORITHM in Cryptography and network security
Euler's Toitient function :
• Euler's Toitient Funct...
If you learned something new do like and share this video with your friends and don't forget to subscribe to my channel :)
There are lectures related to different subjects on this channel.Do check them out, guys.
Link is given below:
Placement series:
• Interview process deta...
computer graphics:
• Computer Graphics
engineering economics:
• Engineering Economics
Cryptography :
• Playfair Cipher Algorithm
.Net C# :
• .NET C#
Pointers in C :
• Pointers in C Introduc...
Linked List for Interviews :
• Introduction to Linked...
Java Tricky videos/programs for interviews :
• Java Labelled For Loop...
File Handling in C :
• Reading the contents o...
pointers playlist:
• Pointers in C
C Programming tips and tricks:
• C tricky programs/videos
Abhishek VLOGS :
• #VLOG-1 Riding through...
Concerts :
• Khushboo Grewal concer...

[@senoritalucky1758]

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👍

[@billionairediarie]

14/100 🐈

[@ayushraghuwanshi2953]

@@billionairediarie 1 unit 14 ka aata hai bhai

[@aditi466]

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❤🤙😃

[@AbhishekSharmaDit]

Welcome 😊✌️

[@a.d.7888]

Bhai coding mat le, bohot tough hai

[@mridulthakur2829]

me also bro

[@aesthetic_vibes_404]

I m just 10 year old n m loving coding

[@vantal4115]

I Am just born now and love coding

[@shrutiyadav9567]

Bahut bahut dhanyawad guruji🙏❤️😇 really appreciating job done by u😇

[@ruchithakur4381]

This helps me during my exam.Thank you so much❤️

[@priyabratadas2392]

Thank you, watching this a night before exam and its very helpful 🔥

[@prakharmamgain5825]

no other channel could explain better than you 🙏

[@abcdxx1059]

This content is on par with one of the best videos available on this topic nice work

[@mr.gouravkale]

Thanos chup baithh jyada mat bol 😡

[@peace-jw4eh]

Engg lelo beta apne ap sab gayab hogaa so called interest😂😂😂😂

[@mmijoe1540]

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 🎉🥳😊👏

[@vloggerneetu99]

Thank you so much sir for this
Aap bahut acha pdate ho...
Sb smz mai aajata h 🥰🥰🥰🥰

[@purnimamahato4447]

best playlist of cryptography 🙏 , thank you soo much sir

[@sanaraja4479]

sir apki wja se mjy netwrk security subj aya hai thnku so much sir ...love from pakistan 💜

[@niha400]

Thankyou so much this is very useful for me today is my exam and it is easy to understand 👌👌

[@sachinrathod7990]

excellent explaination each and every point
thanks sir

[@hadimalik5060]

My Sir watches your videos. Big fan

[@pprajeethshetty3815]

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.

[@user-tj8kf7nv9w]

Anna tumba dhanyawadagalu ...thanks a lot💯🔥

[@shubhamraj5853]

Mauj kar di bhai...
Awesome explanation 🔥🔥🔥

[@jayatimaji6556]

Thank you so much @Abhishek Sharma

[@shaheenyt8213]

Sir you are amazing I watch last Saturday your. Lecture about Des it's very helpful for us Amazing ❤

[@vishalsnsingh]

for finding d=1+k(phi)/e where k=0,1,2,... and d is not in decimal point.

[@surendragupta1659]

Kaphi Acha explain Kar raha hai bro, keep going

[@rohitkandula8493]

Brooo...😉😉💕💕,Thank u so much u helped me in Exam

[@111_mansidwivedi5]

bestt video sir thanku i m a bca student

[@singhashmeet]

when abishek is here why fear thanks abhishek i am doing this before the day of my
exam

[@arthifrox]

i dnt understood single word of hindi but I understood your concept perfectly.. thank you

[@abdullahmohibahmed0673]

Amazing explain appreciated 😊

[@lakshaytaneja8013]

Good explanation and also given pre requisite in description 💯

[@dollydewangan8964]

Very good explanation sir thank you so much it's very helpful for me sir thanks again 🙏

[@mallesham2003]

nice explanation of RSA algorithm bro

[@pritychowdhury6222]

Your video's are so much helpful .. great job

[@RahulSalunkheShivaSanskar]

Can u help me with one question?
1. What mathematics courses or topics do I need to learn to understand the alogrithm

[@amreshgupta8186]

How to solve 31^7mod33

[@rashmisinha7228]

Thank you sir.. Your videos are very helpful for me..Keep it up🙏🙏

[@monikamathur7561]

Thanks a lot sir this video really helpful to understand the concept

[@lalankarna8253]

best explanation with super flow...thanks alot

[@himanshisharma9087]

Really appreciable work done by you🙌👏

[@AdarshSingh-sv7br]

AKTU student👩‍🎓

[@pr47hmesh]

Thanks

[@Earningmaster2024]

I also Love to make things simple ❤💯

[@sumantrkurse1518]

How do you solve 31^7 mod 33??

[@rajivsharma1008]

It's easy bro 31 is congruent to -2 mod 33

[@khadijairam1239]

Very good channel for better understanding

[@aishwaryakhare504]

Thankuu so much sir, for explaining this topic in a simple manner.🙏🙏

[@tanishqsharma3990]

Bhai you are a legend❤❤❤❤❤

[@thecueclub2306]

nice video :)

[@dnamathematics2934]

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

[@balajisingh9661]

yes

[@sarthakmehrishi7687]

brother can you please explain TCP IP in the similar way , BTW your explanation is great and useful to learn hacking apart from schooling in free time.

[@nishantmishra1657]

Great presentation of Concepts.

[@rohan8758]

@3:30, please explain it in detail--> ed MOD phi(n) = 1

[@elearning7819]

Thanks alot man. You are a life saver!

[@TusharKumar-iu4nt]

Video toh badhiya banaai hai... Keep it up

[@devanshurawat2455]

Ye to understand h, ye to too good h 😃

[@vahadullarocky197]

Bhai tumara help kabhi nahi bhisareyga today my exam wrote well it is u r pleasure bhai ❤️❤️

[@vanithavanitha-eo3cr]

Excellent explanation thanks sir...

[@kahkeshanalam1723]

Great sir👍

[@shashankshekharsingh9336]

very great and clear explanation thank you bhai

[@payaladhikary4845]

we can also use e=3 as hcf of (20,3) is also 1?

[@Pratik-tk6ts]

yes

[@hottopic3430]

Bhai thxxx , bhot acha explain kiya ❤❤❤

[@believer23335]

Thank you so much❤😊👍

[@ansarisaami5196]

Thanks man

[@abyjoy4843]

u r way better than my teacher

[@HabibUllahqamar]

This is best video for rsa.

[@devoshimandal2193]

Very nice and clear explanation 👍

[@zaraskitchen6802]

From where you take 33 in public and private key?

[@shajilabeegam1920]

Very Informative class. Very easy to understand

[@jaswantkhatri8211]

Thanks sir ❤

[@imaansarwar2314]

brother 4th step me e ki value 7 kesy le hai ? koi aur value le ksty hain agr me 3 ln tw 3 ( 20 se choti hai aur 1 se bare ) aur gcd (3,20)=1 bhi hai tw 7 kesy le hai?

[@yutaitadori7318]

U the best ❤️🙌🙌🙌🙌🙌

[@salman_tech5289]

Thank you so much

[@Loop911]

Very good yar 👌🏻

[@rahulraj94391]

Amazing explanation .... ❤❤❤

[@vibhavsharma2724]

Perfect explanation. Thank u sir

[@goosebumpslol7049]

Very helpful brother 👌👏👏👏❤

[@Muhammad_Kabil]

very nice explanation bro.

[@bhaveshthakor5389]

superb video

[@muskie1523]

Bahut badhiya explanation.

[@mathwithlogics7670]

Your methods is so easy and very helpful for me.but to find inverse is not good method.i can share you another method so that ur vedio become more effective for others.its a general method.if u r interested

[@shivampatel8850]

You explained it in very present and easy manner I like it.

[@shivangikushwaha941]

Thank u so much sir ... Your video is Very helpful for me...

[@rashidsalam7926]

Good better best

[@maheiramkhan]

Badhiya explaination!

[@soundeffectsvip2387]

Doubt :- encryption M(e) mod n and public key is (e,n) - (3,33 ) then how you take value of (e) 31 becoz ydi mujhe kisi ki public key se encryption krna ho to mujhe to sirf uski public me jo diya he usi se krna pdegi ...usne public key kese banayi kesi ko thodi pata rhegi

[@AliAhmad-ju1uj]

good explanation

[@ecstatic6133]

Thank u Sir..
Well explained👏👏
🇵🇰

[@seharsarfraz1532]

Sir Elgamal algorithm k lecture bh upload kr den as soon as possible

[@karankapkoti]

Very good explanation !

[@surajmishra387]

need to bypaas some encyption without knowing private key is that possible?

[@satwikakookutla1059]

In RSA if the given plaintext is "hi" then what should we use while doing encryption in the place of M (plaintext). Please say me the process as soon as possible

[@punitkhatri8119]

We can only take integers as the input.

[@surajitpatar2185]

Write H=8 and I= 9 and in place of M place 89

[@tia_____1891]

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?

[@shreyapurwar6848]

Good explanation...

[@dollydewangan8964]

thank you sir its very helpful 🙏

[@namanchaudhary5837]

aag laga di sir aag

[@rimsharaza4487]

Thank you sir

[@SoulFrmTitanic]

Why can’t we select e=3 ?
Please someone answer bhai 🙏🏻

[@shashichandanabs4483]

Same doubt 😒😒
If u know the answer please explain me
I have my exam in 2 days plzz...🥺

[@0xAbhii]

'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??

[@bhaskarmishra1394]

For those who are confused why he has taken e as 7, and not other numbers which can make co-prime pair. So answer is simple, we have to ASSUME 'e' not CALCULATE, following the conditions that e should be greater than 1 and less than phi(n) & that the gcd of phi(n) and e should be 1.
So we can choose e as any of the numbers which can make coprime pair with phi(n), like 3, 7, etc.
Hope it helps....

[@RishitaMukherjee-ul7iz]

So you studying 😂

[@bhaskarmishra1394]

@@RishitaMukherjee-ul7iz it's not me 🫣😂

[@themanshagupta]

thank u bro u r b etter than person who explained video

[@bhagatalisha]

@@themanshagupta usne bhi vohi bola jo abhishek ne👀

[@shubhamchawda1203]

I'm studying MCA,
I have paper of information and network security on tomorrow
So can you help me during exam

[@circastic2860]

sir since we know that 'e' and 'n' are known globally and we calculated 'd' from 'e' then how can it be a private key.(if e is known then d can also be calculated)

[@neilpatel3323]

my dear friend thats why we have to calculate fi(n) = (p-1)(q-1) and p,q are anything , brute force didn't work.

[@ng3w462]

Amazingly explained THanks a lot !!!

[@rishabhkaushik9510]

Can you share the link of the next video where you calculated d using extended euclidean algorithm

[@mariyamamreen439]

Thsnkuu so much 💞💞💞sir Auesome lecture

[@PiyushMaurya007]

Well explained, thanks a lot!!