See dea it totally depends on machine capablities....you can encrypt large blocks as well but its fast though increases complexity but where as if we do it integer by integer the complexity will be very low but takes lot of time as we are repeating same process again and again....so your answer is we can do both depending by chossing fixed length block size as well as character by character
thank you for the lesson, but the phones gonna die. Just like me, if i dont get my shit together, buthte phones battery is critically low, JUST like my mental health..
Sir today enaku 7th semaster CNS exam sir nethu unga vedio parthathala eniki ethe qus and ans vanthuthunga sir enaku RSA algorithm ethu varaikum PT exam la kuda padikala kashtama erukum solitu aana unga vd parthe 13 mrk solaya eduthurupen sir conform ans crt
what comes 17xd = mod (60) I can't figure it out as 1, or is it better to go with 2nd hidden layer method of (60x1)+1/17 = 3.58 is that correct then d = 3 or 4
Hi, I'm fairly new to this topic, but I figured out your problem. To calculate Φ(n), p=7, q=5 hence Φ(35) = 6*4=24 Gcd(5,24) =1 so your problem is valid. C = (m^e)%35 6^5%35 = 6 hence c is 6 M=(c^d)%35 (6^29)%35 To calculate this part, you can use browser or se this video m.ruclips.net/video/EEsUxxhy50c/видео.html You'll get the mod as 6 which is your m.
See its not just 1%20 its actually is 7*e=1mod20 so here you need to find a number which multiplied by 7 and then mod with 20 gives you 1... in that case 7*3=21 21%20=1 so 3 is answer...
see dea in this case.... 8*d=1mod20 e,fie(n) not equal to 1 which breaks the rule of e,fie(n)=1 so you can write down its not solvable ahead because it voilates above rule...
Thanks you... to find D it can be D × E mod phi(n) should be equal to 1.
Bhai bhai love u overflow bhut bdhia btaya
shukriya dea
lets say if i wanna encrypt 12 08 00 12 08 ...would you encrypt each interger or as a whole ??
See dea it totally depends on machine capablities....you can encrypt large blocks as well but its fast though increases complexity but where as if we do it integer by integer the complexity will be very low but takes lot of time as we are repeating same process again and again....so your answer is we can do both depending by chossing fixed length block size as well as character by character
You would have given the input before right?.... Like single or double digit
@@LastNightStudy1903 xcs
@@ReelyGudat okk i will try to from my further videos
Calculating A mod B
step1: res = A / B
step 2: ans = A - res * B [take result without decimal points]
Excellent explanation
Thxs a lot lot for so kind words 🙂
Thank you!
thank you for the lesson, but the phones gonna die. Just like me, if i dont get my shit together, buthte phones battery is critically low, JUST like my mental health..
Sir today enaku 7th semaster CNS exam sir nethu unga vedio parthathala eniki ethe qus and ans vanthuthunga sir enaku RSA algorithm ethu varaikum PT exam la kuda padikala kashtama erukum solitu aana unga vd parthe 13 mrk solaya eduthurupen sir conform ans crt
Tqsm sir 😊
What we have to do when we get d as fraction value
of d & e you will never get fraction value if yu get so you are somewhere wrong....if you talking about other values let me know
@@LastNightStudy1903 p=5 ,q=7 d=5 find e this q came in last year college exam plz solve asap
take floor value
If we take e=3 then answer will be wrong???? Why
Nice
Tqs bro
Gcd 1 hai ya nhi kaise smja hai yaha reply pls tomorrow I have cns paper I didn't understand that
ruclips.net/video/qQMq4DYJkn0/видео.htmlsi=IIyC1oZ8yCdp2LpV
Best of luck!
what comes 17xd = mod (60) I can't figure it out as 1, or is it better to go with 2nd hidden layer method of (60x1)+1/17 = 3.58 is that correct then d = 3 or 4
your d is 113...use the same hit and trial method taking 60...you would get[ (60*32)+1 ]/17....i hope you got your answer...
@@LastNightStudy1903 why you use 60*32? I mean why 32?
D is 53
how to find the GCD?
Thank you so much 😊
You're welcome 😊
can you do this for me?message size or m=6,e=5,n=35,d=29.what is encrypted(c) and decrypted(m) value?
Hi,
I'm fairly new to this topic, but I figured out your problem.
To calculate Φ(n), p=7, q=5 hence Φ(35) = 6*4=24
Gcd(5,24) =1 so your problem is valid.
C = (m^e)%35
6^5%35 = 6 hence c is 6
M=(c^d)%35
(6^29)%35
To calculate this part, you can use browser or se this video m.ruclips.net/video/EEsUxxhy50c/видео.html
You'll get the mod as 6 which is your m.
Please provide PDF of your notes of cns. Very urgent ya
thankkkkkkkkkkkkkkkkkk youuuuuuuuuuuuuuuuuuuuuuuuuuuuuu
amazing, thank you
Q.1. Perform encryption and decryption using RSA Algorithm for the following.
P=17; q=11; e=7; M=88.
Please solve this question
Olamba waseema
Tq sir 😊
can you please solve 5*d=1 mod 396.
answer is 317 that is d =317
@@LastNightStudy1903 pls let me know the steps
see if you do ( 396×4)+1/5 ...you would get this answer...its the hit and trial method i told in video itself..
@@LastNightStudy1903 ok thanks 👍🏼
welcome..
the name last night study is ok but each video is more then 5 mins yaar
1 mod(20)= 1 then d val becomes 3 how?
See its not just 1%20 its actually is
7*e=1mod20
so here you need to find a number which multiplied by 7 and then mod with 20 gives you 1...
in that case 7*3=21
21%20=1
so 3 is answer...
@@LastNightStudy1903 OK...now I am understood
8*d= 1 mod(20)
d=?
Tell the ans...
see dea in this case....
8*d=1mod20
e,fie(n) not equal to 1
which breaks the rule of
e,fie(n)=1
so you can write down its not solvable ahead because it voilates above rule...
Why take a small sum?
can you explain the time frame you are taking about....like at what time in video you have doubt?
Muh se gutka thuk ke bol lo bhai