Hill Cipher::: Program

HILL CIPHER:
Program:
#include<bits/stdc++.h>
using namespace std ;
int key[3][3] ;
int mod26(int x)
{
return x >= 0 ? (x%26) : 26-(abs(x)%26) ;
}
/* findDet(matrix , order_of_matrix) */
int findDet(int m[3][3] , int n)
{
int det;
if(n == 2)
{
det = m[0][0] * m[1][1] - m[0][1]*m[1][0] ;
}
else if (n == 3)
{
det = m[0][0]*(m[1][1]*m[2][2] - m[1][2]*m[2][1]) - m[0][1]*(m[1][0]*m[2][2]
- m[2][0]*m[1][2] ) + m[0][2]*(m[1][0]*m[2][1] - m[1][1]*m[2][0]);
}
else det = 0 ; // invalid input
return mod26(det);
}
int findDetInverse(int R , int D = 26) // R is the remainder or determinant

{
int i = 0 ;
int p[100] = {0,1};
int q[100] = {0} ; // quotient
while(R!=0)
{
q[i] = D/R ;
int oldD = D ;
D=R;
R = oldD%R ;
if(i>1)
{
p[i] = mod26(p[i-2] - p[i-1]*q[i-2]) ;
}
i++ ;
}
return p[i] = mod26(p[i-2] - p[i-1]*q[i-2]) ;

}
void multiplyMatrices(int a[1000][3] , int a_rows , int a_cols , int b[1000][3] , int b_rows , int
b_cols , int res[1000][3])
{
for(int i=0 ; i < a_rows ; i++)
{
for(int j=0 ; j < b_cols ; j++)
{
for(int k=0 ; k < b_rows ; k++)
{
res[i][j] += a[i][k]*b[k][j] ;
}
res[i][j] = mod26(res[i][j]) ;
}
}
}
/* Inverse = (matrix * detInverse) mod 26 */

/* findInverse(matrix , order_of_matrix , result_matrix) */
void findInverse(int m[3][3] , int n , int m_inverse[3][3] )
{
int adj[3][3] = {0};
int det = findDet(m , n); // findDet(matrix , order_of_matrix)

int detInverse = findDetInverse(det);
if(n==2)
{
adj[0][0] = m[1][1];
adj[1][1] = m[0][0];
adj[0][1] = -m[0][1];
adj[1][0] = -m[1][0];
}
else if(n==3)
{
int temp[5][5] = {0} ;
// fill the 5x5 matrix
for(int i=0; i<5; i++)
{
for(int j=0; j<5; j++)
{
if(i<3 && j<3) temp[i][j] = m[i][j] ;
else if(i>=3 && j>=3) temp[i][j] = temp[i][j-3] ;
else if(j>=3) temp[i][j] = m[i][j-3] ;
else if(i>=3) temp[i][j] = m[i-3][j] ;
}
}
/* except first row and column, multiply elements along rows and place them
along columns */
for(int i=1; i<=3 ; i++)
{
for(int j=1; j<=3 ; j++)
{
adj[j-1][i-1] = temp[i][j]*temp[i+1][j+1] -
temp[i][j+1]*temp[i+1][j];
}
}
}
for(int i=0; i<n ; i++)

{
for(int j=0; j<n ; j++)
{
m_inverse[i][j] = mod26(adj[i][j] * detInverse) ;
}
}
}
// C = PK
string encrypt(string pt, int n)
{
int P[1000][3] = {0} ; // plaintext
int C[1000][3] = {0} ; // cipher text
int ptIter = 0 ;
while(pt.length()%n != 0)
{
pt += "x" ; // pad extra x
}
int row = (pt.length())/n; // number of rows in P
for(int i=0; i<row ; i++)

{
for(int j=0; j<n; j++)
{
P[i][j] = pt[ptIter++]-'a' ;
}
}
// multiplyMatrices(mat_a , row_a , col_a , mat_b, row_b, col_b , mat_result)

multiplyMatrices(P, row , n , key , n , n , C) ;
string ct = "" ;
for(int i=0 ; i<row ; i++)
{
for(int j=0 ; j<n ;j++)
{
ct += (C[i][j] + 'a');
}
}
return ct ;
}
// P = C*(k_inverse)
string decrypt(string ct, int n)
{
int P[1000][3] = {0} ; // plaintext
int C[1000][3] = {0} ; // cipher text
int ctIter = 0 ;
int row = ct.length()/n; // number of rows in C
for(int i=0; i<row ; i++)

{
{
C[i][j] = ct[ctIter++]-'a' ;
}
}
int k_inverse[3][3] = {0};

/* findInverse(matrix , order_of_matrix , result_matrix) */
findInverse(key, n , k_inverse);
/* multiplyMatrices(mat_a , row_a , col_a , mat_b, row_b, col_b , mat_result) */

multiplyMatrices(C, row , n , k_inverse , n , n , P) ;
string pt = "" ;
for(int i = 0 ; i<row ; i++)
{
for(int j=0 ; j<n ; j++)
{
pt += (P[i][j] + 'a');
}
}
return pt ;
}
int main(void)
{
int n ;
string pt ;
cout << "Enter the text to be encrypted :";

cin >> pt;
cout << "Enter number of rows in keymatrix : ";

cin >> n ;
cout<<"Enter key matrix: " <<endl;

for(int i=0; i<n; i++)
{
{
cin >> key[i][j];
}
}
cout << "\nOriginal text : " << pt << endl;
string ct = encrypt(pt, n) ;
cout << "Encrypted text : " << ct << endl;
string dt = decrypt(ct, n);

cout << "Decrypted text : " << dt << endl;
}
OUTPUT:
Output 1:
Enter the text to be encrypted : meetmenow

Enter number of rows in keymatrix : 2
Enter key matrix:
9 4
5 7
Original text : meetmenow
Encrypted text : yybtyyfubp
Decrypted text : meetmenowx
Output2:
Enter the text to be encrypted : paymoremoney

Enter key matrix:
17 17 5
21 18 21
2 2 19
Original text : paymoremoney
Encrypted text : rrlmwbkaspdh
Decrypted text : paymoremoney
Output3:
Enter the text to be encrypted : attackistonight

Enter key matrix:
3 10 20
20 9 17
9 4 17
Original text : attackistonight
Encrypted text : fnwagwjgjkdnrrq
Decrypted text : attackistonight

Hill Cipher::: Program

Uploaded by

Copyright:

Available Formats

Hill Cipher::: Program

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Hill Cipher::: Program

Uploaded by

Copyright:

Available Formats

HILL CIPHER:

int findDetInverse(int R , int D = 26) // R is the remainder or determinant

return p[i] = mod26(p[i-2] - p[i-1]*q[i-2]) ;

/* Inverse = (matrix * detInverse) mod 26 */

int det = findDet(m , n); // findDet(matrix , order_of_matrix)

for(int i=0; i<n ; i++)

for(int i=0; i<row ; i++)

// multiplyMatrices(mat_a , row_a , col_a , mat_b, row_b, col_b , mat_result)

int row = ct.length()/n; // number of rows in C

for(int i=0; i<row ; i++)

int k_inverse[3][3] = {0};

/* multiplyMatrices(mat_a , row_a , col_a , mat_b, row_b, col_b , mat_result) */

cout << "Enter the text to be encrypted :";

cout << "Enter number of rows in keymatrix : ";

cout<<"Enter key matrix: " <<endl;

cout << "\nOriginal text : " << pt << endl;

string dt = decrypt(ct, n);

Enter the text to be encrypted : meetmenow

Enter the text to be encrypted : paymoremoney

Enter the text to be encrypted : attackistonight

You might also like