Skip to main content

Implementation of Hill cipher in Java


// File name:HillCipher.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 Hill{
    
        Hill(int block)
        {
            this.block=block;
        }
    
       Basic b1=new Basic();
       int block=2;
       int key[][]=new int[block][block];
       
       
       void keyInsert()throws Exception
       {
           Scanner scn=new Scanner(System.in);
           System.out.println("Enter key Matrix");
           for(int i=0;i < block;i++)
           {
                for(int j=0;j < block;j++)
                {
                    key[i][j]=scn.nextInt();
                } 
           }
       }
       
       void KeyInverseInsert()throws Exception
       {
           Scanner scn=new Scanner(System.in);
           System.out.println("Enter key Inverse Matrix:");
           for(int i=0;i < block;i++)
           {
                for(int j=0;j < block;j++)
                {
                    key[i][j]=scn.nextInt();
                } 
           }
       }
       
       String encryptBlock(String plain)throws Exception
       {
           plain=plain.toUpperCase();
           int a[][]=new int[block][1],sum=0;
           int cipherMatrix[][]=new int[block][1];
           String cipher="";
           
           for(int i=0;i < block;i++)
           {
               a[i][0]=b1.indexOfChar(plain.charAt(i));
           }
       
           
           for(int i=0;i < block;i++)
   {
    for(int j=0;j < 1;j++)
    {   
     for(int k=0;k < block;k++)
     {
      sum=sum+key[i][k]*a[k][j];
     }
     cipherMatrix[i][j] = sum%26;
     sum = 0;
    }
   }
          
           
           for(int i=0;i < block;i++)
           {
              cipher+=b1.charAtIndex(cipherMatrix[i][0]);
           }
           return cipher;
       }
       
       String encrypt(String plainText)throws Exception
       {
           String cipherText="";
            keyInsert();
           
            plainText=plainText.toUpperCase();
            
               int len=plainText.length();
          // System.out.println(plainText.substring(1,2+1));
           
               while(len%block!=0)
               {
                   plainText+="X";
                   System.out.println(len);
                   len=plainText.length();
               }
           
           
           for(int i=0;i < len-1;i=i+block)
           {
              cipherText+=encryptBlock(plainText.substring(i,i+block));
              cipherText+=" "; 
           }
           return cipherText;
       }
       
        String decryptBlock(String cipher)throws Exception
       {
           cipher=cipher.toUpperCase();
           int a[][]=new int[block][1],sum=0;
           int plainMatrix[][]=new int[block][1];
           String plain="";
           
           for(int i=0;i < block;i++)
           {
               a[i][0]=b1.indexOfChar(cipher.charAt(i));
           }
       
           
           for(int i=0;i < block;i++)
   {
    for(int j=0;j < 1;j++)
    {   
     for(int k=0;k < block;k++)
     {
      sum=sum+key[i][k]*a[k][j];
     }
                                        while(sum < 0)
                                        {
                                              sum+=26;
                                        }
     plainMatrix[i][j] = sum;
     sum = 0;
    }
   }
          
           
           for(int i=0;i < block;i++)
           {
              plain+=b1.charAtIndex(plainMatrix[i][0]);
           }
           return plain;
       }
       
       String Decrypt(String cipherText)throws Exception
       {
           String plainText="";
           KeyInverseInsert();
           cipherText=cipherText.replaceAll(" ", "");
           
            cipherText=cipherText.toUpperCase();
            
               int len=cipherText.length(); 

           for(int i=0;i < len-1;i=i+block)
           {
              plainText+=decryptBlock(cipherText.substring(i,i+block));
              plainText+=" "; 
           }
           return plainText;
       }
       
}

class HillCipher{
       public static void main(String args[])throws Exception
       {
           String plainText,cipherText;  
           int block;
           Scanner scn=new Scanner(System.in);
          
           System.out.println("Enter plain-text:");
           plainText=scn.nextLine();
           
           System.out.println("Enter block size of matrix:");
           block=scn.nextInt();
           Hill hill=new Hill(block);
           
           plainText=plainText.replaceAll(" ", "");
           cipherText= hill.encrypt(plainText);
           
           System.out.println("Encrypted Text is:\n"+cipherText);
           
           String decryptedText= hill.Decrypt(cipherText);
           System.out.println("Decrypted Text is:\n"+decryptedText);
           
                    
       }
}
OUTPUT
Enter plain-text:
meet
Enter block size of matrix:
2
Enter key Matrix
3 1
5 2
Encrypted Text is:
OQ FG
Enter key Inverse Matrix:
2 -1
-5 3
Decrypted Text is:
ME ET

Comments

  1. develop a code that makes any sense please.............

    ReplyDelete
    Replies
    1. Your code only work if we give plain text meet and your key otherwise it will generate exception!.

      Delete

Post a Comment

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