Basically, cryptographic algorithm is used for transformation of plaintext into cipher text. There are basically two methods on which cryptographic algorithm is work: Block Cipher and Stream Cipher.
Stream Cipher: In stream cipher keys and algorithms are applied to each binary digit in a data stream, one bit at a time, rather than encrypting block of data. One time pad cipher is the best example of stream cipher. Cipher feedback mode is converting block cipher into stream cipher.
Block Cipher: In Block cipher, plain text message divide into fixed size blocks and encrypt each block with some fixed size of key.
In this video, I have covered basic concept and techniques of Block cipher and stream cipher. Both the techniques explain with solved example. Also explain realtime example of block and stream cipher. Pros and Cons of Block Cipher and Stream Cipher. Also discuss difference between Block Cipher and Stream Cipher.
If you like my video contents, please LIKE, COMMENT, SUBSCRIBE & SHARE with your Friends.
--------------------------------------------------------------------------------------------------------------
Check out other video on my channel
📚 Check out following video on my channel
▶️ RSA Algorithm (Cryptosystem): https://youtu.be/3KnX3ktE1C8
▶️ Elgamal Cryptography Algorithm: https://youtu.be/veo_przko-s
▶️ Diffie Hellman Key Exchange Algorithm: https://youtu.be/fmoVUfZvZe4
▶️ Chinese Remainder Theorem: https://youtu.be/ICYJV6WxRhQ
▶️ Modular Exponentiation (Square & Multiply Algorithm): https://youtu.be/4TgSWSvjGtE
▶️ Modular Exponentiation (Binary Method): https://youtu.be/B2IFnEbIHqo
▶️ Euler's Theorem: https://youtu.be/5LDapYQjbPU
▶️ Euler’s Totient Function: https://youtu.be/qxBxhs1hi7E
▶️ Fermat's Little Theorem: https://youtu.be/Ke4apeYMkNw
▶️ Asymmetric Key Cryptography in Cyber Security with Solved examples: https://youtu.be/ID9DADS8ZW4
▶️ Extended Euclidean Algorithm with Solved Example: https://youtu.be/pXuYeOHN0eM
▶️ Symmetric Key Cryptography in Cyber Security https://youtu.be/v8Vqvc_lHBA
▶️ Euclidean algorithm - How to find GCD of two number: https://youtu.be/00zcHB5flvI
▶️ Basics of Modular Arithmetic: https://youtu.be/tXWE6e5vR5g
--------------------------------------------------------------------------------------------------------------
You can always connect with me at: cybersafelearning@gmail.com
and Subscribe me on YouTube:
https://www.youtube.com/channel/UCgybJPCPPiSNftokrw3ua-g
--------------------------------------------------------------------------------------------------------------
Thanks For Watching My Video 🙏🏻 Like, Share & Subscribe
#RSA
#Chinese
#Cryptosystem
#Modular
#Square
#Multiply
#algorithm