Multiplicative inverse of a number in Cryptography

Extended Euclidean :
• Extended Euclidean Alg...

Пікірлер: 21

  • @MuhammadShumailNadeem
    @MuhammadShumailNadeem3 ай бұрын

    Find the multiplicative inverse of 23 module 220

  • @vinayaksharma7134
    @vinayaksharma71342 жыл бұрын

    4:40 is a v.v.v.v. imp point which was not covered on any video on youtube....Thank you very much Abhishek Sir for covering this point...!!!!!

  • @sowbaranikag6514

    @sowbaranikag6514

    8 ай бұрын

    Thankyou I didn't watch the full video ,I watched till -7 answer, but I saw ur comment and came to know! Thanks a lot!

  • @muhammadnajh6859
    @muhammadnajh68594 жыл бұрын

    great , thank you alor. what about additive inverse?

  • @yifuxero9745
    @yifuxero97458 ай бұрын

    Here's an easier way. Take 11/26 and write out the continued fraction representation, = [2, 2, 1, 3]. Underneath write the convergents = [1/2, 2/5, 2/7, 11/26]. From the rightmost denominator (26), subtract the denominator to the left (7), giving 19, the answer. This rule applies to an even number of partial quotients (we have 4). For an odd number, we just record the denominator to the left of the rightmost denominator. Say we want the multiplicative inverse of 5 mod 21. We get [4, 4, 1] and underneath our convergents are [1/4, 4/17, 5/21]. Denominator to the left of the 21 is 17, the answer since 5 * 17 = 85 = 1 mod 21; (correct).

  • @sourabhkumar6194
    @sourabhkumar61944 жыл бұрын

    make a video on linear diophantine equations thanks for the video

  • @soniverma7107
    @soniverma71073 жыл бұрын

    Thanks bhaiya best explained 😊

  • @sadiaafrose7166
    @sadiaafrose71662 жыл бұрын

    THAAAAAAAAANKS A TON!

  • @devkadia9376
    @devkadia93762 жыл бұрын

    How to calculate if the figure is 43 mod 64? Pls do let me know

  • @jahangagan5396
    @jahangagan53964 жыл бұрын

    this method works for me almost times but for-finding 33 inverse this method founds to be wrong can u please help me out?

  • @riteemaharjan4351
    @riteemaharjan43514 жыл бұрын

    You are great yar

  • @shrutichauhan287
    @shrutichauhan2877 ай бұрын

    can we get notes pdf?

  • @Legend_f_f
    @Legend_f_f Жыл бұрын

    Op teacher

  • @sreeharitanil885
    @sreeharitanil8853 жыл бұрын

    Will this method work if gcd(26,n) not equal to 1 ?? Please reply !!

  • @dr.jasvantkumar7824

    @dr.jasvantkumar7824

    3 жыл бұрын

    Multiplicative inverse exists if gcd(a, b)=1

  • @mahnoorahmed5536
    @mahnoorahmed55363 жыл бұрын

    How to calculate 26 inverse mod 11?

  • @adarshshukla2055

    @adarshshukla2055

    Жыл бұрын

    Bro have you done this question using extended euceldian method?

  • @riteemaharjan4351
    @riteemaharjan43514 жыл бұрын

    Have you made video on galois field?

  • @AbhishekSharmaDit

    @AbhishekSharmaDit

    4 жыл бұрын

    No

  • @architjindal908
    @architjindal9083 жыл бұрын

    Sir for 135 mod 61 this method is not giving the correct answer. Could you please check it out?

  • @rajatsingh3904

    @rajatsingh3904

    3 жыл бұрын

    Sir you are here also ;)