89 lines
3.2 KiB
C++
89 lines
3.2 KiB
C++
/*
|
|
PIP - Platform Independent Primitives
|
|
Digest algorithms
|
|
Ivan Pelipenko peri4ko@yandex.ru
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "pidigest_md2_p.h"
|
|
|
|
|
|
PIByteArray MD2::md2(const PIByteArray & in) {
|
|
constexpr int part_size = 16;
|
|
static constexpr uchar S[] = {
|
|
41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6, 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147,
|
|
43, 217, 188, 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24, 138, 23, 229, 18, 190, 78, 196, 214,
|
|
218, 158, 222, 73, 160, 251, 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63, 148, 194, 16, 137, 11, 34,
|
|
95, 33, 128, 127, 93, 154, 90, 144, 50, 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165, 181, 209,
|
|
215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210, 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
|
|
112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27, 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105,
|
|
52, 64, 126, 15, 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197, 234, 38, 44, 83, 13, 110, 133, 40,
|
|
132, 9, 211, 223, 205, 244, 65, 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123, 8, 12, 189, 177, 74,
|
|
120, 136, 149, 139, 227, 99, 232, 109, 233, 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228, 166, 119,
|
|
114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237, 31, 26, 219, 153, 141, 51, 159, 17, 131, 20};
|
|
|
|
PIByteArray msg = in;
|
|
int add_l = part_size - (msg.size() % part_size);
|
|
if (add_l <= 0) add_l += part_size;
|
|
for (int i = 0; i < add_l; ++i)
|
|
msg.append(uchar(add_l));
|
|
int parts = msg.size_s() / part_size;
|
|
// piCout << "add" << add_l << "=" << (in.size() + add_l) << msg.size() << parts;
|
|
uchar cs[16];
|
|
for (int i = 0; i < 16; ++i)
|
|
cs[i] = 0;
|
|
|
|
uchar l = 0;
|
|
|
|
for (int p = 0; p < parts; ++p) {
|
|
uchar * mb = (uchar *)msg.data(p * part_size);
|
|
for (int j = 0; j < 16; ++j) {
|
|
uchar c = mb[j];
|
|
cs[j] = cs[j] ^ S[c ^ l];
|
|
l = cs[j];
|
|
}
|
|
}
|
|
msg.append(cs, 16);
|
|
++parts;
|
|
|
|
uchar x[48];
|
|
for (int i = 0; i < 48; ++i)
|
|
x[i] = 0;
|
|
for (int p = 0; p < parts; ++p) {
|
|
uchar * mb = (uchar *)msg.data(p * part_size);
|
|
|
|
for (int j = 0; j < 16; ++j) {
|
|
uchar c = mb[j];
|
|
cs[j] = cs[j] ^ S[c ^ l];
|
|
l = cs[j];
|
|
}
|
|
|
|
for (int j = 0; j < 16; ++j) {
|
|
x[16 + j] = mb[j];
|
|
x[32 + j] = (x[16 + j] ^ x[j]);
|
|
}
|
|
|
|
uchar t = 0;
|
|
for (int j = 0; j < 18; ++j) {
|
|
for (int k = 0; k < 48; ++k) {
|
|
t = x[k] = (x[k] ^ S[t]);
|
|
}
|
|
t = (t + j) % 256;
|
|
}
|
|
}
|
|
|
|
return PIByteArray(x, 16);
|
|
}
|