#28. RSA Algorithm - Asymmetric key cryptography |CNS|

Telegram group : t.me/joinchat/...
contact me on Gmail at [e-mail]
contact me on Instagram at : / shraavya_katkuri
Thank you for 1000 subscribers video: about me • THANK YOU FOR 1000 SUB...
Design Patterns Playlist: • #1 Introduction to Des...
Infosys Recruitment 2021: • INFOSYS 2021 RECRUITME...
Cloud Computing Playlist: • Cloud Storage from LAN...
Mobile Computing Playlist: • #1 Introduction to Mob...
Data Warehouse & Data Mining Playlist: • #1. Introduction To Da...
All Placement related videos : • TCS NQT JANUARY 2021 I...
Cryptography & Network Security: • #1 Introduction & Need...
Managerial / Business Economics & Financial Analysis: • #35 Double Entry Book ...
Operating Systems Playlist : • #1 Introduction and ob...
Aptitude Playlist : • #1 Time & work part-1
Grade 10 math chapter-6 (TRIANGLES): • #15 Triangles- Introdu...
Grade 8 science chapter-4 (Metals & Non-Metals): • #17 Displacement React...
Grade 10 math chapter -8 (Introduction to Trigonometry): • #12 Introduction To Tr...
Grade 8 science chapter-11 (Force & Pressure): • #12 Force and pressure...
Grade 8 math (NCERT): • #1 Introduction to rat...
Grade 10 Math(NCERT): • #1 Real number definit...
Grade 8 Science (NCERT): • #1 Crop Production and...

[@varshar7483]

Thanks a lottttttttt 🙏🙏 You have taught so much in exam point of view ,, I have learned everything from you and wrote the exam thanks a lottttttttt

[@sathish9042]

Your explanations are better than guides and notes .Thank you so much mam.

[@kunalsoni7681]

your notes are very clear and easy to understand. And the way you teach is fabulous ☺️💯💫

[@spkumar.17]

Its osm😁😁😁
Thanks for helping 🙂🙂

[@TroubleFreevideos]

You’re welcome

[@diwakar2501]

4:38 ed/mod pie(n)=1 this is how it should be right

[@RahulLour]

we know that 1 mod(n) = 1/1 mod(n) OR 1 mod(n)=(1 mod(n))^-1 == 1 , thus ed= 1 mod pi(n) OR ed = 1/1 mod pi(n) , as a result ed mod pi(n) = 1

[@ananthan7355]

bro just consider e^-1(fi(n)) as an entity and move it to the other side , that was a mistake from the video

[@ayushiumbarkar3068]

Your way of explaining is too good
Thanks a lot

[@eduatm5222]

Madam, thanks a lot for ur kind clear explanation.....AthmaRam

[@gauravsharma5584]

Best video i watched so far for this topic. Thank you

[@rishidiwute3604]

kudos ! wrapped under some minutes ! also M is not number of digits Its is decimal representation of string message. (Cryptography and NS by w stalling)

[@roshithborra4713]

very nice explanation and it's very easy to understand for only single time.......

[@AjayYadav-dv2vs]

That is awesome series of Cryptography thank you

[@KarthiKeyan-rf6bc]

You are taking so clear

[@Krishna-z1g5r]

Superb Explaination 🔥🔥🔥

[@abressiddique2800]

thank you for such an amazing lecture ...

[@LEONIETCHAMABE]

very explicit thanks

[@_AkeelAhmad_wani]

ohh maam what a cool way of explaining

[@vajidkhan1131]

Time complexity and space complexity of RSA algorithm, where this algorithm is used

[@vikaskadimani2158]

hlo mam u have explained the things so easily and it was very helpfull to me mam and so for that thank you mam.

[@TroubleFreevideos]

Most welcome 😊

[@jashu2426]

Your explanation way is very good to understand 🎉

[@ashwinunnikrishnan6689]

great video

[@surajr4757]

1:50, those two numbers must be prime numbers

[@rapture_05_14]

Nice explanation

[@NithiDeepa]

good explanation

[@Asgardian32-m2y]

Thank you...well defined class lecture with simple communication

[@maazaslam7455]

