2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 1999 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
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 * ====================================================================
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).
67 /* Uncomment out this line to get debugging info about key generation */
68 /*#define DEBUG_KEYGEN*/
72 void h__dump (unsigned char *p, int len);
75 /* PKCS12 compatible key/IV generation */
77 #define min(a,b) ((a) < (b) ? (a) : (b))
80 int PKCS12_key_gen_asc (pass, passlen, salt, saltlen, id, iter, n, out, md_type)
81 unsigned char *pass, *salt, *out;
82 int passlen, saltlen, id, iter, n;
86 unsigned char *unipass;
88 if (!asc2uni (pass, &unipass, &uniplen)) {
89 PKCS12err(PKCS12_F_PKCS12_KEY_GEN_ASC,ERR_R_MALLOC_FAILURE);
92 ret = PKCS12_key_gen_uni (unipass, uniplen, salt, saltlen,
93 id, iter, n, out, md_type);
94 memset(unipass, 0, uniplen); /* Clear password from memory */
99 int PKCS12_key_gen_uni (pass, passlen, salt, saltlen, id, iter, n, out, md_type)
100 unsigned char *pass, *salt, *out;
101 int passlen, saltlen, id, iter, n;
104 unsigned char *B, *D, *I, *p, *Ai;
105 int Slen, Plen, Ilen;
107 BIGNUM *Ij, *Bpl1; /* These hold Ij and B + 1 */
110 unsigned char *tmpout = out;
112 BIO_printf (bio_err, "KEYGEN DEBUG\n");
113 BIO_printf (bio_err, "ID %d, ITER %d\n", id, iter);
114 BIO_printf (bio_err, "Password (length %d):\n", passlen);
115 h__dump (pass, passlen);
116 BIO_printf (bio_err, "Salt (length %d):\n", saltlen);
117 h__dump (salt, saltlen);
118 BIO_printf (bio_err, "ID %d, ITER %d\n\n", id, iter);
120 v = EVP_MD_block_size (md_type);
121 u = EVP_MD_size (md_type);
125 Slen = v * ((saltlen+v-1)/v);
126 Plen = v * ((passlen+v-1)/v);
131 if (!D || !Ai || !B || !I || !Ij || !Bpl1) {
132 PKCS12err(PKCS12_F_PKCS12_KEY_GEN_UNI,ERR_R_MALLOC_FAILURE);
135 for (i = 0; i < v; i++) D[i] = id;
137 for (i = 0; i < Slen; i++) *p++ = salt[i % saltlen];
138 for (i = 0; i < Plen; i++) *p++ = pass[i % passlen];
140 EVP_DigestInit (&ctx, md_type);
141 EVP_DigestUpdate (&ctx, D, v);
142 EVP_DigestUpdate (&ctx, I, Ilen);
143 EVP_DigestFinal (&ctx, Ai, NULL);
144 for (j = 1; j < iter; j++) {
145 EVP_DigestInit (&ctx, md_type);
146 EVP_DigestUpdate (&ctx, Ai, u);
147 EVP_DigestFinal (&ctx, Ai, NULL);
149 memcpy (out, Ai, min (n, u));
158 BIO_printf (bio_err, "Output KEY (length %d)\n", tmpn);
159 h__dump (tmpout, tmpn);
165 for (j = 0; j < v; j++) B[j] = Ai[j % u];
166 /* Work out B + 1 first then can use B as tmp space */
167 BN_bin2bn (B, v, Bpl1);
168 BN_add_word (Bpl1, 1);
169 for (j = 0; j < Ilen ; j+=v) {
170 BN_bin2bn (I + j, v, Ij);
171 BN_add (Ij, Ij, Bpl1);
173 /* If more than 2^(v*8) - 1 cut off MSB */
174 if (BN_num_bytes (Ij) > v) {
176 memcpy (I + j, B + 1, v);
177 } else BN_bn2bin (Ij, I + j);
180 return 0; /* This can't happen */
183 void h__dump (p, len)
187 for (; len --; p++) BIO_printf (bio_err, "%02X", *p);
188 BIO_printf (bio_err, "\n");