Playfair Cipher C++ Program - The Coding Shala

Home >> Computer Network >> Playfair Cipher

Playfair Cipher C++ Program

Here is the C++ program to implement the Playfair Cipher.

C++ Code: 

#include<bits/stdc++.h>

using namespace std;

void encrypt(string key){
 pair<char,pair<int,int> > pa[25]; //store i j value of char
 int visited[26] = {0};
 char a[5][5];
 char b[5][5];
 char ch1,ch2,c1,c2;
 int i,j,i1,j1,i2,j2;
 int count=0;
 for(i=0; i<5; i++){
  if(count==key.size()){
   break;
  }
  for(j=0; j<5; j++){
   if(count==key.size()){
    break;
   }else if(key[count]!='j'){ //skip j
    //cout << key[count] << endl;
    while(visited[key[count]-'a']==1){  //skip same char
     count++;
    }
    if(visited[key[count]-'a']==0){  //first time store it
     a[i][j]=key[count];
     visited[key[count]-'a']=1;
    }
   }
   count++;
  }
 }
 
 int p=i-1; 
 int q=j;
 i=0;  
 //making 5*5 matrix
 while(i<26){
  if(i!='j'-'a'){  //for j char
   if(visited[i]==0){
    if(q==5){
     q=0;
     p++;
    }
    a[p][q]='a'+i;
    q++;
   }
  }
  i++;
 }
 
 //copy a to b
 for(int i=0; i<5; i++){
  for(int j=0; j<5; j++){
   b[i][j] = a[i][j];
  }
 }
 
 
 //making pair
 for(int i=0; i<5; i++){
  for(int j=0; j<5; j++){
   pa[b[i][j]-'a'].first=a[i][j];
   pa[b[i][j]-'a'].second.first = i;
   pa[b[i][j]-'a'].second.second = j;
  }
 }
  
 FILE *fp1, *fp2;
 fp1 = fopen("encrypt.txt","r");
 fp2 = fopen("decrypt.txt","w");
 int flag=0;
 char c;
 do{
         if(flag==0){
          aa:
  ch1=fgetc(fp1);
  if(!isalpha(ch1) && ch1!=EOF) goto aa;
  }else{
  ch1=c;
  flag=0;
  }
  ab:
  ch2=fgetc(fp1);
  if(!isalpha(ch2) && ch2!=EOF) goto ch2;
  
  if(ch1==ch2){
  flag=1;
  c=ch2;
  ch2='x';
  }
  
  if(ch1!=EOF && ch2==EOF) {
  ch2='x';
  }
  if(ch1==EOF || ch2==EOF){
   break;
  }
  i1 = pa[ch1-'a'].second.first;  //take  first char row
  j1 = pa[ch1-'a'].second.second; // first char column
  i2 = pa[ch2-'a'].second.first;  // second char row
  j2 = pa[ch2-'a'].second.second;  // second char column
  if(pa[ch1-'a'].second.first==pa[ch2-'a'].second.first){   
                       //check same row
   c1 = a[i1][(j1+1)%5];      
   c2 = a[i2][(j2+1)%5];
  }else if(pa[ch1-'a'].second.second==pa[ch2-'a'].second.second){ 
                  // check same column
   c1 = a[(i1+1)%5][j1];
   c2 = a[(i2+1)%5][j2];
  }else{    // digonal interchange
   c1 = a[i1][j2];
   c2 = a[i2][j1];
  }
  //cout << ch1 << " " << ch2;
  fputc(c1,fp2);
  fputc(c2,fp2);
 }while(ch1 != EOF || ch2!=EOF);
 
 fclose(fp1);
 fclose(fp2);
 
 //fp2 = fopen("p2.txt","r");
 
 //do{
 // ch1=fgetc(fp2);
//cout << ch1;
 //}while(ch1!=EOF);


}

