-
Notifications
You must be signed in to change notification settings - Fork 9
/
day_05a.cpp
308 lines (286 loc) · 9.04 KB
/
day_05a.cpp
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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
#include <algorithm>
#include <array>
#include <fstream>
#include <iostream>
#include <ranges>
#include <string>
#include <vector>
#include <cmath>
#include <cstdio>
#include <memory>
#include <stdexcept>
#include <bitset>
#include <cassert>
#include <sstream>
// Bytes of the message need to be ordered in lowest to highest significance hence the swapping of orders. Note that this does not apply to the length added to the end of the message
// Also note that this assumes that the object to be hashed is made of complete bytes which is true given that a sring is a collection of chars which are wach one byte.
constexpr std::array<uint32_t, 64> createTableOfConstants() {
std::array<uint32_t, 64> table {};
float multiplication_factor = std::pow(2, 32);
for (std::size_t i = 0; i < table.size(); i++) {
// std::cout << std::dec << i << " | " << table.size() << " | " << bool(i < table.size()) << '\n';
table[i] = uint32_t(std::fabs(std::sin(i + 1)) * multiplication_factor);
// std::cout << std::hex << table[i] << '\n';
}
return table;
};
std::vector<bool> convert_str_to_bits(const std::string& s) {
// if (s == "abc1803305") std::cout << "Converting " << s << " to bits." << '\n';
std::vector<bool> s_bits;
s_bits.reserve(s.size() * 8);
for (const auto& c : s) {
std::vector<bool> temp;
auto i = uint8_t(c);
while(i > 0) {
temp.push_back((i % 2 == 0 ? false : true));
i /= 2;
}
while (temp.size() < 8) temp.push_back(false);
std::reverse(temp.begin(), temp.end());
for (const auto& ele :temp) {
// if (s == "abc1803305") std::cout << ele;
s_bits.push_back(ele);
}
// if (s == "abc1803305") std::cout << '\n';
}
return s_bits;
}
std::vector<bool> convertDecimalToBinary(uint32_t n) {
std::vector<bool> binary;
while(n > 0) {
binary.push_back(n%2);
n/=2;
}
while(binary.size() < 32) {
binary.push_back(false);
}
std::reverse(binary.begin(), binary.end());
return binary;
}
void padding(std::vector<bool>& s) {
const auto original_length = s.size();
// std::cout << "Original length: " << original_length << '\n';
const std::size_t size = s.size() % 512;
// std::cout << "size: " << size << '\n';
const auto rem = 512 - size;
// std::cout << "rem: " << rem << '\n';
std::size_t padding = rem;
if (rem < 64) {
padding += 512;
}
padding -= 64;
// std::cout << "padding: " << padding << '\n';
s.push_back(true);
for (std::size_t idx = 0; idx < padding - 1; idx++) {
s.push_back(false);
}
for (int i = 0; i < 64; i++) {
s.push_back(false);
}
const auto binary = convertDecimalToBinary(original_length);
// std::cout << binary.size() << '\n';
for(std::size_t i = 0; i < binary.size(); i++) {
s[s.size() + i - binary.size()] = binary[i];
}
// std::cout << s.size() << '\n';
}
uint32_t convertBinaryToDecimal(const std::vector<bool>& binary) {
assert(binary.size() == 32);
if (binary.empty()) return 0;
uint32_t decimal = 0;
uint32_t base = 1;
for (auto i = binary.size()-1; i > 0; i--) {
decimal += binary[i] * base;
base *= 2;
}
decimal += binary[0] * base;
return decimal;
}
std::vector<std::vector<uint32_t>> convert_to_blocks(std::vector<bool>& s_bits) {
std::vector<std::vector<uint32_t>> blocks;
for (std::size_t i = 0; i < s_bits.size()/512; i++) {
std::vector<uint32_t> block;
for (int j = 0; j < 16; j++) {
std::vector<bool> word;
for (int k = 0; k < 32; k++) {
word.push_back(s_bits[i * 512 + j * 32 + k]);
}
std::vector<bool> word_swapped(32, false);
for (int k = 0; k < 32; k++) {
word_swapped[(3 - (k / 8)) * 8 + (k % 8)] = word[k];
}
if (j != 15 && j != 14) word = word_swapped;
// for (const auto ele : word) {
// std::cout << ele;
// }
// std::cout << '\n';
// std::cout << convertBinaryToDecimal(word) << '\n';
block.push_back(convertBinaryToDecimal(word));
}
std::swap(block[block.size()-1], block[block.size()-2]);
blocks.push_back(block);
}
return blocks;
}
uint32_t leftrotate(const uint32_t& a, const uint32_t& b) {
return (a << b)|(a >> (32 - b));
}
std::array<uint32_t, 4> md5(const std::string& s_str) {
constexpr uint32_t A_prime = 0x67452301;
constexpr uint32_t B_prime = 0xefcdab89;
constexpr uint32_t C_prime = 0x98badcfe;
constexpr uint32_t D_prime = 0x10325476;
uint32_t A = 0;
uint32_t B = 0;
uint32_t C = 0;
uint32_t D = 0;
auto F = [&B, &C, &D](){ return ((B & C) | (~B & D)); };
auto G = [&B, &C, &D](){ return ((B & D) | (C & ~D)); };
auto H = [&B, &C, &D]() { return (B ^ C ^ D); };
auto I = [&B, &C, &D]() { return (C ^ (B | ~D)); };
constexpr std::array<uint32_t, 64> K = createTableOfConstants();
constexpr std::array<uint32_t, 64> s = {{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 }};
auto s_bits = convert_str_to_bits(s_str);
// for (const auto ele : s_bits) {
// std::cout << ele;
// }
// std::cout << '\n';
padding(s_bits);
// for (const auto ele : s_bits) {
// std::cout << ele;
// }
// std::cout << '\n';
assert(s_bits.size() == 512);
auto blocks = convert_to_blocks(s_bits);
uint32_t AA = A_prime;
uint32_t BB = B_prime;
uint32_t CC = C_prime;
uint32_t DD = D_prime;
for (auto& block : blocks) {
// std::cout << "block: ";
// for (const auto ele : block) {
// std::cout << ele;
// }
// std::cout << '\n';
A = AA;
B = BB;
C = CC;
D = DD;
for (uint32_t i = 0; i < 64; i++) {
uint32_t g = 0;
uint32_t ans = 0;
if (i < 16) {
ans = F();
g = i;
} else if (i >= 16 && i < 32) {
ans = G();
g = (5 * i + 1) % 16;
} else if (i >= 32 && i < 48) {
ans = H();
g = (3 * i + 5) % 16;
} else if (i >= 48 && i < 64) {
ans = I();
g = (7 * i) % 16;
}
// std::cout << std::dec << i<< ": " << A << " | " << B << " | " << C << " | " << D << " | " <<
// ans << " | " << block[g] << " | " << s[i] << " | " << K[i] << '\n';
auto temp = D;
D = C;
C = B;
// std::cout << leftrotate(A+ans+K[i]+block[g], s[i]) << '\n';
B = B + leftrotate(A+ans+K[i]+block[g], s[i]);
A = temp;
// std::cout << std::dec << A << " | " << B << " | " << C << " | " << D << '\n';
// exit(0);
}
AA += A;
BB += B;
CC += C;
DD += D;
}
const auto t = [](uint32_t n) {
const std::vector<bool> temp = convertDecimalToBinary(n);
assert(temp.size() == 32);
auto temp2 = temp;
for (int k = 0; k < 32; k++) {
temp2[(3 - (k / 8)) * 8 + (k % 8)] = temp[k];
}
assert(temp2.size() == 32);
return convertBinaryToDecimal(temp2);
};
AA = t(AA);
BB = t(BB);
CC = t(CC);
DD = t(DD);
// std::cout << std::hex << AA << BB << CC << DD << '\n';
return std::array<uint32_t, 4>{{AA,BB, CC, DD}};
// const auto leading_zeros = []() {
// int i = 0;
// while ()
// };
// return std::to_string(AA) + std::to_string(BB) + std::to_string(CC) + std::to_string(DD);
}
int main(int argc, char* argv[]) {
// std::string input = "Welcome";
// if (argc > 1) {
// input = argv[1];
// }
// std::vector<bool> v;
// v.push_back(true);
// v.push_back(false);
// v.push_back(true);
// v.push_back(false);
// v.push_back(false);
// v.push_back(false);
// v.push_back(false);
// v.push_back(true);
// v.push_back(true);
// v.push_back(true);
// // std::cout << "B2D: " << convertBinaryToDecimal(v) << '\n';
// std::cout << "Binary of input: ";
// for (std::size_t i = 0; i < input.size(); ++i)
// {
// std::cout << std::bitset<8>(input.c_str()[i]);
// }
// std::cout << '\n';
std::string input = "../input/day_05_input";
if (argc > 1) {
input = argv[1];
}
std::ifstream file(input);
std::string door_id;
std::getline(file, door_id);
std::string password = "";
std::size_t i = 0;
// std::cout << std::hex << md5("abc1803305")[0] << '\n';
// std::cout << std::dec << (md5("abc1803305")[0] <= 0x00000fff) << '\n';
// exit(0);
while(password.size() < 8) {
// if (i%10000 == 0) {
// std::cout << i << '\n';
// }
const auto to_hash = door_id + std::to_string(i);
const auto hash_parts = md5(to_hash);
if (hash_parts[0] <= 0x00000fff) {
std::cout << std::hex << 0x00000fff << ' ';
for (const auto ele : hash_parts) {
std::cout << std::hex << ele << ' ';
}
std::cout << '\n';
std::cout << std::hex << to_hash << ": " << std::hex << hash_parts[0] << '\n';
std::cout << (hash_parts == md5(to_hash)) << '\n';;
// exit(0);
if (hash_parts[0] <= 0x000000ff) {
password.push_back('0');
} else {
std::stringstream stream;
stream << std::hex << hash_parts[0] << std::dec;
std::string result( stream.str() );
password.push_back(result[0]);
}
}
i++;
}
std::cout << password << '\n';
return 0;
}