Skip to main content

Data encryption using Caesar Cipher

In this post we will discuss what is cryptography and how can we encrypt our files using Caesar Cipher. First Things first let us first understand the what is cryptography, according to wikipedia,

"Cryptography is the practice and study of techniques for secure communication in the presence of third parties called adversaries"

Simply stated it is passing messages between 2 user using a channel that is not secure yet the intruders trying to get steal information will not be able to understand messages directly as the messages are encrypted.

In order to encrypt a message, we change the contents of message such that only the intended receiver of the message is able to decode it. Let us now discuss Caesar Cipher, sometime also called as shift cipher is a ciphering technique that is one of the most simple and widely known techniques of encryption. This technique uses a substitution technique in which for each letter in our message we have a letter that substitutes it. In Caesar Cipher we use a shift value to decide the substitution value. 
For example if our shift value is 3 then we replace each letter in our message with the letter that is three places to the right of it in alphabetical order.

So for shift value of 3 we have,
Plaintext :       ABCDEFGHIJKLMNOPQRSTUVWXYZ 
Ciphertext :     DEFGHIJKLMNOPQRSTUVWXYZABC

Hence every 'a' in our message is replaced by 'd' if the shift value is 3.

consider, Plaintext :  "HELLO, WELCOME TO MY BLOG" will be changed to 
             Ciphertext: "KHOOR, ZHOFRPH WR PB EORJ"


 In the above sentence is completely changed and most people won't guess it, but still it is known that caesar cipher encryption can be broken easily as there are only 26 shift values to try and also simple analysis of letter occurrences can give up the shift value, so lets make it a bit complex.

 For my code, along with the letters I also chose to encrypt spaces, punctuation's and numbers. this increases the size of the key space hence makes it a bit complex and secure.

 The following is my keyspace,
"0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!"#$%&'( )*+,-./"

 The above key space includes almost all the printable characters. 

 Lets get to the coding part, first I created a string that contained the above characters, then I have created a function that accepts a string and a shift value to encrypt the string, then iterating over each character we simple replace it with the character with it's substitution character.
I have also made a function the receives the path of a file and stores the encrypted file on the desktop, you can change the destination path to wherever you want.

 The following is the code for Caesar cipher encryption in c++, Python and Java 


C++ Program

Sample input and output to check the program


You might also be interested in 

 LCM of 2 numbersAnagram Strings
Double Linked List
Finding Middle node in a Linked List
Infix to Prefix Conversion
Infix to Postfix Conversion
Binary Search Tree
Labels:

Comments

Post a Comment

Popular posts from this blog

Home Page

List of All Programs The Following is the List of all the programs on my Blog Math Programs Square Root of a number using Babylonian Method Finding The Next Smallest Palindrome Finding the Armstrong Numbers Factorial of a number GCD using Euclid's Algorithm Check if a number is Fibonacci Number or not LCM of 2 numbers Trailing Zeros in factorial of a number Sorting Algorithms Bubble Sort Algorithm Selection Sort Algorithm Insertion Sort Algorithm Shell Sort Algorithm Counting Sort Algorithm Linked List Programs Simple Singly Linked List Linked List in C++ Linked List in Python Linked List in Java Doubly Linked List Finding Kth element from the end of Linked List Delete a node from Linked List Delete Kth element from the end of Linked List Rotate Linked List in an Anti-clockwise direction Reversing first K nodes of a Linked List Binary Search Tree Left View of Binary Tree Righ...
4 comments
Read more

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack. Infix expressions are the expressions that we normally use, eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+56 7 , +a*bc etc. This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it. NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code. So, to convert an infix expression to a prefix expression we follow the below steps (we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)...
Post a Comment
Read more

Linked List in python

Linked list is a simple linear data structure formed by collection of data elements called nodes. Each node consists of a data element and link field. There is a head node that points to the starting of the linked list. this diagram shows a simple representation of the linked list. Linked list can be used to implement stacks, queues, list, associative arrays, etc.  Unlike arrays linked lists are not stored in contagious memory locations rather the are stored at any empty place in memory and the address of the next node is stored in the link field. Also you don't need to declare the size of the linked list at the time of initialization you can dynamically keep adding elements to the linked list. Click for complete information on Linked List  The following implementation of the linked list has the following methods implemented : isEmpty() : Returns true if the Linked List is empty. addToStart() : Adds elements at the start of the linked Li...
1 comment
Read more