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
|
/*
* Copyright 2010-2016, Tarantool AUTHORS, please see AUTHORS file.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* 1. Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "scramble.h"
#include "third_party/sha1.h"
#include "third_party/base64.h"
#include <string.h>
#include <stdio.h>
static void
xor(unsigned char *to, unsigned const char *left,
unsigned const char *right, uint32_t len)
{
const uint8_t *end = to + len;
while (to < end)
*to++= *left++ ^ *right++;
}
void
scramble_prepare(void *out, const void *salt, const void *password,
int password_len)
{
unsigned char hash1[SCRAMBLE_SIZE];
unsigned char hash2[SCRAMBLE_SIZE];
SHA1_CTX ctx;
SHA1Init(&ctx);
SHA1Update(&ctx, password, password_len);
SHA1Final(hash1, &ctx);
SHA1Init(&ctx);
SHA1Update(&ctx, hash1, SCRAMBLE_SIZE);
SHA1Final(hash2, &ctx);
SHA1Init(&ctx);
SHA1Update(&ctx, salt, SCRAMBLE_SIZE);
SHA1Update(&ctx, hash2, SCRAMBLE_SIZE);
SHA1Final(out, &ctx);
xor(out, hash1, out, SCRAMBLE_SIZE);
}
void
scramble_reencode(void *out, const void *in, const void *salt,
const void *msalt, const void *hash2)
{
unsigned char hash1[SCRAMBLE_SIZE];
unsigned char sh[SCRAMBLE_SIZE];
SHA1_CTX ctx;
SHA1Init(&ctx);
SHA1Update(&ctx, salt, SCRAMBLE_SIZE);
SHA1Update(&ctx, hash2, SCRAMBLE_SIZE);
SHA1Final(sh, &ctx);
xor(hash1, in, sh, SCRAMBLE_SIZE);
SHA1Init(&ctx);
SHA1Update(&ctx, msalt, SCRAMBLE_SIZE);
SHA1Update(&ctx, hash2, SCRAMBLE_SIZE);
SHA1Final(out, &ctx);
xor(out, hash1, out, SCRAMBLE_SIZE);
}
int
scramble_check(const void *scramble, const void *salt, const void *hash2)
{
SHA1_CTX ctx;
unsigned char candidate_hash2[SCRAMBLE_SIZE];
SHA1Init(&ctx);
SHA1Update(&ctx, salt, SCRAMBLE_SIZE);
SHA1Update(&ctx, hash2, SCRAMBLE_SIZE);
SHA1Final(candidate_hash2, &ctx);
xor(candidate_hash2, candidate_hash2, scramble, SCRAMBLE_SIZE);
/*
* candidate_hash2 now supposedly contains hash1, turn it
* into hash2
*/
SHA1Init(&ctx);
SHA1Update(&ctx, candidate_hash2, SCRAMBLE_SIZE);
SHA1Final(candidate_hash2, &ctx);
return memcmp(hash2, candidate_hash2, SCRAMBLE_SIZE);
}
void
password_prepare(const char *password, int len, char *out, int out_len)
{
unsigned char hash2[SCRAMBLE_SIZE];
SHA1_CTX ctx;
SHA1Init(&ctx);
SHA1Update(&ctx, (const unsigned char *) password, len);
SHA1Final(hash2, &ctx);
SHA1Init(&ctx);
SHA1Update(&ctx, hash2, SCRAMBLE_SIZE);
SHA1Final(hash2, &ctx);
base64_encode((char *) hash2, SCRAMBLE_SIZE, out, out_len, 0);
}
|