Skip to main content

Caesar Cipher in Python

Hello everyone, in this tutorial you’ll learn about Caesar cipher in Python. If you have learned about cryptography then you should have known this term Caesar cipher. Well if you don’t know what is this then let me explain it to you.

What is Caesar Cipher?

In cryptography, Caesar cipher is one of the simplest and most widely known encryption techniques. It is also known with other names like Caesar’s cipher, the shift cipher, Caesar’s code or Caesar shift. This encryption technique is used to encrypt plain text, so only the person you want can read it. The method is named after Julius Caesar, who used it in his private correspondence.

In this encryption technique, to encrypt our data,  we have to replace each letter in the text by a some other letter at a fixed difference. Let’s say, there is a letter ‘T’ then with a right shift of 1 it will be ‘U’ and with a left shift of 1 it will become ‘S’.  So here, the difference is 1 and the direction will also be same for a text. Either we can use left shift or right, not both in same text.

Let’s understand it with an easy example.

Example

Suppose we have text “the crazy programmer” to be encrypted. Then what we can do is replace each of letter present in the text by a another letter having fixed difference. Lets say we want right shift by 2 then each letter of the above text have to replaced by the letter, positioned second from the letter.

Plaintext: the crazy programmer

Ciphertext: vjg etcba rtqitcoogt

Now user can’t  read this text until he/she have the decrypt key.  Decrypt key is nothing just the knowledge about how we shifted those letters while encrypting it. To decrypt this we have to left shift all the letters by 2.

That was the basic concept of Caesar cipher.  If we see this encryption technique in mathematical way then the formula to get encrypted letter will be:

c = (x + n) mod 26

where, c is place value of encrypted letter,

x is place value of actual letter,

n is the number that shows us how many positions of letters we have to replace.

On other hand, to decrypt each letter we’ll use the formula given below:

c = (x – n) mod 26

Program for Caesar Cipher in Python

def encrypt(string, shift):

  cipher = ''
  for char in string: 
    if char == ' ':
      cipher = cipher + char
    elif  char.isupper():
      cipher = cipher + chr((ord(char) + shift - 65) % 26 + 65)
    else:
      cipher = cipher + chr((ord(char) + shift - 97) % 26 + 97)
  
  return cipher

text = input("enter string: ")
s = int(input("enter shift number: "))
print("original string: ", text)
print("after encryption: ", encrypt(text, s))

Output:

enter string: the crazy programmer
enter shift number: 2
original string: the crazy programmer
after encryption: vjg etcba rtqitcoogt

So in above program we have used the same formula (with some modification) we mentioned above. But in computer science ‘A’ is different from ‘a’ thats why we have to write that formula twice, (for uppercase and lowercase letters).

As you can see in the program we have added and subtracted 65 (for Uppercase) and 97 (for lowercase) in that mathematical formula because the ascii value of ‘A’ is 65 and of ‘a’ is 97. The ord() method is used to get the ascii value of the letters.

Note 1: if you want left shift instead of right then please enter a negative number in ‘enter shift number: ’.

Note 2: the above program will work only for Python 3.x because input() method works different in both Python 2 and 3. To use the above program in Python 2, use raw_input() in place of input() method.

To decrypt this message, we will use the same above program but with a small modification.

cipher = cipher + chr((ord(char) – shift – 65) % 26 + 65)

If you’ve any problem or suggestion related to caesar cipher in python then please let us know in comments.

The post Caesar Cipher in Python appeared first on The Crazy Programmer.



from The Crazy Programmer https://www.thecrazyprogrammer.com/2018/05/caesar-cipher-in-python.html

Comments

Popular posts from this blog

Rail Fence Cipher Program in C and C++[Encryption & Decryption]

Here you will get rail fence cipher program in C and C++ for encryption and decryption. It is a kind of transposition cipher which is also known as zigzag cipher. Below is an example. Here Key = 3. For encryption we write the message diagonally in zigzag form in a matrix having total rows = key and total columns = message length. Then read the matrix row wise horizontally to get encrypted message. Rail Fence Cipher Program in C #include<stdio.h> #include<string.h> void encryptMsg(char msg[], int key){ int msgLen = strlen(msg), i, j, k = -1, row = 0, col = 0; char railMatrix[key][msgLen]; for(i = 0; i < key; ++i) for(j = 0; j < msgLen; ++j) railMatrix[i][j] = '\n'; for(i = 0; i < msgLen; ++i){ railMatrix[row][col++] = msg[i]; if(row == 0 || row == key-1) k= k * (-1); row = row + k; } printf("\nEncrypted Message: "); for(i = 0; i < key; ++i) f...

Data Encryption Standard (DES) Algorithm

Data Encryption Standard is a symmetric-key algorithm for the encrypting the data. It comes under block cipher algorithm which follows Feistel structure. Here is the block diagram of Data Encryption Standard. Fig1: DES Algorithm Block Diagram [Image Source: Cryptography and Network Security Principles and Practices 4 th Ed by William Stallings] Explanation for above diagram: Each character of plain text converted into binary format. Every time we take 64 bits from that and give as input to DES algorithm, then it processed through 16 rounds and then converted to cipher text. Initial Permutation: 64 bit plain text goes under initial permutation and then given to round 1. Since initial permutation step receiving 64 bits, it contains an 1×64 matrix which contains numbers from 1 to 64 but in shuffled order. After that, we arrange our original 64 bit text in the order mentioned in that matrix. [You can see the matrix in below code] After initial permutation, 64 bit text passed throug...

Experimental: Reducing the size of .NET Core applications with Mono's Linker

The .NET team has built a linker to reduce the size of .NET Core applications. It is built on top of the excellent and battle-tested mono linker . The Xamarin tools also use this linker so it makes sense to try it out and perhaps use it everywhere! "In trivial cases, the linker can reduce the size of applications by 50%. The size wins may be more favorable or more moderate for larger applications. The linker removes code in your application and dependent libraries that are not reached by any code paths. It is effectively an application-specific dead code analysis ." - Using the .NET IL Linker I recently updated a 15 year old .NET 1.1 application to cross-platform .NET Core 2.0 so I thought I'd try this experimental linker on it and see the results. The linker is a tool one can use to only ship the minimal possible IL code and metadata that a set of programs might require to run as opposed to the full libraries. It is used by the various Xamarin products to extract...