void decrypt(string key){
 pair<char,pair<int,int> > pa[25];
 int visited[26] = {0};
 char a[5][5];
 char b[5][5];
 char ch1,ch2,c1,c2;
 int i,j,i1,j1,i2,j2;
 int count=0;
 for(i=0; i<5; i++){
  if(count==key.size()){
   break;
  }
  for(j=0; j<5; j++){
   if(count==key.size()){
    break;
   }else if(key[count]!='j'){
    //cout << key[count] << endl;
    while(visited[key[count]-'a']==1){
     count++;
    }
    if(visited[key[count]-'a']==0){
     a[i][j]=key[count];
     visited[key[count]-'a']=1;
    }
   }
   count++;
  }
 }
 
 int p=i-1;
 int q=j;
 i=0;
 while(i<26){
  if(i!='j'-'a'){
   if(visited[i]==0){
    if(q==5){
     q=0;
     p++;
    }
    a[p][q]='a'+i;
    q++;
   }
  }
  i++;
 }
 
 for(int i=0; i<5; i++){
  for(int j=0; j<5; j++){
   b[i][j] = a[i][j];
  }
 }
 
 
 for(int i=0; i<5; i++){
  for(int j=0; j<5; j++){
   pa[b[i][j]-'a'].first=a[i][j];
   pa[b[i][j]-'a'].second.first = i;
   pa[b[i][j]-'a'].second.second = j;
  }
 }
  
 FILE *fp1, *fp2;
 fp1 = fopen("decrypt.txt","r");
 fp2 = fopen("encrypt.txt","w");
 
 do{
  ch1=fgetc(fp1);
  ch2=fgetc(fp1);
  if(ch1==EOF || ch2==EOF){
   break;
  }
  i1 = pa[ch1-'a'].second.first;
  j1 = pa[ch1-'a'].second.second;
  i2 = pa[ch2-'a'].second.first;
  j2 = pa[ch2-'a'].second.second;
  if(pa[ch1-'a'].second.first==pa[ch2-'a'].second.first){
   c1 = a[i1][(j1+4)%5];
   c2 = a[i2][(j2+4)%5];
  }else if(pa[ch1-'a'].second.second==pa[ch2-'a'].second.second){
   c1 = a[(i1+4)%5][j1];
   c2 = a[(i2+4)%5][j2];
  }else{
   c1 = a[i1][j2];
   c2 = a[i2][j1];
  }
  //cout << ch1 << " " << ch2;
  fputc(c1,fp2);
  fputc(c2,fp2);
 }while(ch1 != EOF || ch2!=EOF);
 
 fclose(fp1);
 fclose(fp2);
 
 //fp2 = fopen("p1.txt","r");
 
 //do{
 // ch1=fgetc(fp2);
 // cout << ch1;
//while(ch1!=EOF);


}

int main(){
 string key;
 int ch;
 start:
  cout<<"Playfair cipher\n";
 cout << "1.encrypt\n 2.decrypt\n 3.exit\n";
 cin >> ch;
 switch(ch){
  case 1:
   cout << "enter key  :\n";
   cin >> key;
   encrypt(key);
   goto start;
   break;
  case 2:
   cout << "enter key  :\n";
   cin >> key;
   decrypt(key);
   goto start;
   break;
  case 3:
   exit(0);
 }
 return 0;
}



Other Posts You May Like

Vigenere Cipher C++ Program
Caesar Cipher C++ Program
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

LeetCode - Bulb Switcher Solution - The Coding Shala

Image
Home >> LeetCode >> Bulb Switcher LeetCode - Bulb Switcher Solution In this post, we will discuss LeetCode's Bulb Switcher Problem and its solution in Java. There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the i-th round, you toggle every i bulb. For the n-th round, you only toggle the last bulb. Find how many bulbs are on after n rounds. Example: Input: 3 Output: 1 Explanation: At first, the three bulbs are [off, off, off]. After the first round, the three bulbs are [on, on, on]. After the second round, the three bulbs are [on, off, on]. After the third round, the three bulbs are [on, off, off].  So you should return 1 because there is only one bulb is on. Practice this problem on LeetCode(Click Here). Java Solution of Bulb Switcher Problem Let's
Read more

Anti Diagonals - The Coding Shala

Image
Home >> Interview Questions >> Anti Diagonals Anti Diagonals Java Solution Give an N*N square matrix, return an array of its anti-diagonals. Look at the example for more details. Example: Input: 1 2 3 7 8 9 4 5 6 Return the following : [ [1], [2, 4], [3, 5, 7], [6, 8], [9] ] Input : 1 2 3 4 Return the following : [ [1], [2, 3], [4] ] Anti Diagonals Java Solution 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 public class Solution { public ArrayList < ArrayList < Integer >> diagonal ( ArrayList < ArrayList < Integer >> A ) { ArrayList < ArrayList < Integer >> ans = new ArrayList < ArrayList < Integer >>(); int N = A . size (); int i = N - 1 ; while ( i >= 0 ){ ArrayList < Integer > tmp = new ArrayList < Integer >();
Read more

Java Method Overloading - The Coding Shala

Image
Home >> Learn Java >> Java Method Overloading Java Method Overloading Java class can have more than one method with the same name but different in parameters, known as Method Overloading. Question: What is the use of method overloading? Answer:  Suppose we want to perform some operation like an addition but addition can be performed between two numbers, three numbers or two floats or more. So instead of using different methods, we use the same name of the method with different parameters. This can increase the readability of the program. Method overloading can be achieved by changing numbers of arguments or by changing the data types. Example of Method Overloading in Java The following example explains Method Overloading: //Method Overloading example class Addition { public int add ( int a , int b ){ return a + b ; } public int add ( int a , int b , int c ){ return a + b + c ; }
Read more

Sorting the Sentence LeetCode Solution - The Coding Shala

Home >> LeetCode >> Sorting the Sentence  In this post, we will learn how to solve LeetCode's Sorting the Sentence Problem and will implement its solution in Java. Sorting the Sentence Problem A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase English letters. A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging the words in the sentence. For example, the sentence "This is a sentence" can be shuffled as "sentence4 a3 is2 This1" or "is2 sentence4 This1 a3". Given a shuffled sentence s containing no more than 9 words, reconstruct and return the original sentence. Example 1: Input: s = "is2 sentence4 This1 a3" Output: "This is a sentence" Explanation: Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove the numbers. Example 2: Input:
Read more