Skip to main content

Implementation of Caeser cipher in java with brute force attack


//file name CeaserCipher.java
import java.util.*;
class basic{
  String allChar="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  int indexOfChar(char c)
 {
  for(int i=0;i< allChar.length();i++)
  {
   if(allChar.charAt(i)==c)
    return i;
  }
  return -1;
 }
 
 char charAtIndex(int pos)
 {
  return allChar.charAt(pos);
 }
}
class Ceaser{
  basic b=new basic();

  String Encrypt(String plainText,int key)
  { 
   plainText=plainText.toUpperCase();
   String cipherText="";
   
   for(int i=0;i< plainText.length();i++)
   {
    int index=b.indexOfChar(plainText.charAt(i));
   
    if(index==-1)
    {
     cipherText+=plainText.charAt(i);
     continue;
    }
    if((index+key)%26==0)
    {
     cipherText+=b.charAtIndex(index+key);
    }
    else
    {
     cipherText+=b.charAtIndex((index+key)%26);
    }
   }
   return cipherText;
  }
  
  String Decrypt(String cipherText,int key)
  {
   cipherText=cipherText.toUpperCase();
   String decryptedText="";
   
   for(int i=0;i< cipherText.length();i++)
   {
    int index=b.indexOfChar(cipherText.charAt(i));
   
    if(index==-1)
    {
     decryptedText+=cipherText.charAt(i);
     continue;
    }
    if((index-key)>=0)
    {
     decryptedText+=b.charAtIndex(index-key);
    }
    else
    {
     decryptedText+=b.charAtIndex((index-key)+26);
    }
   }
   
   return decryptedText;
  }
  
  void bruteForce(String cipherText)
  {
   cipherText=cipherText.toUpperCase();
  
   for(int k=0;k< 26;k++)
   {
    String decryptedText="";
    int key=k;
    for(int i=0;i< cipherText.length();i++)
    {
     int index=b.indexOfChar(cipherText.charAt(i));
    
     if(index==-1)
     {
      decryptedText+=cipherText.charAt(i);
      continue;
     }
     if((index-key)>=0)
     {
      decryptedText+=b.charAtIndex(index-key);
     }
     else
     {
      decryptedText+=b.charAtIndex((index-key)+26);
     }
    }
    
    System.out.println("Decrypted Text Using key"+key+":"+decryptedText);
   }
  }
}
class CeaserCipher{
 public static void main(String args[])throws Exception
 {
  Scanner scn=new Scanner(System.in);
  String plainText,cipherText;
  int key;
  
  System.out.println("Enter Plaintext message:");
  plainText=scn.nextLine();
  
  System.out.println("Enter key for Encryption:");
  key=scn.nextInt();
  
  
  Ceaser cipher=new Ceaser();
  cipherText=cipher.Encrypt(plainText,key);
  System.out.println("Encrypted Ciphertext is:"+cipherText);
  String decryptedText=cipher.Decrypt(cipherText,key);
  System.out.println("Decrypted Ciphertext is:"+decryptedText);
  
  System.out.println("Do you want to apply brute force on Ciphertext?press 1 otherwise press anykey");
  int choice=scn.nextInt();
  
   if(choice==1)
    cipher.bruteForce(cipherText);
 }
}  

OUTPUT
Enter Plaintext message:
hithisisanandpatel
Enter key for Encryption:
4
Encrypted Ciphertext is:LMXLMWMWERERHTEXIP
Decrypted Ciphertext is:HITHISISANANDPATEL

Do you want to apply brute force on Ciphertext?press 1 otherwise press anykey
1
Decrypted Text Using key0:LMXLMWMWERERHTEXIP
Decrypted Text Using key1:KLWKLVLVDQDQGSDWHO
Decrypted Text Using key2:JKVJKUKUCPCPFRCVGN
Decrypted Text Using key3:IJUIJTJTBOBOEQBUFM
Decrypted Text Using key4:HITHISISANANDPATEL
Decrypted Text Using key5:GHSGHRHRZMZMCOZSDK
Decrypted Text Using key6:FGRFGQGQYLYLBNYRCJ
Decrypted Text Using key7:EFQEFPFPXKXKAMXQBI
Decrypted Text Using key8:DEPDEOEOWJWJZLWPAH
Decrypted Text Using key9:CDOCDNDNVIVIYKVOZG
Decrypted Text Using key10:BCNBCMCMUHUHXJUNYF
Decrypted Text Using key11:ABMABLBLTGTGWITMXE
Decrypted Text Using key12:ZALZAKAKSFSFVHSLWD
Decrypted Text Using key13:YZKYZJZJREREUGRKVC
Decrypted Text Using key14:XYJXYIYIQDQDTFQJUB
Decrypted Text Using key15:WXIWXHXHPCPCSEPITA
Decrypted Text Using key16:VWHVWGWGOBOBRDOHSZ
Decrypted Text Using key17:UVGUVFVFNANAQCNGRY
Decrypted Text Using key18:TUFTUEUEMZMZPBMFQX
Decrypted Text Using key19:STESTDTDLYLYOALEPW
Decrypted Text Using key20:RSDRSCSCKXKXNZKDOV
Decrypted Text Using key21:QRCQRBRBJWJWMYJCNU
Decrypted Text Using key22:PQBPQAQAIVIVLXIBMT
Decrypted Text Using key23:OPAOPZPZHUHUKWHALS
Decrypted Text Using key24:NOZNOYOYGTGTJVGZKR
Decrypted Text Using key25:MNYMNXNXFSFSIUFYJQ

Comments

Popular posts from this blog

First Come First Serve (FCFS) Page replacement algorithm in C Programming

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 5 3 2 4 | 5 3 4 5 | 5 3 4 ---------------------------...

Deadlock Prevention using Banker’s Algorithm in C Programming

#include #include void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i OUTPUT Enter number of process:5 Enter number of resources:3 Enter total numbers of each resources:10 5 7 Enter Max resources for each process: for process 1:7 5 3 for process 2:3 2 2 for process 3:9 0 2 for process 4:2 2 2 for process 5:4 3 3 Enter allocated resources for each process: for process 1:0 1 0 for process 2:3 0 2 for process 3:3 0 2 for process 4:2 1 1 for process 5:0 0 2 available resources: 2 3 0 Allocated matrix Max need 0 1 0| 7 5 3| 7 4 3 3 0 2| 3 2 2| 0 2 0 3 0 2| 9 0 2| 6 0 0 2 1 1| ...

MVT (Multiprogramming Variable Task) in C Programming

#include #include void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i =pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Allocate page 2 Allocate page 3 page 4 is not allocated due to insufficient memory. External Fragmentation is:64