caesar cipher encryption and decryption in hindi | caesar cipher encryption and decryption example

A Caesar cipher,is one of the simplest and most widely known encryption techniques. Caesar Cipher Encryption and Decryption in hindi is a type of substitutio...

QuickCS•2.1K views•8:40

🔥 Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Tunisia under the topic 'ca'.

About this video

A Caesar cipher,is one of the simplest and most widely known encryption techniques. Caesar Cipher Encryption and Decryption in hindi is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence. The transformation can be represented by aligning two alphabets; the cipher alphabet is the plain alphabet rotated left or right by some number of positions The Caesar cipher is named after Julius Caesar, who, according to Suetonius, used it with a shift of three to protect messages of military significance. While Caesar's was the first recorded use of this scheme, other substitution ciphers are known to have been used earlier. Deciphering is done in reverse, with a right shift of 3. The encryption can also be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A → 0, B → 1, ..., Z → 25.[2] Encryption of a letter x by a shift n can be described mathematically as,[3] {\displaystyle E_{n}(x)=(x+n)\mod {26}.} E_{n}(x)=(x+n)\mod {26}. Decryption is performed similarly, {\displaystyle D_{n}(x)=(x-n)\mod {26}.} D_{n}(x)=(x-n)\mod {26}. (There are different definitions for the modulo operation. In the above, the result is in the range 0 to 25; i.e., if x + n or x − n are not in the range 0 to 25, we have to subtract or add 26.) The replacement remains the same throughout the message, so the cipher is classed as a type of monoalphabetic substitution, as opposed to polyalphabetic substitution. I HAVE SOLVED AN EXAMPLE ALSO. YOU CAN UNDERSTAND IT IN 5 STEPS. IF YOU WANT MORE EXAMPLES PLEASE ASK IN COMMENTS SECTION BELOW. THANK YOU GUYS FOR WATCHING THIS VIDEO. IF YOU GUYS HAVE ANY DOUBT PLEASE ASK IN THE COMMENTS SECTION BELOW. PLEASE LIKE SHARE AND SUBSCRIBE!!!!!!!!!!!!!!! THANK YOU!!!! Chapters: 0:00-0:46 Introduction to Caesar cipher in Hindi 0:46-1:04 History of Caesar cipher 1:04-1:47 what is Caesar Cipher in Hindi? 1:47-2:06 Requirements of Caesar cipher 2:06-3:01 Example of Caesar Cipher in Hindi 3:01-5:58 Caesar Cipher Encryption 5:58-8:40 Caesar Cipher Decryption #caesarcipher #ceasarcipher #encryptionanddecryption

Video Information

Views
2.1K

Total views since publication

Likes
52

User likes and reactions

Duration
8:40

Video length

Published
Nov 7, 2020

Release date

Quality
hd

Video definition