diff options
Diffstat (limited to 'src/lib/libcrypto/x509/x509_req.c')
| -rw-r--r-- | src/lib/libcrypto/x509/x509_req.c | 278 |
1 files changed, 278 insertions, 0 deletions
diff --git a/src/lib/libcrypto/x509/x509_req.c b/src/lib/libcrypto/x509/x509_req.c new file mode 100644 index 0000000000..0affa3bf30 --- /dev/null +++ b/src/lib/libcrypto/x509/x509_req.c | |||
| @@ -0,0 +1,278 @@ | |||
| 1 | /* crypto/x509/x509_req.c */ | ||
| 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
| 3 | * All rights reserved. | ||
| 4 | * | ||
| 5 | * This package is an SSL implementation written | ||
| 6 | * by Eric Young (eay@cryptsoft.com). | ||
| 7 | * The implementation was written so as to conform with Netscapes SSL. | ||
| 8 | * | ||
| 9 | * This library is free for commercial and non-commercial use as long as | ||
| 10 | * the following conditions are aheared to. The following conditions | ||
| 11 | * apply to all code found in this distribution, be it the RC4, RSA, | ||
| 12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | ||
| 13 | * included with this distribution is covered by the same copyright terms | ||
| 14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | ||
| 15 | * | ||
| 16 | * Copyright remains Eric Young's, and as such any Copyright notices in | ||
| 17 | * the code are not to be removed. | ||
| 18 | * If this package is used in a product, Eric Young should be given attribution | ||
| 19 | * as the author of the parts of the library used. | ||
| 20 | * This can be in the form of a textual message at program startup or | ||
| 21 | * in documentation (online or textual) provided with the package. | ||
| 22 | * | ||
| 23 | * Redistribution and use in source and binary forms, with or without | ||
| 24 | * modification, are permitted provided that the following conditions | ||
| 25 | * are met: | ||
| 26 | * 1. Redistributions of source code must retain the copyright | ||
| 27 | * notice, this list of conditions and the following disclaimer. | ||
| 28 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 29 | * notice, this list of conditions and the following disclaimer in the | ||
| 30 | * documentation and/or other materials provided with the distribution. | ||
| 31 | * 3. All advertising materials mentioning features or use of this software | ||
| 32 | * must display the following acknowledgement: | ||
| 33 | * "This product includes cryptographic software written by | ||
| 34 | * Eric Young (eay@cryptsoft.com)" | ||
| 35 | * The word 'cryptographic' can be left out if the rouines from the library | ||
| 36 | * being used are not cryptographic related :-). | ||
| 37 | * 4. If you include any Windows specific code (or a derivative thereof) from | ||
| 38 | * the apps directory (application code) you must include an acknowledgement: | ||
| 39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | ||
| 40 | * | ||
| 41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | ||
| 42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
| 44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | ||
| 45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
| 46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | ||
| 47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
| 49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | ||
| 50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | ||
| 51 | * SUCH DAMAGE. | ||
| 52 | * | ||
| 53 | * The licence and distribution terms for any publically available version or | ||
| 54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | ||
| 55 | * copied and put under another distribution licence | ||
| 56 | * [including the GNU Public Licence.] | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/bn.h> | ||
| 62 | #include <openssl/evp.h> | ||
| 63 | #include <openssl/asn1.h> | ||
| 64 | #include <openssl/x509.h> | ||
| 65 | #include <openssl/objects.h> | ||
| 66 | #include <openssl/buffer.h> | ||
| 67 | #include <openssl/pem.h> | ||
| 68 | |||
| 69 | X509_REQ *X509_to_X509_REQ(X509 *x, EVP_PKEY *pkey, const EVP_MD *md) | ||
| 70 | { | ||
| 71 | X509_REQ *ret; | ||
| 72 | X509_REQ_INFO *ri; | ||
| 73 | int i; | ||
| 74 | EVP_PKEY *pktmp; | ||
| 75 | |||
| 76 | ret=X509_REQ_new(); | ||
| 77 | if (ret == NULL) | ||
| 78 | { | ||
| 79 | X509err(X509_F_X509_TO_X509_REQ,ERR_R_MALLOC_FAILURE); | ||
| 80 | goto err; | ||
| 81 | } | ||
| 82 | |||
| 83 | ri=ret->req_info; | ||
| 84 | |||
| 85 | ri->version->length=1; | ||
| 86 | ri->version->data=(unsigned char *)OPENSSL_malloc(1); | ||
| 87 | if (ri->version->data == NULL) goto err; | ||
| 88 | ri->version->data[0]=0; /* version == 0 */ | ||
| 89 | |||
| 90 | if (!X509_REQ_set_subject_name(ret,X509_get_subject_name(x))) | ||
| 91 | goto err; | ||
| 92 | |||
| 93 | pktmp = X509_get_pubkey(x); | ||
| 94 | i=X509_REQ_set_pubkey(ret,pktmp); | ||
| 95 | EVP_PKEY_free(pktmp); | ||
| 96 | if (!i) goto err; | ||
| 97 | |||
| 98 | if (pkey != NULL) | ||
| 99 | { | ||
| 100 | if (!X509_REQ_sign(ret,pkey,md)) | ||
| 101 | goto err; | ||
| 102 | } | ||
| 103 | return(ret); | ||
| 104 | err: | ||
| 105 | X509_REQ_free(ret); | ||
| 106 | return(NULL); | ||
| 107 | } | ||
| 108 | |||
| 109 | EVP_PKEY *X509_REQ_get_pubkey(X509_REQ *req) | ||
| 110 | { | ||
| 111 | if ((req == NULL) || (req->req_info == NULL)) | ||
| 112 | return(NULL); | ||
| 113 | return(X509_PUBKEY_get(req->req_info->pubkey)); | ||
| 114 | } | ||
| 115 | |||
| 116 | /* It seems several organisations had the same idea of including a list of | ||
| 117 | * extensions in a certificate request. There are at least two OIDs that are | ||
| 118 | * used and there may be more: so the list is configurable. | ||
| 119 | */ | ||
| 120 | |||
| 121 | static int ext_nid_list[] = { NID_ms_ext_req, NID_ext_req, NID_undef}; | ||
| 122 | |||
| 123 | static int *ext_nids = ext_nid_list; | ||
| 124 | |||
| 125 | int X509_REQ_extension_nid(int req_nid) | ||
| 126 | { | ||
| 127 | int i, nid; | ||
| 128 | for(i = 0; ; i++) { | ||
| 129 | nid = ext_nids[i]; | ||
| 130 | if(nid == NID_undef) return 0; | ||
| 131 | else if (req_nid == nid) return 1; | ||
| 132 | } | ||
| 133 | } | ||
| 134 | |||
| 135 | int *X509_REQ_get_extension_nids(void) | ||
| 136 | { | ||
| 137 | return ext_nids; | ||
| 138 | } | ||
| 139 | |||
| 140 | void X509_REQ_set_extension_nids(int *nids) | ||
| 141 | { | ||
| 142 | ext_nids = nids; | ||
| 143 | } | ||
| 144 | |||
| 145 | STACK_OF(X509_EXTENSION) *X509_REQ_get_extensions(X509_REQ *req) | ||
| 146 | { | ||
| 147 | X509_ATTRIBUTE *attr; | ||
| 148 | STACK_OF(X509_ATTRIBUTE) *sk; | ||
| 149 | ASN1_TYPE *ext = NULL; | ||
| 150 | int i; | ||
| 151 | unsigned char *p; | ||
| 152 | if ((req == NULL) || (req->req_info == NULL)) | ||
| 153 | return(NULL); | ||
| 154 | sk=req->req_info->attributes; | ||
| 155 | if (!sk) return NULL; | ||
| 156 | for(i = 0; i < sk_X509_ATTRIBUTE_num(sk); i++) { | ||
| 157 | attr = sk_X509_ATTRIBUTE_value(sk, i); | ||
| 158 | if(X509_REQ_extension_nid(OBJ_obj2nid(attr->object))) { | ||
| 159 | if(attr->single) ext = attr->value.single; | ||
| 160 | else if(sk_ASN1_TYPE_num(attr->value.set)) | ||
| 161 | ext = sk_ASN1_TYPE_value(attr->value.set, 0); | ||
| 162 | break; | ||
| 163 | } | ||
| 164 | } | ||
| 165 | if(!ext || (ext->type != V_ASN1_SEQUENCE)) return NULL; | ||
| 166 | p = ext->value.sequence->data; | ||
| 167 | return d2i_ASN1_SET_OF_X509_EXTENSION(NULL, &p, | ||
| 168 | ext->value.sequence->length, | ||
| 169 | d2i_X509_EXTENSION, X509_EXTENSION_free, | ||
| 170 | V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL); | ||
| 171 | } | ||
| 172 | |||
| 173 | /* Add a STACK_OF extensions to a certificate request: allow alternative OIDs | ||
| 174 | * in case we want to create a non standard one. | ||
| 175 | */ | ||
| 176 | |||
| 177 | int X509_REQ_add_extensions_nid(X509_REQ *req, STACK_OF(X509_EXTENSION) *exts, | ||
| 178 | int nid) | ||
| 179 | { | ||
| 180 | unsigned char *p = NULL, *q; | ||
| 181 | long len; | ||
| 182 | ASN1_TYPE *at = NULL; | ||
| 183 | X509_ATTRIBUTE *attr = NULL; | ||
| 184 | if(!(at = ASN1_TYPE_new()) || | ||
| 185 | !(at->value.sequence = ASN1_STRING_new())) goto err; | ||
| 186 | |||
| 187 | at->type = V_ASN1_SEQUENCE; | ||
| 188 | /* Generate encoding of extensions */ | ||
| 189 | len = i2d_ASN1_SET_OF_X509_EXTENSION(exts, NULL, i2d_X509_EXTENSION, | ||
| 190 | V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL, IS_SEQUENCE); | ||
| 191 | if(!(p = OPENSSL_malloc(len))) goto err; | ||
| 192 | q = p; | ||
| 193 | i2d_ASN1_SET_OF_X509_EXTENSION(exts, &q, i2d_X509_EXTENSION, | ||
| 194 | V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL, IS_SEQUENCE); | ||
| 195 | at->value.sequence->data = p; | ||
| 196 | p = NULL; | ||
| 197 | at->value.sequence->length = len; | ||
| 198 | if(!(attr = X509_ATTRIBUTE_new())) goto err; | ||
| 199 | if(!(attr->value.set = sk_ASN1_TYPE_new_null())) goto err; | ||
| 200 | if(!sk_ASN1_TYPE_push(attr->value.set, at)) goto err; | ||
| 201 | at = NULL; | ||
| 202 | attr->single = 0; | ||
| 203 | attr->object = OBJ_nid2obj(nid); | ||
| 204 | if(!sk_X509_ATTRIBUTE_push(req->req_info->attributes, attr)) goto err; | ||
| 205 | return 1; | ||
| 206 | err: | ||
| 207 | if(p) OPENSSL_free(p); | ||
| 208 | X509_ATTRIBUTE_free(attr); | ||
| 209 | ASN1_TYPE_free(at); | ||
| 210 | return 0; | ||
| 211 | } | ||
| 212 | /* This is the normal usage: use the "official" OID */ | ||
| 213 | int X509_REQ_add_extensions(X509_REQ *req, STACK_OF(X509_EXTENSION) *exts) | ||
| 214 | { | ||
| 215 | return X509_REQ_add_extensions_nid(req, exts, NID_ext_req); | ||
| 216 | } | ||
| 217 | |||
| 218 | /* Request attribute functions */ | ||
| 219 | |||
| 220 | int X509_REQ_get_attr_count(const X509_REQ *req) | ||
| 221 | { | ||
| 222 | return X509at_get_attr_count(req->req_info->attributes); | ||
| 223 | } | ||
| 224 | |||
| 225 | int X509_REQ_get_attr_by_NID(const X509_REQ *req, int nid, | ||
| 226 | int lastpos) | ||
| 227 | { | ||
| 228 | return X509at_get_attr_by_NID(req->req_info->attributes, nid, lastpos); | ||
| 229 | } | ||
| 230 | |||
| 231 | int X509_REQ_get_attr_by_OBJ(const X509_REQ *req, ASN1_OBJECT *obj, | ||
| 232 | int lastpos) | ||
| 233 | { | ||
| 234 | return X509at_get_attr_by_OBJ(req->req_info->attributes, obj, lastpos); | ||
| 235 | } | ||
| 236 | |||
| 237 | X509_ATTRIBUTE *X509_REQ_get_attr(const X509_REQ *req, int loc) | ||
| 238 | { | ||
| 239 | return X509at_get_attr(req->req_info->attributes, loc); | ||
| 240 | } | ||
| 241 | |||
| 242 | X509_ATTRIBUTE *X509_REQ_delete_attr(X509_REQ *req, int loc) | ||
| 243 | { | ||
| 244 | return X509at_delete_attr(req->req_info->attributes, loc); | ||
| 245 | } | ||
| 246 | |||
| 247 | int X509_REQ_add1_attr(X509_REQ *req, X509_ATTRIBUTE *attr) | ||
| 248 | { | ||
| 249 | if(X509at_add1_attr(&req->req_info->attributes, attr)) return 1; | ||
| 250 | return 0; | ||
| 251 | } | ||
| 252 | |||
| 253 | int X509_REQ_add1_attr_by_OBJ(X509_REQ *req, | ||
| 254 | const ASN1_OBJECT *obj, int type, | ||
| 255 | const unsigned char *bytes, int len) | ||
| 256 | { | ||
| 257 | if(X509at_add1_attr_by_OBJ(&req->req_info->attributes, obj, | ||
| 258 | type, bytes, len)) return 1; | ||
| 259 | return 0; | ||
| 260 | } | ||
| 261 | |||
| 262 | int X509_REQ_add1_attr_by_NID(X509_REQ *req, | ||
| 263 | int nid, int type, | ||
| 264 | const unsigned char *bytes, int len) | ||
| 265 | { | ||
| 266 | if(X509at_add1_attr_by_NID(&req->req_info->attributes, nid, | ||
| 267 | type, bytes, len)) return 1; | ||
| 268 | return 0; | ||
| 269 | } | ||
| 270 | |||
| 271 | int X509_REQ_add1_attr_by_txt(X509_REQ *req, | ||
| 272 | const char *attrname, int type, | ||
| 273 | const unsigned char *bytes, int len) | ||
| 274 | { | ||
| 275 | if(X509at_add1_attr_by_txt(&req->req_info->attributes, attrname, | ||
| 276 | type, bytes, len)) return 1; | ||
| 277 | return 0; | ||
| 278 | } | ||
