diff options
Diffstat (limited to 'src/lib/libc/crypt/bcrypt.c')
| -rw-r--r-- | src/lib/libc/crypt/bcrypt.c | 331 |
1 files changed, 331 insertions, 0 deletions
diff --git a/src/lib/libc/crypt/bcrypt.c b/src/lib/libc/crypt/bcrypt.c new file mode 100644 index 0000000000..95251db1cd --- /dev/null +++ b/src/lib/libc/crypt/bcrypt.c | |||
| @@ -0,0 +1,331 @@ | |||
| 1 | /* $OpenBSD: bcrypt.c,v 1.18 2003/08/07 00:28:45 deraadt Exp $ */ | ||
| 2 | |||
| 3 | /* | ||
| 4 | * Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de> | ||
| 5 | * All rights reserved. | ||
| 6 | * | ||
| 7 | * Redistribution and use in source and binary forms, with or without | ||
| 8 | * modification, are permitted provided that the following conditions | ||
| 9 | * are met: | ||
| 10 | * 1. Redistributions of source code must retain the above copyright | ||
| 11 | * notice, this list of conditions and the following disclaimer. | ||
| 12 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer in the | ||
| 14 | * documentation and/or other materials provided with the distribution. | ||
| 15 | * 3. All advertising materials mentioning features or use of this software | ||
| 16 | * must display the following acknowledgement: | ||
| 17 | * This product includes software developed by Niels Provos. | ||
| 18 | * 4. The name of the author may not be used to endorse or promote products | ||
| 19 | * derived from this software without specific prior written permission. | ||
| 20 | * | ||
| 21 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | ||
| 22 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | ||
| 23 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | ||
| 24 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | ||
| 25 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 26 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| 27 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| 28 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| 29 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | ||
| 30 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 31 | */ | ||
| 32 | |||
| 33 | /* This password hashing algorithm was designed by David Mazieres | ||
| 34 | * <dm@lcs.mit.edu> and works as follows: | ||
| 35 | * | ||
| 36 | * 1. state := InitState () | ||
| 37 | * 2. state := ExpandKey (state, salt, password) 3. | ||
| 38 | * REPEAT rounds: | ||
| 39 | * state := ExpandKey (state, 0, salt) | ||
| 40 | * state := ExpandKey(state, 0, password) | ||
| 41 | * 4. ctext := "OrpheanBeholderScryDoubt" | ||
| 42 | * 5. REPEAT 64: | ||
| 43 | * ctext := Encrypt_ECB (state, ctext); | ||
| 44 | * 6. RETURN Concatenate (salt, ctext); | ||
| 45 | * | ||
| 46 | */ | ||
| 47 | |||
| 48 | #if 0 | ||
| 49 | #include <stdio.h> | ||
| 50 | #endif | ||
| 51 | |||
| 52 | #include <stdio.h> | ||
| 53 | #include <stdlib.h> | ||
| 54 | #include <sys/types.h> | ||
| 55 | #include <string.h> | ||
| 56 | #include <pwd.h> | ||
| 57 | #include <blf.h> | ||
| 58 | |||
| 59 | /* This implementation is adaptable to current computing power. | ||
| 60 | * You can have up to 2^31 rounds which should be enough for some | ||
| 61 | * time to come. | ||
| 62 | */ | ||
| 63 | |||
| 64 | #define BCRYPT_VERSION '2' | ||
| 65 | #define BCRYPT_MAXSALT 16 /* Precomputation is just so nice */ | ||
| 66 | #define BCRYPT_BLOCKS 6 /* Ciphertext blocks */ | ||
| 67 | #define BCRYPT_MINROUNDS 16 /* we have log2(rounds) in salt */ | ||
| 68 | |||
| 69 | char *bcrypt_gensalt(u_int8_t); | ||
| 70 | |||
| 71 | static void encode_salt(char *, u_int8_t *, u_int16_t, u_int8_t); | ||
| 72 | static void encode_base64(u_int8_t *, u_int8_t *, u_int16_t); | ||
| 73 | static void decode_base64(u_int8_t *, u_int16_t, u_int8_t *); | ||
| 74 | |||
| 75 | static char encrypted[_PASSWORD_LEN]; | ||
| 76 | static char gsalt[BCRYPT_MAXSALT * 4 / 3 + 1]; | ||
| 77 | static char error[] = ":"; | ||
| 78 | |||
| 79 | const static u_int8_t Base64Code[] = | ||
| 80 | "./ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"; | ||
| 81 | |||
| 82 | const static u_int8_t index_64[128] = { | ||
| 83 | 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, | ||
| 84 | 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, | ||
| 85 | 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, | ||
| 86 | 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, | ||
| 87 | 255, 255, 255, 255, 255, 255, 0, 1, 54, 55, | ||
| 88 | 56, 57, 58, 59, 60, 61, 62, 63, 255, 255, | ||
| 89 | 255, 255, 255, 255, 255, 2, 3, 4, 5, 6, | ||
| 90 | 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, | ||
| 91 | 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, | ||
| 92 | 255, 255, 255, 255, 255, 255, 28, 29, 30, | ||
| 93 | 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, | ||
| 94 | 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, | ||
| 95 | 51, 52, 53, 255, 255, 255, 255, 255 | ||
| 96 | }; | ||
| 97 | #define CHAR64(c) ( (c) > 127 ? 255 : index_64[(c)]) | ||
| 98 | |||
| 99 | static void | ||
| 100 | decode_base64(u_int8_t *buffer, u_int16_t len, u_int8_t *data) | ||
| 101 | { | ||
| 102 | u_int8_t *bp = buffer; | ||
| 103 | u_int8_t *p = data; | ||
| 104 | u_int8_t c1, c2, c3, c4; | ||
| 105 | while (bp < buffer + len) { | ||
| 106 | c1 = CHAR64(*p); | ||
| 107 | c2 = CHAR64(*(p + 1)); | ||
| 108 | |||
| 109 | /* Invalid data */ | ||
| 110 | if (c1 == 255 || c2 == 255) | ||
| 111 | break; | ||
| 112 | |||
| 113 | *bp++ = (c1 << 2) | ((c2 & 0x30) >> 4); | ||
| 114 | if (bp >= buffer + len) | ||
| 115 | break; | ||
| 116 | |||
| 117 | c3 = CHAR64(*(p + 2)); | ||
| 118 | if (c3 == 255) | ||
| 119 | break; | ||
| 120 | |||
| 121 | *bp++ = ((c2 & 0x0f) << 4) | ((c3 & 0x3c) >> 2); | ||
| 122 | if (bp >= buffer + len) | ||
| 123 | break; | ||
| 124 | |||
| 125 | c4 = CHAR64(*(p + 3)); | ||
| 126 | if (c4 == 255) | ||
| 127 | break; | ||
| 128 | *bp++ = ((c3 & 0x03) << 6) | c4; | ||
| 129 | |||
| 130 | p += 4; | ||
| 131 | } | ||
| 132 | } | ||
| 133 | |||
| 134 | static void | ||
| 135 | encode_salt(char *salt, u_int8_t *csalt, u_int16_t clen, u_int8_t logr) | ||
| 136 | { | ||
| 137 | salt[0] = '$'; | ||
| 138 | salt[1] = BCRYPT_VERSION; | ||
| 139 | salt[2] = 'a'; | ||
| 140 | salt[3] = '$'; | ||
| 141 | |||
| 142 | snprintf(salt + 4, 4, "%2.2u$", logr); | ||
| 143 | |||
| 144 | encode_base64((u_int8_t *) salt + 7, csalt, clen); | ||
| 145 | } | ||
| 146 | /* Generates a salt for this version of crypt. | ||
| 147 | Since versions may change. Keeping this here | ||
| 148 | seems sensible. | ||
| 149 | */ | ||
| 150 | |||
| 151 | char * | ||
| 152 | bcrypt_gensalt(u_int8_t log_rounds) | ||
| 153 | { | ||
| 154 | u_int8_t csalt[BCRYPT_MAXSALT]; | ||
| 155 | u_int16_t i; | ||
| 156 | u_int32_t seed = 0; | ||
| 157 | |||
| 158 | for (i = 0; i < BCRYPT_MAXSALT; i++) { | ||
| 159 | if (i % 4 == 0) | ||
| 160 | seed = arc4random(); | ||
| 161 | csalt[i] = seed & 0xff; | ||
| 162 | seed = seed >> 8; | ||
| 163 | } | ||
| 164 | |||
| 165 | if (log_rounds < 4) | ||
| 166 | log_rounds = 4; | ||
| 167 | |||
| 168 | encode_salt(gsalt, csalt, BCRYPT_MAXSALT, log_rounds); | ||
| 169 | return gsalt; | ||
| 170 | } | ||
| 171 | /* We handle $Vers$log2(NumRounds)$salt+passwd$ | ||
| 172 | i.e. $2$04$iwouldntknowwhattosayetKdJ6iFtacBqJdKe6aW7ou */ | ||
| 173 | |||
| 174 | char * | ||
| 175 | bcrypt(const char *key, const char *salt) | ||
| 176 | { | ||
| 177 | blf_ctx state; | ||
| 178 | u_int32_t rounds, i, k; | ||
| 179 | u_int16_t j; | ||
| 180 | u_int8_t key_len, salt_len, logr, minor; | ||
| 181 | u_int8_t ciphertext[4 * BCRYPT_BLOCKS] = "OrpheanBeholderScryDoubt"; | ||
| 182 | u_int8_t csalt[BCRYPT_MAXSALT]; | ||
| 183 | u_int32_t cdata[BCRYPT_BLOCKS]; | ||
| 184 | |||
| 185 | /* Discard "$" identifier */ | ||
| 186 | salt++; | ||
| 187 | |||
| 188 | if (*salt > BCRYPT_VERSION) { | ||
| 189 | /* How do I handle errors ? Return ':' */ | ||
| 190 | return error; | ||
| 191 | } | ||
| 192 | |||
| 193 | /* Check for minor versions */ | ||
| 194 | if (salt[1] != '$') { | ||
| 195 | switch (salt[1]) { | ||
| 196 | case 'a': | ||
| 197 | /* 'ab' should not yield the same as 'abab' */ | ||
| 198 | minor = salt[1]; | ||
| 199 | salt++; | ||
| 200 | break; | ||
| 201 | default: | ||
| 202 | return error; | ||
| 203 | } | ||
| 204 | } else | ||
| 205 | minor = 0; | ||
| 206 | |||
| 207 | /* Discard version + "$" identifier */ | ||
| 208 | salt += 2; | ||
| 209 | |||
| 210 | if (salt[2] != '$') | ||
| 211 | /* Out of sync with passwd entry */ | ||
| 212 | return error; | ||
| 213 | |||
| 214 | /* Computer power doesn't increase linear, 2^x should be fine */ | ||
| 215 | if ((rounds = (u_int32_t) 1 << (logr = atoi(salt))) < BCRYPT_MINROUNDS) | ||
| 216 | return error; | ||
| 217 | |||
| 218 | /* Discard num rounds + "$" identifier */ | ||
| 219 | salt += 3; | ||
| 220 | |||
| 221 | if (strlen(salt) * 3 / 4 < BCRYPT_MAXSALT) | ||
| 222 | return error; | ||
| 223 | |||
| 224 | /* We dont want the base64 salt but the raw data */ | ||
| 225 | decode_base64(csalt, BCRYPT_MAXSALT, (u_int8_t *) salt); | ||
| 226 | salt_len = BCRYPT_MAXSALT; | ||
| 227 | key_len = strlen(key) + (minor >= 'a' ? 1 : 0); | ||
| 228 | |||
| 229 | /* Setting up S-Boxes and Subkeys */ | ||
| 230 | Blowfish_initstate(&state); | ||
| 231 | Blowfish_expandstate(&state, csalt, salt_len, | ||
| 232 | (u_int8_t *) key, key_len); | ||
| 233 | for (k = 0; k < rounds; k++) { | ||
| 234 | Blowfish_expand0state(&state, (u_int8_t *) key, key_len); | ||
| 235 | Blowfish_expand0state(&state, csalt, salt_len); | ||
| 236 | } | ||
| 237 | |||
| 238 | /* This can be precomputed later */ | ||
| 239 | j = 0; | ||
| 240 | for (i = 0; i < BCRYPT_BLOCKS; i++) | ||
| 241 | cdata[i] = Blowfish_stream2word(ciphertext, 4 * BCRYPT_BLOCKS, &j); | ||
| 242 | |||
| 243 | /* Now do the encryption */ | ||
| 244 | for (k = 0; k < 64; k++) | ||
| 245 | blf_enc(&state, cdata, BCRYPT_BLOCKS / 2); | ||
| 246 | |||
| 247 | for (i = 0; i < BCRYPT_BLOCKS; i++) { | ||
| 248 | ciphertext[4 * i + 3] = cdata[i] & 0xff; | ||
| 249 | cdata[i] = cdata[i] >> 8; | ||
| 250 | ciphertext[4 * i + 2] = cdata[i] & 0xff; | ||
| 251 | cdata[i] = cdata[i] >> 8; | ||
| 252 | ciphertext[4 * i + 1] = cdata[i] & 0xff; | ||
| 253 | cdata[i] = cdata[i] >> 8; | ||
| 254 | ciphertext[4 * i + 0] = cdata[i] & 0xff; | ||
| 255 | } | ||
| 256 | |||
| 257 | |||
| 258 | i = 0; | ||
| 259 | encrypted[i++] = '$'; | ||
| 260 | encrypted[i++] = BCRYPT_VERSION; | ||
| 261 | if (minor) | ||
| 262 | encrypted[i++] = minor; | ||
| 263 | encrypted[i++] = '$'; | ||
| 264 | |||
| 265 | snprintf(encrypted + i, 4, "%2.2u$", logr); | ||
| 266 | |||
| 267 | encode_base64((u_int8_t *) encrypted + i + 3, csalt, BCRYPT_MAXSALT); | ||
| 268 | encode_base64((u_int8_t *) encrypted + strlen(encrypted), ciphertext, | ||
| 269 | 4 * BCRYPT_BLOCKS - 1); | ||
| 270 | return encrypted; | ||
| 271 | } | ||
| 272 | |||
| 273 | static void | ||
| 274 | encode_base64(u_int8_t *buffer, u_int8_t *data, u_int16_t len) | ||
| 275 | { | ||
| 276 | u_int8_t *bp = buffer; | ||
| 277 | u_int8_t *p = data; | ||
| 278 | u_int8_t c1, c2; | ||
| 279 | while (p < data + len) { | ||
| 280 | c1 = *p++; | ||
| 281 | *bp++ = Base64Code[(c1 >> 2)]; | ||
| 282 | c1 = (c1 & 0x03) << 4; | ||
| 283 | if (p >= data + len) { | ||
| 284 | *bp++ = Base64Code[c1]; | ||
| 285 | break; | ||
| 286 | } | ||
| 287 | c2 = *p++; | ||
| 288 | c1 |= (c2 >> 4) & 0x0f; | ||
| 289 | *bp++ = Base64Code[c1]; | ||
| 290 | c1 = (c2 & 0x0f) << 2; | ||
| 291 | if (p >= data + len) { | ||
| 292 | *bp++ = Base64Code[c1]; | ||
| 293 | break; | ||
| 294 | } | ||
| 295 | c2 = *p++; | ||
| 296 | c1 |= (c2 >> 6) & 0x03; | ||
| 297 | *bp++ = Base64Code[c1]; | ||
| 298 | *bp++ = Base64Code[c2 & 0x3f]; | ||
| 299 | } | ||
| 300 | *bp = '\0'; | ||
| 301 | } | ||
| 302 | #if 0 | ||
| 303 | void | ||
| 304 | main() | ||
| 305 | { | ||
| 306 | char blubber[73]; | ||
| 307 | char salt[100]; | ||
| 308 | char *p; | ||
| 309 | salt[0] = '$'; | ||
| 310 | salt[1] = BCRYPT_VERSION; | ||
| 311 | salt[2] = '$'; | ||
| 312 | |||
| 313 | snprintf(salt + 3, 4, "%2.2u$", 5); | ||
| 314 | |||
| 315 | printf("24 bytes of salt: "); | ||
| 316 | fgets(salt + 6, 94, stdin); | ||
| 317 | salt[99] = 0; | ||
| 318 | printf("72 bytes of password: "); | ||
| 319 | fpurge(stdin); | ||
| 320 | fgets(blubber, 73, stdin); | ||
| 321 | blubber[72] = 0; | ||
| 322 | |||
| 323 | p = crypt(blubber, salt); | ||
| 324 | printf("Passwd entry: %s\n\n", p); | ||
| 325 | |||
| 326 | p = bcrypt_gensalt(5); | ||
| 327 | printf("Generated salt: %s\n", p); | ||
| 328 | p = crypt(blubber, p); | ||
| 329 | printf("Passwd entry: %s\n", p); | ||
| 330 | } | ||
| 331 | #endif | ||
