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
|
/* Starshatter: The Open Source Project
Copyright (c) 2021-2024, Starshatter: The Open Source Project Contributors
Copyright (c) 2011-2012, Starshatter OpenSource Distribution Contributors
Copyright (c) 1997-2006, Destroyer Studios LLC.
AUTHOR: John DiCamillo
OVERVIEW
========
Simple Encryption / Decryption class
*/
#include "Encrypt.h"
#include "Utils.h"
// +--------------------------------------------------------------------+
static long k[4] = {
0x3B398E26,
0x40C29501,
0x614D7630,
0x7F59409A
};
static void encypher(long* v)
{
DWORD y=v[0];
DWORD z=v[1];
DWORD sum=0;
DWORD delta=0x9e3779b9; // a key schedule constant
DWORD n=32; // num iterations
while (n-->0) { // basic cycle start
sum += delta;
y += (z<<4)+k[0] ^ z+sum ^ (z>>5)+k[1];
z += (y<<4)+k[2] ^ y+sum ^ (y>>5)+k[3];
}
v[0]=y;
v[1]=z;
}
static void decypher(long* v)
{
DWORD y=v[0];
DWORD z=v[1];
DWORD sum=0;
DWORD delta=0x9e3779b9; // a key schedule constant
DWORD n=32; // num iterations
sum=delta<<5;
while (n-->0) {
z-= (y<<4)+k[2] ^ y+sum ^ (y>>5)+k[3];
y-= (z<<4)+k[0] ^ z+sum ^ (z>>5)+k[1];
sum-=delta;
}
v[0]=y;
v[1]=z;
}
// +-------------------------------------------------------------------+
Text
Encryption::Encrypt(Text block)
{
int len = block.length();
if (len < 1)
return Text();
// pad to eight byte chunks
if (len & 0x7) {
len /= 8;
len *= 8;
len += 8;
}
BYTE* work = new BYTE[len];
ZeroMemory(work, len);
CopyMemory(work, block.data(), block.length());
long* v = (long*) work;
for (int i = 0; i < len/8; i++) {
encypher(v);
v += 2;
}
Text cypher((const char*) work, len);
delete [] work;
return cypher;
}
// +-------------------------------------------------------------------+
Text
Encryption::Decrypt(Text block)
{
int len = block.length();
if (len & 0x7) {
Print("WARNING: attempt to decrypt odd length block (len=%d)\n", len);
return Text();
}
BYTE* work = new BYTE[len];
CopyMemory(work, block.data(), len);
long* v = (long*) work;
for (int i = 0; i < len/8; i++) {
decypher(v);
v += 2;
}
Text clear((const char*) work, len);
delete [] work;
return clear;
}
// +-------------------------------------------------------------------+
static const char* codes = "abcdefghijklmnop";
Text
Encryption::Encode(Text block)
{
int len = block.length() * 2;
char* work = new char[len + 1];
for (int i = 0; i < block.length(); i++) {
BYTE b = (BYTE) (block.data()[i]);
work[2*i] = codes[b>>4 & 0xf];
work[2*i+1] = codes[b & 0xf];
}
work[len] = 0;
Text code(work, len);
delete [] work;
return code;
}
// +-------------------------------------------------------------------+
Text
Encryption::Decode(Text block)
{
int len = block.length() / 2;
char* work = new char[len + 1];
for (int i = 0; i < len; i++) {
char u = block[2*i];
char l = block[2*i + 1];
work[i] = (u - codes[0]) << 4 |
(l - codes[0]);
}
work[len] = 0;
Text clear(work, len);
delete [] work;
return clear;
}
|
