blob: 701b30290f7795a6bbafae69b5a0f2cb1d54bff4 (
plain)
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
|
#include <stdlib.h>
#include <string.h>
static const char base32_lookup[] = "abcdefghijklmnopqrstuvwxyz234567";
/* Find the first instance of a character in `subject` which is not in the
* base32 alphabet.
* Returns the offset into `subject` of the first such character, or -1
* if no such character exists in the string
*/
int
check_base32(char *subject) {
size_t offset = 0;
if ((offset = strspn(subject, base32_lookup)) != strlen(subject)) {
return offset;
}
return -1;
}
/* Simple and reliable base32 algorithm - "old trusty"
* Note: This is not a general base32 algorithm; it outputs only the
* first 16 base32 symbols of the input buffer, using only the first
* 20 bytes of that buffer.
*/
void
onion_base32(char output[16], unsigned char sum[20]) {
size_t c = 0;
int i = 0;
for (i = 0; i < 10; i+=5) {
output[c++] = base32_lookup[sum[i] >> 3];
output[c++] = base32_lookup[((sum[i] & 0x07) << 2) | (sum[i+1] >> 6)];
output[c++] = base32_lookup[(sum[i+1] >> 1) & 0x1F];
output[c++] = base32_lookup[((sum[i+1] & 1) << 4) | (sum[i+2] >> 4)];
output[c++] = base32_lookup[((sum[i+2] & 0x0F) << 1) | ((sum[i+3] & 0x80) >> 7)];
output[c++] = base32_lookup[(sum[i+3] >> 2) & 0x1F];
output[c++] = base32_lookup[((sum[i+3] & 0x03) << 3) | (sum[i+4] >> 5)];
output[c++] = base32_lookup[sum[i+4] & 0x1F];
}
}
/* Helper function for onion_base32_dec. Decodes a single base32 character
* into its binary equivalent
*/
unsigned char
base32_dec_single(char b) {
if (b >= 'a' && b <= 'z')
return b - 'a';
else if (b >= '2' && b <= '7')
return b - '2' + 26;
return 0;
}
/* Simple algorithm to decode a 16-byte base32 sequence to the 10 bytes
* it represents, placing the result in dec */
void
onion_base32_dec(unsigned char dec[10], char base32[16])
{
size_t c = 0;
size_t i = 0;
for (i = 0; i < 16; i += 8) {
dec[c++] = base32_dec_single(base32[i]) << 3 | base32_dec_single(base32[i+1]) >> 2;
dec[c++] = base32_dec_single(base32[i+1]) << 6 | base32_dec_single(base32[i+2]) << 1 | base32_dec_single(base32[i+3]) >> 4;
dec[c++] = base32_dec_single(base32[i+3]) << 4 | base32_dec_single(base32[i+4]) >> 1;
dec[c++] = base32_dec_single(base32[i+4]) << 7 | base32_dec_single(base32[i+5]) << 2 | base32_dec_single(base32[i+6]) >> 3;
dec[c++] = base32_dec_single(base32[i+7]) | base32_dec_single(base32[i+6]) << 5;
}
}
|
