#30 Elgamal Cryptography Algorithm - Asymmetric key cryptography |CNS|
Вставка
- Опубліковано 9 гру 2024
- Abroad Education Channel :
/ @shraavyakatkuri4078
Company Specific HR Mock Interview :
A seasoned professional with over 18 years of experience with Product, IT Services and Agri industry of valuable experience in Human Resource Management, Extensive Experience in Talent Acquisition, Personnel Management, Compensation and Benefits, Performance Reviews, Training & Development and all facets of Human Resources will be performing mock HR Interviews and provides feedback on the session and guides with interview techniques.
contact me on gmail at : shraavyareddy810@gmail.com
follow me on instagram at : / shraavya_katkuri
Placement playlist: / @troublefreevideos
paper presentation for semester exams :
• PAPER PRESENTATION TIP...
Madam can you please make a video on elliptic curve cryptography
thank you for making such helpful videos for our exams
your videos helped me clear my exam with ease
Selecting e1 has a criteria , it should be a primitive root of selected prime number
its 7.40am now, can you make a video before 9.30am exam today?
😂😂😂😂
Yes i will
haan bhai tere lie baithi hui h wo 😂😂😂
At 7.40 u must be more focused on watching the video and learning rather than commenting😂
🙊
Very nice, explained what my prof couldn't in a 3 hour lecture
Glad to hear that
Mam last 3 assuming not understood 🥺
7:00 For finding mod inverse we can use little format thm
Btw thanks fir the videos
for anyone interested you can use extended euclid theorem for finding modular inverse
isnt 125^-1 mod 11 is 1?
no its 3
@@nitac2237
i didnt get the last mod part
please explain another way
Maam ur the best in teaching
Perfect explanation.
Sis please make a video on elliptic curve cryptography post that as soon as possible I can understand only ur videos which are simple and fast
Decryption go with public key? 5:09
Please clear my doubt
Just going in exam hall 😂
Best of luck brother
@@rudrakshsharma3847 thanks
how we are assuming everything here?
very nice explaination...vo sab to thik hai but last par cut kyu keya
Really superb 👌 and excellent presentation mam
please upload elliptic curve cryptography mam
The video is gud, it has the example well explained, but the concept is not properly conveyed, it would be more helpful if the concept and theory is also added to all the videos Thank you 🙂
Tomorrow my exam in next 8 hr 🙂
Thank you 👍
Mam..At 3:11 .. 8 mod 11=3 right? 🙄🤔
No, it's 8. Btw, 14 mod 11 is 3.
mam aj exam hai videos bhj do pls
how am i supposed to memorize all of that... :(
Last part is not clear
thank you mam provide this lecture
Thanks akkka
kaa .. enna ka kadasila ans ehh solama thank you solringe!
aama bro enakum last la puriyala odaney thanks solli mudichutaanga tomorrow exam vera 😅
thanks
hi mam kindly post how to solve large no of mod values ...ex 123^45678
Madam where do we used public key that is what we have generated in the first step for encryption..
Pls show calculating part in calci
mam can y explain one more example please. ineed little more clarity.
what you have done at last......!!!!!? i can't understand.
Do videos on Artificial Intelligence
maam aapne ed=nd me nhi btaya kese krte h ;
ecc algorithm pe bhi video banaye
our 4-1 exams on 20th of this month
our college mallareddy Institute of engineering and technology
mallareddy ettundu baa
Kastapadda ...utube vedios chusina 🥲
Mam there is no problem solving and problem solving methods topics
Mam,share a total PDFs file mam..!!
Thanks akka
Akka plz principles entrepreneurship notes 4th year akka and data mini 2unit plzz
kirak explanation maam
Thank you..
At 6:44 it is answer......
Thank you So much Madam
Can you add Rabin cryptosystem
Good explanation but speed is too fast
maam kl mera paper h , dua karo ki pass ho jaau
Hii mam can you give the notes pdf
Today afternoon is my exam😢
i had to put 0.75 velocity to keep up but thank you :)
Brain is fast
hi mam im having exam on monday i.e(19/12/23) pls tell me how to prepare
125^-1 mod 11 is 1 not 3
Air university syllabus Hash mac asymmetric plus symmetric exams date 2 of next month...
Watching before 25 mins 💀
Thanku yar
Good
❤
Assuming the exponent to be 3 is a not a clean way to do this!
Try to make a complete video without cutting in btw
It is a copy video of easy engineering class 😂
Yes
is there seal (software optimized encryption algorithm )in the playlists
Thanks for medam
tomorrow!!!!
Mam you are too good but your speed was too fast 😅
are u buying these comments because the video is incomplete still no one is telling anything about it
Exam Schedule - 17 minute mei exam hai
Exam Date:- 28/03/2022
Clg:- Silver oak university ahmdabad
Thanks 🌹you mam
Last mein achay sy explain kry
kll Hi Hai...🥲🥲🙂🙂
very vague, ambiguous
4/12/2024 NIT SILCHAR
my exam is tmrw🤣
1 ghante mein hai paper
My exam on 22 Jan vtu syllabus
Kl exam hai
Exam date 12/07/2022
Its calculating, not caliculating...
U r so cringe
at last she made wrong
you can correct it through this comment
A. EI gamal key generation:
Select a large prime number ‘p’
Select encryption key ‘e′1
to be primitive root of mod p
Select decryption key ‘d’ such that 1≤d≤p−2
Select encryption key ‘e′2
such that
e2=ed1 mod p
Form the set i,e public key (e1,e2,p)
to be announced publicly
Private Key 'd' to be kept secret.
B. EI gamal key encryption:
Select a random number ‘r’
Compute the first part of ciphertext ‘c′1,c1=er1modp
Compute the second part of ciphertext ‘c′2,c2=(er2∗PT)modp
C. EI gamal key decryption:
Calculate the PT
PT=(c2∗(cp−1−d1))modp
Example 1:
let Plaintext M = 7
e1
= 2
d = 3
Random no 'r' = 4
1. Key generation:
p=11e1=2d=3
e2=ed1 mod p=23mod11=8 mod 11=8
2. Encryption:
c1c2Random no r=4=er1 mod p=24 mod 11=16 mod 11=5=Pt∗er2 mod p=7∗84 mod 11=28672 mod11=6
3. Decryption:
PT=(c2∗(cp−1−d1)) mod p=(7∗511−1−3) mod 11=18 mod 11=7
Example 2:
let Plaintext M = 6
e1=5d=2Randomno′r′=4
1. Key generation:
P=7,e1=5 and d=2
e2=ed1 mod p=52 mod 7=25 mod 7=4
2. Encryption:
c1c2Random no r =4=er1 mod p=54mod7=625mod7=2=Pt∗er2 mod p=6∗44mod7=1536mod7=3
3. Decryption:
PT=(c2∗(cp−1−d1)) mod p=(3∗27−1−2) mod 7=48 mod 7=6
Using chatgpt 😏 showing himself has an intelligent
My exam on 22 Jan
This not helpful to me ..calculating steps you already written so you explore but we couldn't now that...your fast teaching also
...it's like poor video to me
Sorry about that, i will definitely try to improve it
You can't even understand this simple problem that much dumb you are 🤡 and if it is fast, UA-cam has an option for changing the speed of the vedio 🤡 I watched this vedio in 1.5x speed it was very simple..... 🙂
😒
Tomorrow
Today is exam ok
why are you in a so much hurry while teaching ............
Whole explanation was too excellent but the sound which u make while swallowing ur spit is too annoying and that sound is making me to distract please check it once keep ur mic some what away from the mouth
tmrw's xm...haha
today
Its calculate, not caliculate
Hi you are very cute, next time if you teach please switch on your face-cam.
Nice video BTW
kindly speak slow
Worst online teacher ever, she just can't explain anything clearly. She's just running to complete the topic asap, ending me toh kya ki khudko hi pata
anna university
anni sagam sagam cheptunav
isse bura cryptography method nahi dekha mene aaj tak
poora copied video hai
Pata h kya jab teacher koy female rahe to english bolna jarrori h kya jbki male teaher bhi english jante h fir bhi itna english use nhi karte hai kyonki unko pata h ki jo begineers rehte h unko problem hoti hai so apse requst hai ki pllss make video in hindi
Its calculation, no caliculation
its south accent
Ok Shashi Tharoor
My exam on 22 Jan vtu syllabus