The calculation for 'd' doesen't work if we have large values for n, and phi of n, As it just becomes a Brute Forcing by counting each mod upto idk a thousand before until we get the correct value of 'n' Thats basically what my instructor replied with

[@ANILKUMAR-yw7zw]

Wow so easily u explained 👏👏👍

[@darsanan4017]

Nizz ✨️

[@sherlyj282]

Excellently teaching mam and like ur flow of speaking and understood very well mam thank you very much

[@HarshaSN]

Thank you it's very clear

[@zeeshanhaider3953]

Tanks a lot ma'am
U clear all my doubts 🥰🥰

[@placementpreparationformnc2408]

Love you for your explanation ❤️😇😘

[@placementpreparationformnc2408]

Hmmm

[@lakshmanikkurthi567]

Simple and easy ❤

[@syamalas9199]

Thaks a lot sister u helped me a lot for exam .
Tqsm ❤️u

[@akhil__1998]

ed=mod pie(n)
edmod pie(n)=1
?

[@akhil__1998]

?

[@Fs99al]

Extended Euclidean algorithm

[@rockstargameing7165]

❤❤ thank you so much

[@chethanskolur6760]

Super mam

[@premsagarvangara759]

Thank you ma'am 👍

[@yashpatil3006]

Thankyou so much ma'am. All my doubts are getting cleared a day before exam :)

[@mohammadamanalimyzada1462]

p and q are large primes for better security

[@MADMAXI143]

thanks a lot mam

[@devangmathur5809]

We have to take 2 prime numbers in the starting.

[@Bajrang9033]

Tank you mam for your good explanation

[@tanvipandya3353]

Ma'am, lectures are so nice. Please guide how can I get these notes?

[@VISHALSINGH-ur6rl]

Thanks a lot
your way of explaining is too good
Thanks a lot

[@bhavyakasa8231]

Tquuu mam

[@akshayhegde6886]

thank u mam,that's so helpfull

[@nagurshariefshaik6606]

I love your voice mam ❤❤

[@Issac-s2o]

Why take the value gcd(e) = 7 or you can take any number....?

[@riddhishukla5465]

don't understand at the time 4:25 .. plz tell me in deep

[@albatrosshanging]

how did you calculate the huge cipher text value on a calculator and how did you do mod and all that stuff?

[@AmmaraIqbal-y9e]

For mod if u are do example 7mod3
First do 7/3=2.33333..
Then do 2.333-2=0.33333..
Then multiply it with the rhs i.e 3
You will get 1
Do the same for your problem

[@albatrosshanging]

@AmmaraIqbal-y9e thanks I actually figured this out on my and my exam's already done.
Thanks anyway ❤

[@physicsbullet5129]

Any tricks there ..to find d value faster

[@keerthanakumar.k3739]

d=(∅n + 1)/e
We can easily find

[@keerthanakumar.k3739]

Hi

[@adityaky5427]

How you taken Ed=1modΦ(n) as Ed modΦ(n)=1

[@raomubashir3976]

how?

[@VijayKumar-hn2hx]

@@raomubashir3976 actually the formula is edmod(n)=1,she took wrong in video

[@raomubashir3976]

@@VijayKumar-hn2hx right but now it's too late to talk about this , cuz i gave its paper yesterday 😅

[@VijayKumar-hn2hx]

@@raomubashir3976 🤣ok

[@amigosters6381]

Ed=1modn means edmodn=1
That is ed divides by n then get remainder is one

[@sujalbalar316]

Killer 🔥

[@onlylyrics28]

super akka nuvvu

[@divyaanshuagrawal3383]

Thanks mam!

[@bibekdevkota2281]

thank you so much sister

[@novicecoder5753]

Explanation is good but there is no theory about the concept in video please include it in future videos

[@nirmalabigimalla3]

mam as you said in previous videos block cipher is symetric but here you said RSA is block cipher so it must be symetric but why RSA is asymetric

[@sauceontoes3457]

3:42 gcd of 20 and 6 is 2 so you can't take 6

[@bhargavkumar5189]

What is gcd bro

[@sauceontoes3457]

@bhargavkumar5189 greatest common divisor

[@anupriya5861]

How do we calculate 31 power 7 mod 33? Plz help me

[@KarthikKosuri-vw2mg]

