-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHillCipherDecryption.java
More file actions
228 lines (205 loc) · 6.82 KB
/
Copy pathHillCipherDecryption.java
File metadata and controls
228 lines (205 loc) · 6.82 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
import java.util.Scanner;
/**
* Created by Ruby on 3/17/2016.
*/
public class HillCipherDecryption {
public static void main(String[] args) {
Decrypt decrypt=new Decrypt();
//Try for key: fird
Scanner in=new Scanner(System.in);
System.out.print("Enter key: ");
String key=in.nextLine().toUpperCase();
System.out.print("Enter encrypted message: ");
String encrypted=in.nextLine().toUpperCase();
if (key.length()>4){
decrypt.setSizeAndInitializeVars(3);
}else{
System.out.print("Enter key matrix size you want (2 and 3 allowed): ");
int s=in.nextInt();
if (s>3 || s<2){
System.out.println("Invalid key size----------");
return;
}else{
decrypt.setSizeAndInitializeVars(s);
}
}
decrypt.carryOutDecryption(key, encrypted);
}
}
class Decrypt{
private int size;
private String alphabets="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
private int [][]keyMatrix;
private int [][]adj;
private int [][]KInv;
void carryOutDecryption(String key, String encrypted){
key=manageKeySize(key);
encrypted=manageMsgSize(encrypted);
createKeyMatrix(keyMatrix, key);
int determinant=findDeterminant(keyMatrix);
int determinantInv=determinantInverse(determinant);
System.out.println("-------Determinant Inverse: ---------\n" + determinantInv);
findAdjoint(keyMatrix, adj);
System.out.println("-------ADJOINT---------");
displayMatrix(adj);
getKInverse(adj,determinantInv, KInv);
System.out.println("-------K-INVERSE = Determinant Inverse * Adjoint---------");
displayMatrix(KInv);
System.out.println("\n\nDecrypting......\n\nDecrypted Text: " + getDecryptedText(encrypted));
}
String manageKeySize(String key){
if (key.length()<size*size){
int diff=size*size-key.length();
for (int i=0; i<diff; i++){
key+=alphabets.charAt(i);
}
}
return key;
}
String manageMsgSize(String msg){
//changing msg into proper length as per matrix size, by adding X
if (msg.length()%size!=0){
int diff=Math.abs(size - msg.length() % size);
for (int i=0; i<diff; i++){
msg+='X';
}
}
return msg;
}
int findDeterminant(int[][]matrix){
int det=0;
if (size==2){
det=matrix[0][0]*matrix[1][1]-matrix[0][1]*matrix[1][0];
}else if (size==3){
int [][]temp=new int[size][size+2];
int k;
for (int i=0; i<size; i++){
for (int j=0; j<size+2; j++){
if (j>size-1){
k=j-size;
}else {
k=j;
}
temp[i][j]=matrix[i][k];
}
}
for(int i=0; i<3; i++){
int val=1;
for (int j=0; j<size; j++){
val*=temp[j][j+i];
}
det+=val;
}
for(int i=size-1; i<size+2; i++){
int val=1;
for (int j=0; j<size; j++){
val*=temp[j][i-j];
}
det-=val;
}
}
det=det % 26;
return (det<0)?det+26:det;
}
int determinantInverse(int determinant){
int x=1;
while(true){
if ((determinant*x)%26==1){
return x;
}
x++;
}
}
void findAdjoint(int[][] arr, int[][] adj){
if (size==2){
adj[0][0]=arr[1][1];
adj[1][1]=arr[0][0];
adj[0][1]=(-arr[0][1])%26;
adj[0][1]=adj[0][1]<0?adj[0][1]+26:adj[0][1];
adj[1][0]=(-arr[1][0])%26;
adj[1][0]=adj[1][0]<0?adj[1][0]+26:adj[1][0];
}else if (size==3){
adj[0][0]=((arr[1][1]*arr[2][2]-arr[2][1]*arr[1][2])%26);
adj[0][1]=(-(arr[1][0]*arr[2][2]-arr[2][0]*arr[1][2]))%26;
adj[0][2]=(arr[1][0]*arr[2][1]-arr[2][0]*arr[1][1])%26;
adj[1][0]=(-(arr[0][1]*arr[2][2]-arr[2][1]*arr[0][2]))%26;
adj[1][1]=(arr[0][0]*arr[2][2]-arr[2][0]*arr[0][2])%26;
adj[1][2]=(-(arr[0][0]*arr[2][1]-arr[2][0]*arr[0][1]))%26;
adj[2][0]=(arr[0][1]*arr[1][2]-arr[1][1]*arr[0][2])%26;
adj[2][1]=(-(arr[0][0]*arr[1][2]-arr[1][0]*arr[0][2]))%26;
adj[2][2]=(arr[0][0]*arr[1][1]-arr[1][0]*arr[0][1])%26;
for (int i=0; i<size; i++){
for (int j=0; j<size; j++){
if (adj[i][j]<0){
adj[i][j]+=26;
}
}
}
getTranspose(adj);
}
}
void getTranspose(int [][] adj){
int temp;
for (int i=0; i<size; i++){
for (int j=i+1; j<size; j++){
if (i!=j){
temp=adj[i][j];
adj[i][j]=adj[j][i];
adj[j][i]=temp;
}
}
}
}
void displayMatrix(int [][] mat){
for (int i=0; i< size; i++){
for (int j=0; j<size; j++){
System.out.print(mat[i][j] + "\t");
}
System.out.println();
}
}
void getKInverse(int [][] mat,int determinantInv, int [][] KInv ){
for (int i=0; i< size; i++){
for (int j=0; j<size; j++){
KInv[i][j]=(mat[i][j]*determinantInv)%26;
}
}
}
void createKeyMatrix(int[][]keyMatrix, String key){
//Creating matrix of key
int val=0;
for (int i=0; i<size; i++){
for (int j=0; j<size; j++){
keyMatrix[i][j]=alphabets.indexOf(key.charAt(val++));
}
}
}
String getDecryptedText(String msg){
msg=msg.toUpperCase();
int msgLen=msg.length()-size;
int mul=0;
String decrypted="";
int val=0;
//Encrypting 'size' number of characters at a time till all characters are encrypted by matrix multiplication
while (msgLen>=0){
String ch=msg.substring(val, val+size);
for (int i=0; i<size; i++){
mul=0;
for (int j=0; j<size; j++){
mul+= KInv[i][j]*alphabets.indexOf(ch.charAt(j));
}
mul=mul%26;
decrypted+=alphabets.charAt(mul);
}
val+=size;
msgLen-=size;
}
return decrypted;
}
void setSizeAndInitializeVars(int size){
this.size=size;
keyMatrix=new int[size][size];
adj=new int[size][size];
KInv=new int[size][size];
}
}