Caesar Cipher C++ Program - The Coding Shala

Home >> Computer Network >> Caesar Cipher

Caesar Cipher C++ Program

Here is the C++ Program to implement the Caesar Cipher.

C++ Code: 

#include<bits/stdc++.h>

using namespace std;

int findmax(int* a){
 int max = -1;
 int maxindex;
 for(int i=0; i<26; i++){
  if(a[i]>max){
   max = a[i];
   maxindex = i;
  }
 }
 
 a[maxindex] = -1;
 return maxindex;
}


void encript(){
              int key;
              cout<<"enter the key\n";
              cin>>key;
              // char *file;
              //cout<<"enter the file name\n";  
              //cin>>file; 
              FILE *fp1, *fp2;
              fp1 = fopen("encript.txt", "r");
              fp2 = fopen("decript.txt", "w");
              char ch;
              while((ch=fgetc(fp1))!=EOF){
              //cout<<ch;
              if(isalpha(ch)){
              if(ch>='A' && ch<='Z'){
              char ot = ((((ch-'A')+key)%26)+'A');
              fputc(ot, fp2);
              }
             else if(ch>='a' && ch<='z') {
             char ot = ((((ch-'a')+key)%26)+'a');
             fputc(ot, fp2);
             }
             }
            else continue;
            }
            //cout<<"\n";
            fclose(fp1); 
            fclose(fp2); 
}

void decript(){
            int key;
            cout<<"enter the key\n";
            cin>>key;
            key = key%26;
            // char *file;
            //cout<<"enter the file name\n";  
            //cin>>file; 
            FILE *fp1, *fp2;
            fp1 = fopen("encript.txt", "w");
            fp2 = fopen("decript.txt", "r");
            char ch;
            while((ch=fgetc(fp2))!=EOF){
            //cout<<ch;
            if(ch>='A' && ch<='Z'){
            char ot = (((((ch-'A')-key)+26)%26)+'A');
            fputc(ot, fp1);
            }
            else if(ch>='a' && ch<='z') {
           char ot = (((((ch-'a')-key)+26)%26)+'a');
           fputc(ot, fp1);
           }
           }
        cout<<"\n";
        fclose(fp1); 
        fclose(fp2);
}

void bruteforce(){ 
                FILE *fp1, *fp2;
                char next='n'; 
                int key = 1;
                char  ch;
                while(key<=26){
                         cout<<"\n";
                         fp1 = fopen("encript.txt", "w");
                         fp2 = fopen("decript.txt", "r");
                         while((ch=fgetc(fp2))!=EOF){
                        if(ch>='A' && ch<='Z'){
                        char ot = (((((ch-'A')-key)+26)%26)+'A');
                        cout<<ot;
                         }
                         else if(ch>='a' && ch<='z') {
                         char ot = (((((ch-'a')-key)+26)%26)+'a');
                       cout<<ot;
                        }
                        }
                        cout<<"\nenter y if text is readable else n \n";
                        cin>>next;
                        if(next=='y') break;
                        else key++;
                        fclose(fp1); 
                        fclose(fp2);  
                } 
                 fp1 = fopen("encript.txt", "w");
                 fp2 = fopen("decript.txt", "r");
                while((ch=fgetc(fp2))!=EOF){
                //cout<<ch;
                if(ch>='A' && ch<='Z'){
                char ot = (((((ch-'A')-key)+26)%26)+'A');
                fputc(ot, fp1);
                 }
                 else if(ch>='a' && ch<='z') {
                 char ot = (((((ch-'a')-key)+26)%26)+'a');
                 fputc(ot, fp1);
                }
                } 
                fclose(fp1); 
                fclose(fp2);    
                
}

