Hill Cipher - Encryption and Decryption - Step by Step - Cryptography - Cyber Security - CSE4003

[@OmarAhmed-lc3vm]

you taught me what my prof couldn't teach in his session, Thank you Sir.

[@thattmariemusic]

This was so simple to understand! It didn't take me long to figure it out, thank you.

[@awaisjabbar8304]

Thank you so much, I will never forget what you taught me today!!
Thank you so much, looking forward to more videos like this...Keep it up...

[@johnmcafee9169]

thank you so much sir i was looking for a good example until i found your amazing video

[@saiguvvala3598]

Thank you so much! Your explanation was really good, thanks a lot.

[@liliansylvester3054]

Thank you so much....I am glad....great teacher

[@rockilabs8737]

Thank you for clear explanation... Your voice is like AK...

[@SatishCJ]

Thanks and welcome

[@Routerhub]

I love you sir so much u teach me cipher topic clearly

[@PMe-my1td]

Thanks! I like your teaching.
May you please consider an example of finding a Key when you only have cipher and plaintext with a 3x3 matrix please!?

[@manojgowda7070]

Description starts at 14:44
Thank me later 😊

[@SatishCJ]

Well Thanks for the information 👍

[@liliansylvester3054]

Hehehe thank you

[@apk6089]

Clear!!

[@akashnair3881]

for plain text, can we use a 3x2 matrix which would form [{s,a},{t,i},{s,h}]

[@muazmuzaffer]

What if I get the value of K = 29 for an example. Please explain

[@erichervinn3931]

Please boss , since the last letter was not part of the plain text before encrypting are we going to keep the q at the end or remove it to get satish ?

[@SatishCJ]

Yes we should be using the additional character for decryption and discard that after decryption. Hope I was able to answer your query . 👍

[@gokulajith9958]

1 divide by det k=1 divide by 3 but u multiplied 3 directly with the adjoint matrix is it crt?

[@mohanpvs2777]

What if I get a negative determinant value while decryption ?

[@emanishfaq5004]

Same question plz explain it sir

[@suprithata2224]

Modular k if get -ve valu wt process for that

[@SlapB0X]

the formula is : -k mod n = n - (k mod n)