|
| 1 | +/* LibTomCrypt, modular cryptographic library -- Tom St Denis |
| 2 | + * |
| 3 | + * LibTomCrypt is a library that provides various cryptographic |
| 4 | + * algorithms in a highly modular and flexible manner. |
| 5 | + * |
| 6 | + * The library is free for all purposes without any express |
| 7 | + * guarantee it works. |
| 8 | + */ |
| 9 | + |
| 10 | +#include "tomcrypt_private.h" |
| 11 | + |
| 12 | +#ifdef LTC_PKCS_12 |
| 13 | + |
| 14 | +int pkcs12_kdf( int hash_id, |
| 15 | + const unsigned char *pw, unsigned long pwlen, |
| 16 | + const unsigned char *salt, unsigned long saltlen, |
| 17 | + unsigned int iterations, unsigned char purpose, |
| 18 | + unsigned char *out, unsigned long outlen) |
| 19 | +{ |
| 20 | + unsigned long u = hash_descriptor[hash_id].hashsize; |
| 21 | + unsigned long v = hash_descriptor[hash_id].blocksize; |
| 22 | + unsigned long c = (outlen + u - 1) / u; |
| 23 | + unsigned long Slen = ((saltlen + v - 1) / v) * v; |
| 24 | + unsigned long Plen = ((pwlen + v - 1) / v) * v; |
| 25 | + unsigned long k = (Plen + Slen) / v; |
| 26 | + unsigned long Alen, keylen = 0; |
| 27 | + unsigned int tmp, i, j, n; |
| 28 | + unsigned char ch; |
| 29 | + unsigned char D[MAXBLOCKSIZE], A[MAXBLOCKSIZE], B[MAXBLOCKSIZE]; |
| 30 | + unsigned char *I = NULL, *key = NULL; |
| 31 | + int err = CRYPT_ERROR; |
| 32 | + |
| 33 | + key = XMALLOC(u * c); |
| 34 | + I = XMALLOC(Plen + Slen); |
| 35 | + if (key == NULL || I == NULL) goto DONE; |
| 36 | + zeromem(key, u * c); |
| 37 | + |
| 38 | + for (i = 0; i < v; i++) D[i] = purpose; /* D - diversifier */ |
| 39 | + for (i = 0; i < Slen; i++) I[i] = salt[i % saltlen]; |
| 40 | + for (i = 0; i < Plen; i++) I[Slen + i] = pw[i % pwlen]; /* I = Salt || Pass */ |
| 41 | + |
| 42 | + for (i = 0; i < c; i++) { |
| 43 | + Alen = u; /* hash size */ |
| 44 | + err = hash_memory_multi(hash_id, A, &Alen, D, v, I, Slen + Plen, NULL); /* A = HASH(D || I) */ |
| 45 | + if (err != CRYPT_OK) goto DONE; |
| 46 | + for (j = 1; j < iterations; j++) { |
| 47 | + err = hash_memory(hash_id, A, Alen, A, &Alen); /* A = HASH(A) */ |
| 48 | + if (err != CRYPT_OK) goto DONE; |
| 49 | + } |
| 50 | + /* fill buffer B with A */ |
| 51 | + for (j = 0; j < v; j++) B[j] = A[j % Alen]; |
| 52 | + /* B += 1 */ |
| 53 | + for (j = v; j > 0; j--) { |
| 54 | + if (++B[j - 1] != 0) break; |
| 55 | + } |
| 56 | + /* I_n += B */ |
| 57 | + for (n = 0; n < k; n++) { |
| 58 | + ch = 0; |
| 59 | + for (j = v; j > 0; j--) { |
| 60 | + tmp = I[n * v + j - 1] + B[j - 1] + ch; |
| 61 | + ch = (unsigned char)((tmp >> 8) & 0xFF); |
| 62 | + I[n * v + j - 1] = (unsigned char)(tmp & 0xFF); |
| 63 | + } |
| 64 | + } |
| 65 | + /* store derived key block */ |
| 66 | + for (j = 0; j < Alen; j++) key[keylen++] = A[j]; |
| 67 | + } |
| 68 | + |
| 69 | + for (i = 0; i < outlen; i++) out[i] = key[i]; |
| 70 | + err = CRYPT_OK; |
| 71 | +DONE: |
| 72 | + if (I) XFREE(I); |
| 73 | + if (key) XFREE(key); |
| 74 | + return err; |
| 75 | +} |
| 76 | + |
| 77 | +#endif |
| 78 | + |
| 79 | +/* ref: $Format:%D$ */ |
| 80 | +/* git commit: $Format:%H$ */ |
| 81 | +/* commit time: $Format:%ai$ */ |
0 commit comments