How to know gcd value?

[@shubhampatel3494]

how did she get c=4

[@bodapatibalamuralikrishna8814]

Super madam

[@ram-dg2or]

Thanks for your explanation
Could you please explain how to implement it practically

[@vikram0411]

thanks for helping us sis...it's very useful for us..

[@burugukrishnamurthy4832]

Hi madam. I have watched yours FLAT subject videos. I have passed that subject.

[@kittuthegreat1819]

can you tell me what are the key distribution approaches for method authentication in cyber security ? i have exam.. is it the same you are explaining ? symmetric and asymmetric any other approches?

[@rithikasunkara9074]

Is that prime large number or only large number youu have not given clarity mam can u tell

[@aswinmanmathans6837]

P and Q should be prime ..pin

[@NaveenReddy-zk7of]

Who will say what is GCd means ?

[@abhijitnayak.8733]

Very much useful. 🥲

[@janardhanreddyboyalla2941]

why edmod(fi(n))=1?

[@archanak.h9111]

Tq so much mam

[@kahanx10]

You saved me a day!

[@lehaswinipalla3365]

thankss :)

[@muhammedans6096]

U first wrote d=e^-1modphy(n)
But by sub e=-1
Phy(n)=20
We get d =140

[@AbhinandBhavan]

Should p and q be prime or co prime or not?

[@CSSakthivelm]

prime

[@ashutoshpathak1387]

GCD of 2 numbers = 1 means they are co-prime. GCD OF 20 AND 6 is not 1. Greatest common divider of 20 and 6 is 2. .... you said we can use 6, coz 6 is not a factor of 20. You are confusing factor with GCD. LOL 3:40 "YOU CANNOT TAKE 4 correct, coz gcd of 4 and 20 is 4, you cannot take 5 correct coz gcd of 5 and 20 is 5, you can take 6 LMAO, NO YOU CAN'T TAKE 6, coz although GCD OF 6 AND 20 IS NOT 6 (like 4 and 5 prev), it still is 2, AND 2 IS NOT EQUAL TO 1.

[@keshavgupta2647]

how do we assume m in this case?
by hit and trial?
won't it take a lot of time and calculations?

[@yashkalia2311]

Any value works which satisfies the condition

[@albertpraveenr1132]

you forget to tell that two large values should be prime or not ?

[@yoyo_corona_gaming4658]

can u tell how to calculate mod in calc

[@prajwalbhasme5317]

How to calculate GCD?

[@universeiswithyou]

Thanks a Lot

[@Raistar_172]

Can we choose m=2 ,In encryption ?

[@travelingnomad8873]

how to do MITM in cryptool ???.. please make video on it!!.?

[@jagadeesh8114]

Thank you 😊

[@siddhu8558]

4:24 how did mod⌀(n) come to LHS?

[@aryansinvasion]

same question

[@shashi_speaks]

u need to explain how to do calculator, like us we don't know how to do in calculator

[@sruthim2542]

What is gcd here?

[@MUTHURAJPECETEC]

Thank you mam

[@ashokkumarkaruthaiamperuma6761]

whether the value of encryption and decryption can be same

[@tadelasanthoshi9037]

If we take any values of the M value the answer will be same ....... If not same the answer will be wrong....

[@mohammedfouzan4798]

Your explanation of algorithm is good!. But, the question every learner should ask is how is decryption key sent over the internet to the receiver so that he can decrypt and read the message ? All i say is just don't blindly understand the algorithm without knowing the use of it.

[@KQACSaleem]

Tq mam 🎉

[@harivardhanv278]

whether it is prime or not explain??

[@ffstories1m801]

Yes, prime

[@mrx4256]

Thanku ma'am ♥️

[@growthwithVestige]

❤

[@abrarbardolia169]

Thanks you ma'am

[@Ajayrathnam_P]

We have tomorrow exam
I watched all your algorithm video
But for me it’s hard to remember which steps will come for which algorithm
RSA and Elgamal have same 3 steps
So it’s just collapsing
Can you upload a one last video
How to memorise and keep in mind for FOR THESE ALGORITHM

[@Ajayrathnam_P]

Upload soon mam waiting for your VIDEO

[@ankank1886]

How I calculate modular in calculator