void frequency(){
  int sample[26] = {0};
  int decripttxt[26] = {0};
  char ch;
  FILE *fp1, *fp2, *fp3;
  fp1 = fopen("sample.txt", "r");
  fp2 = fopen("decript.txt", "r");
  while((ch=fgetc(fp1))!=EOF){ 
   if(isalpha(ch)){
    if(ch>='a' && ch<='z') sample[ch-'a']++;
    else if(ch>='A' && ch<='Z') sample[ch-'A']++;
   }else continue;
  }
  fclose(fp1);
  
  while((ch=fgetc(fp2))!=EOF){ 
   if(isalpha(ch)){
    if(ch>='a' && ch<='z') decripttxt[ch-'a']++;
    else if(ch>='A' && ch<='Z') decripttxt[ch-'A']++;
   }else continue;
  }
  fclose(fp2);
  
  int a = findmax(decripttxt);
  int b;
  char next='n';
  int key;
     while(next=='n'){
                  b = findmax(sample);
                   key = abs(a-b);
                         cout<<"\n";
                         fp2 = fopen("decript.txt", "r");
                         while((ch=fgetc(fp2))!=EOF){
                        if(ch>='A' && ch<='Z'){
                        char ot = (((((ch-'A')-key)+26)%26)+'A');
                        cout<<ot;
                         }
                         else if(ch>='a' && ch<='z') {
                         char ot = (((((ch-'a')-key)+26)%26)+'a');
                       cout<<ot;
                        }
                        }
                        cout<<"\nenter y if text is readable else n \n";
                        cin>>next;
                        if(next=='y') break;
                        fclose(fp2);  
                } 
                
                 fp3 = fopen("encript.txt", "w");
                 fp2 = fopen("decript.txt", "r");
                 
                 
                while((ch=fgetc(fp2))!=EOF){
                //cout<<ch;
                if(ch>='A' && ch<='Z'){
                char ot = (((((ch-'A')-key)+26)%26)+'A');
                fputc(ot, fp3);
                 }
                 else if(ch>='a' && ch<='z') {
                 char ot = (((((ch-'a')-key)+26)%26)+'a');
                 fputc(ot, fp3);
                }
                } 
                fclose(fp3); 
                fclose(fp2);  
  
}




int main(){
int ch;
start:
cout<<"Please choose option\n";
cout<<"1. Encript\n 2.Decript\n 3.Brute force\n 4.Frequency analysis\n 5.exit\n";
cin>>ch;
switch(ch){
   case 1:
          encript();
          goto start;
          break;
   case 2:
         decript();
         goto start;
         break;
   case 3:
         bruteforce();
         goto start;
         break;
   case 4: 
         frequency();
         goto start;
         break;
    case 5: exit(0);
   default:
        cout<<"enter correct option\n";
}
return 0;
}



Other Posts You May Like
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

Java Program to Convert Decimal to Binary - The Coding Shala

Home >> Java Programs >> Convert Decimal to Binary  Hey there, welcome back to another post. In this post, we will learn how to convert decimal to binary in Java. Java Program to Convert Decimal to Binary You have given a decimal number. Write a Java program to convert decimal to binary. Example 1:  Input: 7 Output: 111 Input: 10 Output: 1010 Decimal to Binary Conversion using Array Approach To convert decimal to binary we can follow the below steps: Store the remainder in the array when we divide the number by 2. Divide the number by 2. Follow the above two steps until the number is above 0. Print the array in reverse order. For example:  4 % 2 = 0 => 4/2 = 2 2 % 2 = 0 => 2/2 = 1 1 % 2 = 1 => 1/2 = 0 Binary of 4 is: 100 Java Program:  import java.util.ArrayList; import java.util.List; import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printBina...
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 Program to Find GCD or HCF of Two Numbers - The Coding Shala

Home >> Java Programs >> Find GCD of Two Numbers  Hey there, welcome back to another post. In this post, we will learn how to find GCD or HCF of Two Numbers in Java. Java Program to Find GCD or HCF of Two Numbers The GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. For example:  Number1: 6 (2 * 3) Number2: 9 (3 * 3) GCD or HCF of 6 and 9 is: 3 Find GCD of Two Numbers in Java using for Loop As we already know, GCD is the largest number that divides both numbers. We can start a for loop from 1 (because 1 divides all the numbers) to both numbers and if it divides both numbers then update GCD. Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void findGCD( int num1, int num2) { int gcd = 1; if (num1 == 0) { gcd = num2; } if (num2 == 0) { ...
Read more

Spiral Order Matrix II - The Coding Shala

Image
Home >> Interview Questions >> Spiral Order matrix 2 Spiral Order Matrix II Problem Solution Given an integer n, generate a square matrix filled with elements from 1 to n 2  in spiral order. Example: Given n = 3, You should return the following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ] Solution: (Java) The concept is the same as how to print the Spiral Order Matrix. Approach: Let's see for n= 4, then numbers will come from 1 to 16(n*n) in the matrix. As we need to insert numbers in spiral order so here we need 4 things to check, first and last column and top and bottom row. The following four steps we need to do: First, we need to insert numbers in the top row. Our loop will go from the left column to the right then will increase the top row by one and now the top is our second row. Now we are inserting the numbers in the right column, will start the loop from top to bottom, and then decrease the value of the right ...
Read more

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more