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
|
/*
* OTP Utilities
* Copyright (C) 2022 David M. Syzdek <david@syzdek.net>.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of David M. Syzdek nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 DAVID M SYZDEK 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.
*/
/*
* @file lib/libotputil/lrfc2289-otp.c
*/
#define _LIB_LIBOTPUTIL_LRFC2289_OTP_H 1
#include "lrfc2289-otp.h"
///////////////
// //
// Headers //
// //
///////////////
#pragma mark - Headers
#include <errno.h>
#include <stdarg.h>
#include <string.h>
#include <strings.h>
#include <stdlib.h>
#include <ctype.h>
#include <openssl/evp.h>
#include <openssl/hmac.h>
#include "lmisc.h"
//////////////////
// //
// Prototypes //
// //
//////////////////
#pragma mark - Prototypes
/////////////////
// //
// Functions //
// //
/////////////////
#pragma mark - Functions
int
otputil_otp_code(
const char * otp_pass,
const char * otp_seed,
int otp_seq,
int otp_hash,
uint64_t * otp_resultp )
{
unsigned char secret[OTPUTIL_OTP_PASS_MAX_LEN+OTPUTIL_OTP_SEED_MAX_LEN+1];
size_t len;
const EVP_MD * evp_md;
unsigned char md[EVP_MAX_MD_SIZE];
unsigned md_len;
unsigned secret_len;
unsigned u;
int pos;
assert(otp_pass != NULL);
otp_seq = (otp_seq >= 0) ? otp_seq : otputil_defaults.otp_seq;
otp_hash = ((otp_hash)) ? otp_hash : otputil_defaults.otp_hash;
// check otp_seed
secret[0] = '\0';
if ((otp_seed))
{
for(len = 0; ((otp_seed[len])); len++)
{
if (len > OTPUTIL_OTP_SEED_MAX_LEN)
return(-1);
if (!(isalnum(otp_seed[len])))
return(-1);
secret[len] = tolower(otp_seed[len]);
};
secret[len] = '\0';
if (len < OTPUTIL_OTP_SEED_MIN_LEN)
return(-1);
};
// check otp_pass
len = strlen(otp_pass);
if ((len > OTPUTIL_OTP_PASS_MAX_LEN) || (len < OTPUTIL_OTP_PASS_MIN_LEN))
return(-1);
// check otp_hash
if ((evp_md = otputil_evp_md(otp_hash)) == NULL)
return(-1);
// generate secret
bindle_strlcat((char *)secret, otp_pass, sizeof(secret));
secret_len = (unsigned)strlen((char *)secret);
// generate hashes
for(pos = 0; (pos <= otp_seq); pos++)
{
md_len = sizeof(md);
if (!(EVP_Digest(secret, secret_len, md, &md_len, evp_md, NULL)))
return(-1);
if ((otp_hash == OTPUTIL_MD_MD4) || (otp_hash == OTPUTIL_MD_MD5))
{
for(u = 0; (u < 8); u++)
md[u] ^= md[u+8];
memcpy(secret, md, 8);
secret_len = 8;
} else
{
for(u = 8; (u < md_len); u++)
md[u%8] ^= md[u];
secret[0] = md[3]; secret[1] = md[2]; secret[2] = md[1]; secret[3] = md[0];
secret[4] = md[7]; secret[5] = md[6]; secret[6] = md[5]; secret[7] = md[4];
secret_len = 8;
};
};
*otp_resultp = ((uint64_t)secret[0] << 56) | ((uint64_t)secret[1] << 48)
| ((uint64_t)secret[2] << 40) | ((uint64_t)secret[3] << 32)
| ((uint64_t)secret[4] << 24) | ((uint64_t)secret[5] << 16)
| ((uint64_t)secret[6] << 8) | ((uint64_t)secret[7] << 0);
return(0);
}
char *
otputil_otp_str(
const char * otp_pass,
const char * otp_seed,
int otp_seq,
int otp_hash,
char * dst,
size_t dstlen )
{
uint64_t val;
otputil_bv_t res;
uint8_t bv_val[8];
static char buff[32];
dstlen = ((dst)) ? dstlen : sizeof(buff);
dst = ((dst)) ? dst : buff;
res.bv_val = bv_val;
res.bv_len = sizeof(bv_val);
if (otputil_otp_code(otp_pass, otp_seed, otp_seq, otp_hash, &val) == -1)
return(NULL);
bv_val[0] = (val >> 56) & 0xff;
bv_val[1] = (val >> 48) & 0xff;
bv_val[2] = (val >> 40) & 0xff;
bv_val[3] = (val >> 32) & 0xff;
bv_val[4] = (val >> 24) & 0xff;
bv_val[5] = (val >> 16) & 0xff;
bv_val[6] = (val >> 8) & 0xff;
bv_val[7] = (val >> 0) & 0xff;
otputil_otp_encode(&res, dst, dstlen, OTPUTIL_ENC_SIXWORD);
return(dst);
}
/* end of source file */
|
