This repository has been archived by the owner on Aug 27, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCape.cs
281 lines (223 loc) · 10.4 KB
/
Cape.cs
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
/*
_____ _____ _____ _____
| |_____| |_____| |_____
|_____ | | | |_____ version 3.0
Cape Copyright (c) 2012-2018, Giovanni Blu Mitolo All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
//
// Cape is developed by @gioblu (Giovanni Blu Mitolo)
// The 3.0 version of Cape can be found at https://github.com/gioblu/Cape/releases/tag/3.0
// The current version of cape can be found at https://github.com/gioblu/Cape
// Other releases of Cape can be found at https://github.com/gioblu/Cape/releases
//
/*
CapeDotNet Copyright (C) 2018 Pharap (@Pharap)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
//
// A C# port of Cape 3.0, ported by @Pharap (Pharap)
// The latest release can be found at https://github.com/Pharap/CapeDotNet/releases/latest
// The current version can be found at https://github.com/Pharap/CapeDotNet
//
using System;
using System.Collections.Generic;
namespace Cape
{
public class Cape
{
private byte[] key;
private byte reducedKey;
private byte salt;
public Cape(byte[] key, byte salt)
{
this.key = new byte[key.Length];
Array.Copy(key, this.key, this.key.Length);
this.reducedKey = ComputeReducedKey(this.key);
this.salt = salt;
}
public byte Salt
{
get { return this.salt; }
set { this.salt = value; }
}
//
// Main functions
//
public byte[] Encrypt(byte[] source, byte initialisationVector)
{
if (source == null)
throw new ArgumentNullException("source");
byte[] result = new byte[source.Length + 1];
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int lastIndex = result.Length - 1;
// Encrypt initialisation vector
result[lastIndex] = (byte)(initialisationVector ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
// Encrypt data
for(int i = 0; i < source.Length; ++i)
result[i] = (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(i ^ saltedKey) % this.key.Length]);
return result;
}
public void Encrypt(byte[] source, byte[] destination, byte initialisationVector)
{
if (source == null)
throw new ArgumentNullException("source");
if (destination.Length <= source.Length)
throw new ArgumentException("destination must be at least 1 byte larger than source");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int lastIndex = destination.Length - 1;
// Encrypt initialisation vector
destination[lastIndex] = (byte)(initialisationVector ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
// Encrypt data
for (int i = 0; i < source.Length; ++i)
destination[i] = (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(i ^ saltedKey) % this.key.Length]);
}
public byte[] Decrypt(byte[] source)
{
if (source == null)
throw new ArgumentNullException("source");
byte[] result = new byte[source.Length - 1];
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int lastIndex = source.Length - 1;
// Decrypt initialisation vector
byte initialisationVector = (byte)(source[lastIndex] ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
// Decrypt data
for (int i = 0; i < source.Length; ++i)
result[i] = (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
return result;
}
public void Decrypt(byte[] source, byte[] destination)
{
if (source == null)
throw new ArgumentNullException("source");
if (destination.Length <= source.Length - 1)
throw new ArgumentException("destination length must be at least source length - 1");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int lastIndex = source.Length - 1;
// Decrypt initialisation vector
byte initialisationVector = (byte)(source[lastIndex] ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
// Decrypt data
for (int i = 0; i < source.Length; ++i)
destination[i] = (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
}
public byte[] Hash(byte[] source)
{
if (source == null)
throw new ArgumentNullException("source");
byte[] result = new byte[source.Length];
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
for (int i = 0; i < source.Length; i++)
{
byte a = (byte)(saltedKey ^ i);
result[i] = (byte)(source[i] ^ a ^ this.key[a % this.key.Length]);
}
return result;
}
public void Hash(byte[] source, byte[] destination)
{
if (source == null)
throw new ArgumentNullException("source");
if (destination == null)
throw new ArgumentNullException("destination");
if (destination.Length < source.Length)
throw new ArgumentNullException("destination length is less than source length");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
for (int i = 0; i < source.Length; i++)
{
byte a = (byte)(saltedKey ^ i);
destination[i] = (byte)(source[i] ^ a ^ this.key[a % this.key.Length]);
}
}
//
// Enumerable versions
//
// source must be an array because the iv is stored at the end rather than the start
// and enumerating an enumerable to reach its last element might
// render it unusable for the main encryption
public IEnumerable<byte> EnumerableEncrypt(byte[] source, byte initialisationVector)
{
if (source == null)
throw new ArgumentNullException("source");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
// Encrypt data
for (int i = 0; i < source.Length; ++i)
yield return (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(i ^ saltedKey) % this.key.Length]);
// Encrypt initialisation vector
int lastIndex = source.Length;
yield return (byte)(initialisationVector ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
}
public IEnumerable<byte> EnumerableEncrypt(IEnumerable<byte> source, byte initialisationVector)
{
if (source == null)
throw new ArgumentNullException("source");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
// Encrypt data
int i = 0;
foreach(var x in source)
{
yield return (byte)(x ^ initialisationVector ^ i ^ this.key[(i ^ saltedKey) % this.key.Length]);
++i;
}
// Encrypt initialisation vector
int lastIndex = i;
yield return (byte)(initialisationVector ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
}
public IEnumerable<byte> EnumerableDecrypt(byte[] source)
{
if (source == null)
throw new ArgumentNullException("source");
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int lastIndex = source.Length - 1;
// Decrypt initialisation vector
byte initialisationVector = (byte)(source[lastIndex] ^ lastIndex ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
// Decrypt data
for (int i = 0; i < source.Length; ++i)
yield return (byte)(source[i] ^ initialisationVector ^ i ^ this.key[(lastIndex ^ saltedKey) % this.key.Length]);
}
public IEnumerable<byte> EnumerableHash(IEnumerable<byte> source)
{
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
int i = 0;
foreach(var value in source)
{
byte a = (byte)(saltedKey ^ i);
yield return (byte)(value ^ a ^ this.key[a % this.key.Length]);
++i;
}
}
private static byte ComputeReducedKey(byte[] key)
{
if (key == null)
throw new ArgumentNullException("key");
byte result = 0;
for (int i = 0; i < key.Length; ++i)
result ^= (byte)(key[i] << (i % 8));
return result;
}
//
// Intentionally unused
//
private IEnumerable<byte> GenerateKeyStream()
{
byte saltedKey = (byte)(this.salt ^ this.reducedKey);
for (int i = 0; i < int.MaxValue; ++i)
yield return this.key[(i ^ saltedKey) % this.key.Length];
}
}
}