-
Notifications
You must be signed in to change notification settings - Fork 1
/
rabbitcheck.c
260 lines (227 loc) · 7.9 KB
/
rabbitcheck.c
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <pthread.h>
#define ANSI_COLOR_RED "\x1b[31m"
#define ANSI_COLOR_GREEN "\x1b[32m"
#define ANSI_COLOR_YELLOW "\x1b[33m"
#define ANSI_COLOR_BLUE "\x1b[34m"
#define ANSI_COLOR_MAGENTA "\x1b[35m"
#define ANSI_COLOR_CYAN "\x1b[36m"
#define ANSI_COLOR_RESET "\x1b[0m"
#define MAX_WORD_SIZE 64
#define MD5_SIZE 16
// leftrotate function definition
#define LEFTROTATE(x, c) (((x) << (c)) | ((x) >> (32 - (c))))
const uint32_t k[64] = {
0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee ,
0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501 ,
0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be ,
0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 ,
0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa ,
0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8 ,
0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed ,
0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a ,
0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c ,
0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70 ,
0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05 ,
0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 ,
0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039 ,
0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1 ,
0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1 ,
0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 };
// r specifies the per-round shift amounts
const uint32_t r[] = {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21};
int nproc = 0;
FILE *fp;
char buff[MAX_WORD_SIZE];
unsigned int wlen = 0;
int n=0;
typedef struct {
int spos;
int psize;
int tsize;
char **earr;
} thread_arg_t;
void to_bytes(uint32_t val, uint8_t *bytes){
bytes[0] = (uint8_t) val;
bytes[1] = (uint8_t) (val >> 8);
bytes[2] = (uint8_t) (val >> 16);
bytes[3] = (uint8_t) (val >> 24);
}
uint32_t to_int32(const uint8_t *bytes){
return (uint32_t) bytes[0]
| ((uint32_t) bytes[1] << 8)
| ((uint32_t) bytes[2] << 16)
| ((uint32_t) bytes[3] << 24);
}
void md5(const uint8_t *initial_msg, size_t initial_len, uint8_t *digest) {
// These vars will contain the hash
uint32_t h0, h1, h2, h3;
// Message (to prepare)
uint8_t *msg = NULL;
size_t new_len, offset;
uint32_t w[16];
uint32_t a, b, c, d, i, f, g, temp;
// Initialize variables - simple count in nibbles:
h0 = 0x67452301;
h1 = 0xefcdab89;
h2 = 0x98badcfe;
h3 = 0x10325476;
//Pre-processing:
//append "1" bit to message
//append "0" bits until message length in bits ≡ 448 (mod 512)
//append length mod (2^64) to message
for (new_len = initial_len + 1; new_len % (512/8) != 448/8; new_len++)
;
msg = (uint8_t*)malloc(new_len + 8);
memcpy(msg, initial_msg, initial_len);
msg[initial_len] = 0x80; // append the "1" bit; most significant bit is "first"
for (offset = initial_len + 1; offset < new_len; offset++)
msg[offset] = 0; // append "0" bits
// append the len in bits at the end of the buffer.
to_bytes(initial_len*8, msg + new_len);
// initial_len>>29 == initial_len*8>>32, but avoids overflow.
to_bytes(initial_len>>29, msg + new_len + 4);
// Process the message in successive 512-bit chunks:
//for each 512-bit chunk of message:
for(offset=0; offset<new_len; offset += (512/8)) {
// break chunk into sixteen 32-bit words w[j], 0 ≤ j ≤ 15
for (i = 0; i < 16; i++)
w[i] = to_int32(msg + offset + i*4);
// Initialize hash value for this chunk:
a = h0;
b = h1;
c = h2;
d = h3;
// Main loop:
for(i = 0; i<64; i++) {
if (i < 16) {
f = (b & c) | ((~b) & d);
g = i;
} else if (i < 32) {
f = (d & b) | ((~d) & c);
g = (5*i + 1) % 16;
} else if (i < 48) {
f = b ^ c ^ d;
g = (3*i + 5) % 16;
} else {
f = c ^ (b | (~d));
g = (7*i) % 16;
}
temp = d;
d = c;
c = b;
b = b + LEFTROTATE((a + f + k[i] + w[g]), r[i]);
a = temp;
}
// Add this chunk's hash to result so far:
h0 += a;
h1 += b;
h2 += c;
h3 += d;
}
// cleanup
free(msg);
//var char digest[16] := h0 append h1 append h2 append h3 //(Output is in little-endian)
to_bytes(h0, digest);
to_bytes(h1, digest + 4);
to_bytes(h2, digest + 8);
to_bytes(h3, digest + 12);
}
void printHex(unsigned char *digest){
int i = 0;
for(i=0;i<16;i++){
printf("%02x",digest[i]);
}
}
//unsigned int checkHashes(int spos,int psize,int tsize,char **earr){
void *checkHashes(void *context){
thread_arg_t *targs = context;
unsigned char easyhash[MD5_SIZE] = {0xE4, 0x82, 0x0b, 0x45, 0xd2, 0x27, 0x7f, 0x38, 0x44, 0xea, 0xc6, 0x6c, 0x90, 0x3e, 0x84, 0xbe};
unsigned char mediumhash[MD5_SIZE] = {0x23, 0x17, 0x0a, 0xcc, 0x09, 0x7c, 0x24, 0xed, 0xb9, 0x8f, 0xc5, 0x48, 0x8a, 0xb0, 0x33, 0xfe};
unsigned char hardhash[MD5_SIZE] = {0x66, 0x5e, 0x5b, 0xcb, 0x0c, 0x20, 0x06, 0x2f, 0xe8, 0xab, 0xaa, 0xf4, 0x62, 0x8b, 0xb1, 0x54};
int x,y,z;
for(x=targs->spos;x< targs->spos + targs->psize;x++){
for(y=0;y<targs->tsize;y++){
for(z=0;z<targs->tsize;z++){
size_t sz = snprintf(NULL,0,"%s %s %s",strtok(targs->earr[x],"\n"),strtok(targs->earr[y],"\n"),strtok(targs->earr[z],"\n"));
if(sz<22 && sz >19){
char *sentence = (char *)malloc(sz+1);
snprintf(sentence,sz+1,"%s %s %s",strtok(targs->earr[x],"\n"),strtok(targs->earr[y],"\n"),strtok(targs->earr[z],"\n"));
unsigned char digest[MD5_SIZE];
md5(sentence, sz, digest);
//printf("%s = ",sentence);
//printHex(digest);
//printf("\n");
if (memcmp(digest, easyhash, MD5_SIZE)==0){
printf("%d %d %d"ANSI_COLOR_GREEN" EASY HASH FOUND : %s"ANSI_COLOR_RESET"\n",x,y,z,sentence);
}
else if (memcmp(digest, mediumhash, MD5_SIZE)==0){
printf("%d %d %d"ANSI_COLOR_YELLOW" MEDIUM HASH FOUND : %s"ANSI_COLOR_RESET"\n",x,y,z,sentence);
}
else if (memcmp(digest, hardhash, MD5_SIZE)==0){
printf("%d %d %d"ANSI_COLOR_RED" HARD HASH FOUND : %s"ANSI_COLOR_RESET"\n",x,y,z,sentence);
}
free(sentence);
}
}
}
}
pthread_exit(0);
}
int main(int argc, char **argv){
if(argc!=3){
printf("Incorrect arguments number:\n");
printf("\t %s [wordlist] [nthreads]\n",argv[0]);
exit(-1);
}
nproc = atoi(argv[2]);
if(nproc==1){
printf("Minium thread number is 2.\n");
exit(-1);
}
fp = fopen(argv[1], "r");
while(fgets(buff, MAX_WORD_SIZE, (FILE*)fp)!=NULL) wlen++;
printf("wordlist \"%s\" has %d words\n",argv[1],wlen);
fclose(fp);
char *words[wlen];
fp = fopen(argv[1], "r");
unsigned int index = 0;
while(fgets(buff, MAX_WORD_SIZE, (FILE*)fp)!=NULL){
words[index] = (char *) malloc(strlen(buff));
strcpy(words[index],buff);
index++;
}
fclose(fp);
int spos = 0;
int chunksize = wlen/nproc;
pthread_t thid[nproc];
thread_arg_t targsArray[nproc];
int err;
for(n=0;n<nproc;n++){
targsArray[n].spos = spos;
if(n==nproc-1){
targsArray[n].psize = wlen -(chunksize*(nproc-1));
}else{
targsArray[n].psize = chunksize;
}
targsArray[n].tsize = wlen;
targsArray[n].earr = words;
printf("Starting thread %d, computing array from %d to %d\n",n,targsArray[n].spos,targsArray[n].spos+targsArray[n].psize);
err = pthread_create(&(thid[n]), NULL, checkHashes, &targsArray[n]);
if (err != 0) printf("\n"ANSI_COLOR_RED"can't create thread %d: %s"ANSI_COLOR_RESET, n, strerror(err));
spos = spos + chunksize;
}
for(n=0;n<nproc;n++){
pthread_join(thid[n], NULL);
}
for(n=0;n<wlen;n++){
free(words[n]);
}
return 0;
}