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

Поділитися
Вставка
  • Опубліковано 5 гру 2024

КОМЕНТАРІ • 197

  • @sathish9042
    @sathish9042 Рік тому +25

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

  • @varshar7483
    @varshar7483 2 роки тому +50

    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

  • @kunalsoni7681
    @kunalsoni7681 Рік тому +10

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

  • @diwakar2501
    @diwakar2501 2 роки тому +28

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

    • @RahulLour
      @RahulLour Рік тому +4

      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
      @ananthan7355 Рік тому +5

      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
    @ayushiumbarkar3068 Рік тому +5

    Your way of explaining is too good
    Thanks a lot

  • @rishidiwute3604
    @rishidiwute3604 Рік тому +6

    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
    @roshithborra4713 6 місяців тому +4

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

  • @eduatm5222
    @eduatm5222 Рік тому +2

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

  • @AjayYadav-dv2vs
    @AjayYadav-dv2vs 2 роки тому +7

    That is awesome series of Cryptography thank you

  • @spkumar.17
    @spkumar.17 2 роки тому +9

    Its osm😁😁😁
    Thanks for helping 🙂🙂

  • @sherlyj282
    @sherlyj282 Рік тому +4

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

  • @gauravsharma5584
    @gauravsharma5584 11 місяців тому

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

  • @maazaslam7455
    @maazaslam7455 5 місяців тому +1

    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

  • @surajr4757
    @surajr4757 Рік тому +5

    1:50, those two numbers must be prime numbers

  • @vajidkhan1131
    @vajidkhan1131 8 місяців тому +1

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

  • @vikaskadimani2158
    @vikaskadimani2158 10 місяців тому

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

  • @Asgardian32-m2y
    @Asgardian32-m2y 7 місяців тому

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

  • @adityaky5427
    @adityaky5427 Рік тому +71

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

    • @raomubashir3976
      @raomubashir3976 11 місяців тому +2

      how?

    • @VijayKumar-hn2hx
      @VijayKumar-hn2hx 11 місяців тому +11

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

    • @raomubashir3976
      @raomubashir3976 11 місяців тому +12

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

    • @VijayKumar-hn2hx
      @VijayKumar-hn2hx 11 місяців тому +1

      @@raomubashir3976 🤣ok

    • @amigosters6381
      @amigosters6381 11 місяців тому +2

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

  • @yashpatil3006
    @yashpatil3006 2 роки тому +5

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

  • @LEONIETCHAMABE
    @LEONIETCHAMABE 2 дні тому

    very explicit thanks

  • @sauceontoes3457
    @sauceontoes3457 26 днів тому

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

  • @placementpreparationformnc2408
    @placementpreparationformnc2408 2 роки тому +4

    Love you for your explanation ❤️😇😘

  • @jashu2426
    @jashu2426 11 місяців тому

    Your explanation way is very good to understand 🎉

  • @mohammadamanalimyzada1462
    @mohammadamanalimyzada1462 2 роки тому +2

    p and q are large primes for better security

  • @tanvipandya3353
    @tanvipandya3353 Рік тому +6

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

  • @devangmathur5809
    @devangmathur5809 2 роки тому +2

    We have to take 2 prime numbers in the starting.

  • @KarthiKeyan-rf6bc
    @KarthiKeyan-rf6bc 8 місяців тому

    You are taking so clear

  • @syamalas9199
    @syamalas9199 2 роки тому

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

  • @_AkeelAhmad_wani
    @_AkeelAhmad_wani Рік тому

    ohh maam what a cool way of explaining

  • @zeeshanhaider3953
    @zeeshanhaider3953 Рік тому +1

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

  • @ram-dg2or
    @ram-dg2or Рік тому +1

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

  • @akhil__1998
    @akhil__1998 2 роки тому +11

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

  • @muhammedans6096
    @muhammedans6096 9 днів тому

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

  • @ANILKUMAR-yw7zw
    @ANILKUMAR-yw7zw 2 роки тому

    Wow so easily u explained 👏👏👍

  • @Krishna-z1g5r
    @Krishna-z1g5r 9 місяців тому

    Superb Explaination 🔥🔥🔥

  • @VISHALSINGH-ur6rl
    @VISHALSINGH-ur6rl 2 роки тому

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

  • @HarshaSN
    @HarshaSN 11 місяців тому

    Thank you it's very clear

  • @albatrosshanging
    @albatrosshanging 24 дні тому +1

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

    • @AmmaraIqbal-y9e
      @AmmaraIqbal-y9e 20 днів тому +2

      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
      @albatrosshanging 20 днів тому +1

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

  • @mohammedfouzan4798
    @mohammedfouzan4798 Рік тому +2

    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.

  • @NithiDeepa
    @NithiDeepa 6 днів тому

    good explanation

  • @vikram0411
    @vikram0411 Рік тому

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

  • @Bajrang9033
    @Bajrang9033 2 роки тому

    Tank you mam for your good explanation

  • @nagurshariefshaik6606
    @nagurshariefshaik6606 29 днів тому

    I love your voice mam ❤❤

  • @tadelasanthoshi9037
    @tadelasanthoshi9037 2 роки тому

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

  • @burugukrishnamurthy4832
    @burugukrishnamurthy4832 Рік тому

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

  • @kittuthegreat1819
    @kittuthegreat1819 8 місяців тому

    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?

  • @VENOM-yt3ft
    @VENOM-yt3ft 2 роки тому +1

    Add Chinese remainder theorem in the cns playlists

  • @riddhishukla5465
    @riddhishukla5465 2 роки тому +1

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

  • @youtuber9571
    @youtuber9571 Рік тому +2

    Can you please explain elliptic curve cryptography

  • @novicecoder5753
    @novicecoder5753 2 роки тому +2

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

  • @keshavgupta2647
    @keshavgupta2647 2 роки тому +5

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

    • @yashkalia2311
      @yashkalia2311 Рік тому

      Any value works which satisfies the condition

  • @rockstargameing7165
    @rockstargameing7165 26 днів тому

    ❤❤ thank you so much

  • @rapture_05_14
    @rapture_05_14 8 місяців тому

    Nice explanation

  • @siddhu8558
    @siddhu8558 2 роки тому +2

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

  • @lakshmanikkurthi567
    @lakshmanikkurthi567 Рік тому

    Simple and easy ❤

  • @travelingnomad8873
    @travelingnomad8873 Рік тому

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

  • @ashwinunnikrishnan6689
    @ashwinunnikrishnan6689 5 місяців тому

    great video

  • @physicsbullet5129
    @physicsbullet5129 13 днів тому +1

    Any tricks there ..to find d value faster

  • @tsreenutsreenu1543
    @tsreenutsreenu1543 Рік тому +1

    Your explanation is super mam🫂🫂🫂

  • @AbhinandBhavan
    @AbhinandBhavan 2 роки тому +5

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

  • @akshayhegde6886
    @akshayhegde6886 Рік тому

    thank u mam,that's so helpfull

  • @premsagarvangara759
    @premsagarvangara759 Рік тому

    Thank you ma'am 👍

  • @nirmalabigimalla3
    @nirmalabigimalla3 10 місяців тому

    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

  • @bibekdevkota2281
    @bibekdevkota2281 11 місяців тому

    thank you so much sister

  • @Ajayrathnam_P
    @Ajayrathnam_P 10 місяців тому

    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
      @Ajayrathnam_P 10 місяців тому

      Upload soon mam waiting for your VIDEO

  • @Noobgamer-jd1sb
    @Noobgamer-jd1sb Рік тому

    Please note. Private key in RSA is only d not d, n

  • @onestepawarenesshummanity6360
    @onestepawarenesshummanity6360 Рік тому +2

    How to calculate 31 power 7mod 33 c=4 ?please suggest me

  • @prathamgupta6973
    @prathamgupta6973 Рік тому

    It is large prime numbers in the beginning of the video.

  • @shashi_speaks
    @shashi_speaks Рік тому

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

  • @kistareddy5361
    @kistareddy5361 2 роки тому +1

    thanks a lot mam

  • @sowjanyachapala3971
    @sowjanyachapala3971 2 роки тому

    Can u please share the vedio of fermats & Euler's theorem in CNS by tomorrow

  • @darsanan4017
    @darsanan4017 Рік тому

    Nizz ✨️

  • @janardhanreddyboyalla2941
    @janardhanreddyboyalla2941 2 роки тому +2

    why edmod(fi(n))=1?

  • @ashutoshpathak1387
    @ashutoshpathak1387 2 роки тому +2

    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.

  • @akashmaurya5342
    @akashmaurya5342 2 роки тому

    agar yeh que 29 ka aata h or isme encryption or decryption galat ho baaki D tak shi to kitne number milege?

  • @bhavyakasa8231
    @bhavyakasa8231 2 роки тому +1

    Tquuu mam

  • @anupriya5861
    @anupriya5861 4 місяці тому

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

  • @prajwalbhasme5317
    @prajwalbhasme5317 Рік тому +1

    How to calculate GCD?

  • @sireeshaBirusu
    @sireeshaBirusu 11 місяців тому

    full stack development jntua syllabus wise vedios share cheyandi మమ,

  • @Raistar_172
    @Raistar_172 Рік тому

    Can we choose m=2 ,In encryption ?

  • @harivardhanv278
    @harivardhanv278 2 роки тому +1

    whether it is prime or not explain??

  • @RSM_15
    @RSM_15 3 роки тому +1

    Plz complete the playlist soon

  • @kanjo1028s
    @kanjo1028s 8 місяців тому

    super akka nuvvu

  • @rithikasunkara9074
    @rithikasunkara9074 Рік тому

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

  • @chethanskolur6760
    @chethanskolur6760 2 роки тому

    Super mam

  • @ashokkumarkaruthaiamperuma6761
    @ashokkumarkaruthaiamperuma6761 2 роки тому

    whether the value of encryption and decryption can be same

  • @shubhampatel3494
    @shubhampatel3494 2 роки тому +2

    how did she get c=4

  • @aswinmanmathans6837
    @aswinmanmathans6837 7 місяців тому +2

    P and Q should be prime ..pin

  • @aishwaryamahesh4308
    @aishwaryamahesh4308 Рік тому

    can you make a video how to slove large power number in scienctific calculator like 234^2345

    • @core_cse
      @core_cse Рік тому +1

      i think it is not possible to solve using scientific calculator

  • @kahanx10
    @kahanx10 2 роки тому

    You saved me a day!

  • @romeogurung1556
    @romeogurung1556 2 роки тому

    encrypt the word "retaliate" and then decrypt it madam

  • @divyaanshuagrawal3383
    @divyaanshuagrawal3383 Рік тому

    Thanks mam!

  • @KQACSaleem
    @KQACSaleem Рік тому

    Tq mam 🎉

  • @-vinaykumarAelugandula
    @-vinaykumarAelugandula 2 роки тому

    Mam you have take the E value as 7, but we can take any value I. e which should be lies between 1-20 I mean 8,9,6,5... Is it correct?

    • @CSSakthivelm
      @CSSakthivelm 2 роки тому +1

      gcd should be 1 between e and 20(pi)n)

  • @CS_Student_raj
    @CS_Student_raj Рік тому

    I think all are using same example only
    What is trick for taking e value medam

  • @lehaswinipalla3365
    @lehaswinipalla3365 8 місяців тому

    thankss :)

  • @rohityt9714
    @rohityt9714 11 місяців тому

    actually d is congurent not equal

  • @jagadeesh8114
    @jagadeesh8114 2 роки тому

    Thank you 😊

  • @simple1-st7pc
    @simple1-st7pc Рік тому

    TQ 😁

  • @varshavarsha1466
    @varshavarsha1466 2 роки тому

    thank you soooooooo much......