Caesar Cipher Explained with Solved Example|lec 3|urdu|hindi

This tutorial will teach you how to encrypt and decrypt messages using the Caesar Cipher. Substitution ciphers form the first of the fundamental building blocks. This mathematical description uses modulo (clock) arithmetic. Here, when you reach Z you go back to A and start again. Mod 26 implies that when you reach 26, you use 0 instead (ie the letter after Z, or 25 + 1 goes to A or 0). #urdu #hindi #uog #informationsecurity