Line | Source | Count |
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 | #include <stdio.h> | - |
60 | #include <string.h> | - |
61 | | - |
62 | #include <openssl/bn.h> | - |
63 | #include <openssl/err.h> | - |
64 | #include <openssl/pkcs12.h> | - |
65 | | - |
66 | | - |
67 | #ifndef min | - |
68 | #define min(a,b) ((a) < (b) ? (a) : (b)) | - |
69 | #endif | - |
70 | | - |
71 | int | - |
72 | PKCS12_key_gen_asc(const char *pass, int passlen, unsigned char *salt, | - |
73 | int saltlen, int id, int iter, int n, unsigned char *out, | - |
74 | const EVP_MD *md_type) | - |
75 | { | - |
76 | int ret; | - |
77 | unsigned char *unipass; | - |
78 | int uniplen; | - |
79 | | - |
80 | if (!pass) {TRUE | never evaluated | FALSE | never evaluated |
| 0 |
81 | unipass = NULL; | - |
82 | uniplen = 0; | - |
83 | } else if (!OPENSSL_asc2uni(pass, passlen, &unipass, &uniplen)) { never executed: end of block TRUE | never evaluated | FALSE | never evaluated |
| 0 |
84 | PKCS12error(ERR_R_MALLOC_FAILURE); | - |
85 | return 0; never executed: return 0; | 0 |
86 | } | - |
87 | ret = PKCS12_key_gen_uni(unipass, uniplen, salt, saltlen, | - |
88 | id, iter, n, out, md_type); | - |
89 | if (ret <= 0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
90 | return 0; never executed: return 0; | 0 |
91 | freezero(unipass, uniplen); | - |
92 | return ret; never executed: return ret; | 0 |
93 | } | - |
94 | | - |
95 | int | - |
96 | PKCS12_key_gen_uni(unsigned char *pass, int passlen, unsigned char *salt, | - |
97 | int saltlen, int id, int iter, int n, unsigned char *out, | - |
98 | const EVP_MD *md_type) | - |
99 | { | - |
100 | unsigned char *B, *D, *I, *p, *Ai; | - |
101 | int Slen, Plen, Ilen, Ijlen; | - |
102 | int i, j, u, v; | - |
103 | int ret = 0; | - |
104 | BIGNUM *Ij, *Bpl1; | - |
105 | EVP_MD_CTX ctx; | - |
106 | | - |
107 | v = EVP_MD_block_size(md_type); | - |
108 | u = EVP_MD_size(md_type); | - |
109 | if (u < 0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
110 | return 0; never executed: return 0; | 0 |
111 | | - |
112 | EVP_MD_CTX_init(&ctx); | - |
113 | D = malloc(v); | - |
114 | Ai = malloc(u); | - |
115 | B = malloc(v + 1); | - |
116 | Slen = v * ((saltlen + v - 1) / v); | - |
117 | if (passlen)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
118 | Plen = v * ((passlen + v - 1)/v); never executed: Plen = v * ((passlen + v - 1)/v); | 0 |
119 | else | - |
120 | Plen = 0; never executed: Plen = 0; | 0 |
121 | Ilen = Slen + Plen; | - |
122 | I = malloc(Ilen); | - |
123 | Ij = BN_new(); | - |
124 | Bpl1 = BN_new(); | - |
125 | if (!D || !Ai || !B || !I || !Ij || !Bpl1)TRUE | never evaluated | FALSE | never evaluated |
TRUE | never evaluated | FALSE | never evaluated |
TRUE | never evaluated | FALSE | never evaluated |
TRUE | never evaluated | FALSE | never evaluated |
TRUE | never evaluated | FALSE | never evaluated |
TRUE | never evaluated | FALSE | never evaluated |
| 0 |
126 | goto err; never executed: goto err; | 0 |
127 | for (i = 0; i < v; i++)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
128 | D[i] = id; never executed: D[i] = id; | 0 |
129 | p = I; | - |
130 | for (i = 0; i < Slen; i++)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
131 | *p++ = salt[i % saltlen]; never executed: *p++ = salt[i % saltlen]; | 0 |
132 | for (i = 0; i < Plen; i++)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
133 | *p++ = pass[i % passlen]; never executed: *p++ = pass[i % passlen]; | 0 |
134 | for (;;) { | - |
135 | if (!EVP_DigestInit_ex(&ctx, md_type, NULL) ||TRUE | never evaluated | FALSE | never evaluated |
| 0 |
136 | !EVP_DigestUpdate(&ctx, D, v) ||TRUE | never evaluated | FALSE | never evaluated |
| 0 |
137 | !EVP_DigestUpdate(&ctx, I, Ilen) ||TRUE | never evaluated | FALSE | never evaluated |
| 0 |
138 | !EVP_DigestFinal_ex(&ctx, Ai, NULL))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
139 | goto err; never executed: goto err; | 0 |
140 | for (j = 1; j < iter; j++) {TRUE | never evaluated | FALSE | never evaluated |
| 0 |
141 | if (!EVP_DigestInit_ex(&ctx, md_type, NULL) ||TRUE | never evaluated | FALSE | never evaluated |
| 0 |
142 | !EVP_DigestUpdate(&ctx, Ai, u) ||TRUE | never evaluated | FALSE | never evaluated |
| 0 |
143 | !EVP_DigestFinal_ex(&ctx, Ai, NULL))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
144 | goto err; never executed: goto err; | 0 |
145 | } never executed: end of block | 0 |
146 | memcpy (out, Ai, min (n, u)); | - |
147 | if (u >= n) {TRUE | never evaluated | FALSE | never evaluated |
| 0 |
148 | ret = 1; | - |
149 | goto end; never executed: goto end; | 0 |
150 | } | - |
151 | n -= u; | - |
152 | out += u; | - |
153 | for (j = 0; j < v; j++)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
154 | B[j] = Ai[j % u]; never executed: B[j] = Ai[j % u]; | 0 |
155 | | - |
156 | if (!BN_bin2bn (B, v, Bpl1))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
157 | goto err; never executed: goto err; | 0 |
158 | if (!BN_add_word (Bpl1, 1))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
159 | goto err; never executed: goto err; | 0 |
160 | for (j = 0; j < Ilen; j += v) {TRUE | never evaluated | FALSE | never evaluated |
| 0 |
161 | if (!BN_bin2bn(I + j, v, Ij))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
162 | goto err; never executed: goto err; | 0 |
163 | if (!BN_add(Ij, Ij, Bpl1))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
164 | goto err; never executed: goto err; | 0 |
165 | if (!BN_bn2bin(Ij, B))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
166 | goto err; never executed: goto err; | 0 |
167 | Ijlen = BN_num_bytes (Ij); | - |
168 | | - |
169 | if (Ijlen > v) {TRUE | never evaluated | FALSE | never evaluated |
| 0 |
170 | if (!BN_bn2bin (Ij, B))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
171 | goto err; never executed: goto err; | 0 |
172 | memcpy (I + j, B + 1, v); | - |
173 | #ifndef PKCS12_BROKEN_KEYGEN | - |
174 | | - |
175 | } else if (Ijlen < v) { never executed: end of block TRUE | never evaluated | FALSE | never evaluated |
| 0 |
176 | memset(I + j, 0, v - Ijlen); | - |
177 | if (!BN_bn2bin(Ij, I + j + v - Ijlen))TRUE | never evaluated | FALSE | never evaluated |
| 0 |
178 | goto err; never executed: goto err; | 0 |
179 | #endif | - |
180 | } else if (!BN_bn2bin (Ij, I + j)) never executed: end of block TRUE | never evaluated | FALSE | never evaluated |
| 0 |
181 | goto err; never executed: goto err; | 0 |
182 | } never executed: end of block | 0 |
183 | } never executed: end of block | 0 |
184 | | - |
185 | err: code before this statement never executed: err: | 0 |
186 | PKCS12error(ERR_R_MALLOC_FAILURE); | - |
187 | | - |
188 | end: code before this statement never executed: end: | 0 |
189 | free(Ai); | - |
190 | free(B); | - |
191 | free(D); | - |
192 | free(I); | - |
193 | BN_free(Ij); | - |
194 | BN_free(Bpl1); | - |
195 | EVP_MD_CTX_cleanup(&ctx); | - |
196 | return ret; never executed: return ret; | 0 |
197 | } | - |
| | |