| 42 | |
| 43 | |
| 44 | void MD2::Update(const byte* data, word32 len) |
| 45 | { |
| 46 | |
| 47 | static const byte S[256] = |
| 48 | { |
| 49 | 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6, |
| 50 | 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188, |
| 51 | 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24, |
| 52 | 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251, |
| 53 | 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63, |
| 54 | 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50, |
| 55 | 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165, |
| 56 | 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210, |
| 57 | 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157, |
| 58 | 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27, |
| 59 | 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15, |
| 60 | 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197, |
| 61 | 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65, |
| 62 | 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123, |
| 63 | 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233, |
| 64 | 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228, |
| 65 | 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237, |
| 66 | 31, 26, 219, 153, 141, 51, 159, 17, 131, 20 |
| 67 | }; |
| 68 | |
| 69 | while (len) { |
| 70 | word32 L = (PAD_SIZE - count_) < len ? (PAD_SIZE - count_) : len; |
| 71 | memcpy(buffer_.get_buffer() + count_, data, L); |
| 72 | count_ += L; |
| 73 | data += L; |
| 74 | len -= L; |
| 75 | |
| 76 | if (count_==PAD_SIZE) { |
| 77 | count_ = 0; |
| 78 | memcpy(X_.get_buffer() + PAD_SIZE, buffer_.get_buffer(), PAD_SIZE); |
| 79 | byte t = C_[15]; |
| 80 | |
| 81 | int i; |
| 82 | for(i = 0; i < PAD_SIZE; i++) { |
| 83 | X_[32 + i] = X_[PAD_SIZE + i] ^ X_[i]; |
| 84 | t = C_[i] ^= S[buffer_[i] ^ t]; |
| 85 | } |
| 86 | |
| 87 | t=0; |
| 88 | for(i = 0; i < 18; i++) { |
| 89 | for(int j = 0; j < X_SIZE; j += 8) { |
| 90 | t = X_[j+0] ^= S[t]; |
| 91 | t = X_[j+1] ^= S[t]; |
| 92 | t = X_[j+2] ^= S[t]; |
| 93 | t = X_[j+3] ^= S[t]; |
| 94 | t = X_[j+4] ^= S[t]; |
| 95 | t = X_[j+5] ^= S[t]; |
| 96 | t = X_[j+6] ^= S[t]; |
| 97 | t = X_[j+7] ^= S[t]; |
| 98 | } |
| 99 | t = (t + i) & 0xFF; |
| 100 | } |
| 101 | } |