-
Notifications
You must be signed in to change notification settings - Fork 32
/
Adfgvx.java
178 lines (145 loc) · 4.31 KB
/
Adfgvx.java
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
package cryptography.ciphers.adfgvx;
import java.awt.Point;
import cryptography.Mode;
import cryptography.encoding.vicSequencing.VICSequencing;
public class Adfgvx {
private static String[][] substitute;
private static String[] code = {"A", "D", "F", "G", "V", "X"};
public static void main(String[] args) {
}
// KEY size must be < 10
// public static String adfgvx(String inputText, String key, final Mode mode) {
public static String adfgvx(String inputText, String key1, String key2, final Mode mode) {
if (key1.length() >= 10 || key2.length() >= 10) {
return "Key size larger than 10, choose smaller key";
}
try {
inputText = inputText.toLowerCase();
String output = null;
String substitute[][] = polibiusSquare(key1);
if (mode == Mode.ENCRYPT) {
Point p;
StringBuilder res = new StringBuilder();
inputText = inputText.toLowerCase().replace("/[^a-z0-9]/g", "");
for (int i = 0; i < inputText.length(); i++) {
if (inputText.charAt(i) == ' ') {
res.append(inputText.charAt(i));
} else {
p = findPos(inputText.charAt(i));
res.append(code[p.x]).append(code[p.y]);
}
}
output = res.toString();
return columnarTransposition(output, key2);
}
if (mode == Mode.DECRYPT) {
StringBuilder res = new StringBuilder();
Point p;
String input = reverseColTranspose(inputText, key2);
for (int i = 0; i < input.length(); ) {
if (input.charAt(i) == ' ') {
res.append(input.charAt(i));
i++;
} else {
String codeInt = "ADFGVX".toLowerCase();
p = new Point(codeInt.indexOf(input.substring(i, i + 1)),
codeInt.indexOf(input.substring(i + 1, i + 2)));
res.append(substitute[p.x][p.y]);
i = i + 2;
}
}
output = res.toString().toUpperCase();
}
return output;
} catch (Exception e) {
return e.toString();
}
}
private static String[][] polibiusSquare(String key) {
substitute = new String[6][6];
String temp = key + "abcdefghijklmnopqrstuvwxyz0123456789";
String result = "";
for (int i = 0; i < temp.length(); i++) {
if (!result.contains(String.valueOf(temp.charAt(i)))) {
result += String.valueOf(temp.charAt(i));
}
}
for (int a = 0; a < 6; a++) {
for (int b = 0; b < 6; b++) {
substitute[a][b] = String.valueOf(result.charAt(a * 6 + b));
}
}
return substitute;
}
private static Point findPos(char c) {
boolean found = false;
int i = 0;
int j = 0;
while (!found && i < substitute.length) {
j = 0;
while (!found && j < substitute[i].length) {
if (substitute[i][j].indexOf(c) == 0)
found = true;
else
j++;
}
if (!found)
i++;
}
return new Point(i, j);
}
private static String columnarTransposition(String text, String key) {
String transposeKey = VICSequencing.encode(key.toUpperCase());
final int row = (int) Math.ceil((float) text.length() / (float) key.length());
String curr;
String[] temp = new String[key.length()];
for (int a = 0; a < transposeKey.length(); a++) {
int index = Character.getNumericValue(transposeKey.charAt(a));
curr = "";
for (int b = 0; b < row; b++) {
if (b * key.length() + a < text.length()) {
curr += text.charAt(b * key.length() + a);
}
}
temp[index - 1] = curr;
}
String res = "";
for (int a = 0; a < key.length(); a++) {
res += temp[a];
}
return res;
}
private static String reverseColTranspose(String text, String key) {
final int row = (int) Math.ceil((float) text.length() / (float) key.length());
final int col = key.length();
int toPad = row * col - text.length();
String transposeKey = VICSequencing.encode(key.toUpperCase());
String[] temp = new String[col];
int textPointer = 0;
for (int a = 1; a <= col; a++) {
for (int b = 0; b < col; b++) {
int index = Character.getNumericValue(transposeKey.charAt(b));
if (a == index) {
String curr = "";
if (b >= col - toPad) {
curr = text.substring(textPointer, textPointer + row - 1) + " ";
textPointer += row - 1;
} else {
curr = text.substring(textPointer, textPointer + row);
textPointer += row;
}
temp[b] = curr;
}
}
}
String res = "";
for (int a = 0; a < row; a++) {
for (int b = 0; b < col; b++) {
if (temp[b].charAt(a) != ' ') {
res += temp[b].charAt(a);
}
}
}
return res;
}
}