1 /* $OpenBSD: p12_key.c,v 1.22 2015/02/07 13:19:15 doug Exp $ */ 2 /* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL 3 * project 1999. 4 */ 5 /* ==================================================================== 6 * Copyright (c) 1999 The OpenSSL Project. All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in 17 * the documentation and/or other materials provided with the 18 * distribution. 19 * 20 * 3. All advertising materials mentioning features or use of this 21 * software must display the following acknowledgment: 22 * "This product includes software developed by the OpenSSL Project 23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" 24 * 25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to 26 * endorse or promote products derived from this software without 27 * prior written permission. For written permission, please contact 28 * licensing@OpenSSL.org. 29 * 30 * 5. Products derived from this software may not be called "OpenSSL" 31 * nor may "OpenSSL" appear in their names without prior written 32 * permission of the OpenSSL Project. 33 * 34 * 6. Redistributions of any form whatsoever must retain the following 35 * acknowledgment: 36 * "This product includes software developed by the OpenSSL Project 37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" 38 * 39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY 40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR 43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED 50 * OF THE POSSIBILITY OF SUCH DAMAGE. 51 * ==================================================================== 52 * 53 * This product includes cryptographic software written by Eric Young 54 * (eay@cryptsoft.com). This product includes software written by Tim 55 * Hudson (tjh@cryptsoft.com). 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 /* PKCS12 compatible key/IV generation */ 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) { 81 unipass = NULL; 82 uniplen = 0; 83 } else if (!OPENSSL_asc2uni(pass, passlen, &unipass, &uniplen)) { 84 PKCS12err(PKCS12_F_PKCS12_KEY_GEN_ASC, ERR_R_MALLOC_FAILURE); 85 return 0; 86 } 87 ret = PKCS12_key_gen_uni(unipass, uniplen, salt, saltlen, 88 id, iter, n, out, md_type); 89 if (ret <= 0) 90 return 0; 91 if (unipass) { 92 explicit_bzero(unipass, uniplen); 93 free(unipass); 94 } 95 return ret; 96 } 97 98 int 99 PKCS12_key_gen_uni(unsigned char *pass, int passlen, unsigned char *salt, 100 int saltlen, int id, int iter, int n, unsigned char *out, 101 const EVP_MD *md_type) 102 { 103 unsigned char *B, *D, *I, *p, *Ai; 104 int Slen, Plen, Ilen, Ijlen; 105 int i, j, u, v; 106 int ret = 0; 107 BIGNUM *Ij, *Bpl1; /* These hold Ij and B + 1 */ 108 EVP_MD_CTX ctx; 109 110 EVP_MD_CTX_init(&ctx); 111 v = EVP_MD_block_size(md_type); 112 u = EVP_MD_size(md_type); 113 if (u < 0) 114 return 0; 115 D = malloc(v); 116 Ai = malloc(u); 117 B = malloc(v + 1); 118 Slen = v * ((saltlen + v - 1) / v); 119 if (passlen) 120 Plen = v * ((passlen + v - 1)/v); 121 else 122 Plen = 0; 123 Ilen = Slen + Plen; 124 I = malloc(Ilen); 125 Ij = BN_new(); 126 Bpl1 = BN_new(); 127 if (!D || !Ai || !B || !I || !Ij || !Bpl1) 128 goto err; 129 for (i = 0; i < v; i++) 130 D[i] = id; 131 p = I; 132 for (i = 0; i < Slen; i++) 133 *p++ = salt[i % saltlen]; 134 for (i = 0; i < Plen; i++) 135 *p++ = pass[i % passlen]; 136 for (;;) { 137 if (!EVP_DigestInit_ex(&ctx, md_type, NULL) || 138 !EVP_DigestUpdate(&ctx, D, v) || 139 !EVP_DigestUpdate(&ctx, I, Ilen) || 140 !EVP_DigestFinal_ex(&ctx, Ai, NULL)) 141 goto err; 142 for (j = 1; j < iter; j++) { 143 if (!EVP_DigestInit_ex(&ctx, md_type, NULL) || 144 !EVP_DigestUpdate(&ctx, Ai, u) || 145 !EVP_DigestFinal_ex(&ctx, Ai, NULL)) 146 goto err; 147 } 148 memcpy (out, Ai, min (n, u)); 149 if (u >= n) { 150 ret = 1; 151 goto end; 152 } 153 n -= u; 154 out += u; 155 for (j = 0; j < v; j++) 156 B[j] = Ai[j % u]; 157 /* Work out B + 1 first then can use B as tmp space */ 158 if (!BN_bin2bn (B, v, Bpl1)) 159 goto err; 160 if (!BN_add_word (Bpl1, 1)) 161 goto err; 162 for (j = 0; j < Ilen; j += v) { 163 if (!BN_bin2bn(I + j, v, Ij)) 164 goto err; 165 if (!BN_add(Ij, Ij, Bpl1)) 166 goto err; 167 if (!BN_bn2bin(Ij, B)) 168 goto err; 169 Ijlen = BN_num_bytes (Ij); 170 /* If more than 2^(v*8) - 1 cut off MSB */ 171 if (Ijlen > v) { 172 if (!BN_bn2bin (Ij, B)) 173 goto err; 174 memcpy (I + j, B + 1, v); 175 #ifndef PKCS12_BROKEN_KEYGEN 176 /* If less than v bytes pad with zeroes */ 177 } else if (Ijlen < v) { 178 memset(I + j, 0, v - Ijlen); 179 if (!BN_bn2bin(Ij, I + j + v - Ijlen)) 180 goto err; 181 #endif 182 } else if (!BN_bn2bin (Ij, I + j)) 183 goto err; 184 } 185 } 186 187 err: 188 PKCS12err(PKCS12_F_PKCS12_KEY_GEN_UNI, ERR_R_MALLOC_FAILURE); 189 190 end: 191 free(Ai); 192 free(B); 193 free(D); 194 free(I); 195 BN_free(Ij); 196 BN_free(Bpl1); 197 EVP_MD_CTX_cleanup(&ctx); 198 return ret; 199 } 200