x509_cmp.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417
  1. /* crypto/x509/x509_cmp.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. #include <stdio.h>
  59. #include <ctype.h>
  60. #include "cryptlib.h"
  61. #include <openssl/asn1.h>
  62. #include <openssl/objects.h>
  63. #include <openssl/x509.h>
  64. #include <openssl/x509v3.h>
  65. int X509_issuer_and_serial_cmp(const X509 *a, const X509 *b)
  66. {
  67. int i;
  68. X509_CINF *ai,*bi;
  69. ai=a->cert_info;
  70. bi=b->cert_info;
  71. i=M_ASN1_INTEGER_cmp(ai->serialNumber,bi->serialNumber);
  72. if (i) return(i);
  73. return(X509_NAME_cmp(ai->issuer,bi->issuer));
  74. }
  75. #ifndef OPENSSL_NO_MD5
  76. unsigned long X509_issuer_and_serial_hash(X509 *a)
  77. {
  78. unsigned long ret=0;
  79. EVP_MD_CTX ctx;
  80. unsigned char md[16];
  81. char *f;
  82. EVP_MD_CTX_init(&ctx);
  83. f=X509_NAME_oneline(a->cert_info->issuer,NULL,0);
  84. ret=strlen(f);
  85. EVP_DigestInit_ex(&ctx, EVP_md5(), NULL);
  86. EVP_DigestUpdate(&ctx,(unsigned char *)f,ret);
  87. OPENSSL_free(f);
  88. EVP_DigestUpdate(&ctx,(unsigned char *)a->cert_info->serialNumber->data,
  89. (unsigned long)a->cert_info->serialNumber->length);
  90. EVP_DigestFinal_ex(&ctx,&(md[0]),NULL);
  91. ret=( ((unsigned long)md[0] )|((unsigned long)md[1]<<8L)|
  92. ((unsigned long)md[2]<<16L)|((unsigned long)md[3]<<24L)
  93. )&0xffffffffL;
  94. EVP_MD_CTX_cleanup(&ctx);
  95. return(ret);
  96. }
  97. #endif
  98. int X509_issuer_name_cmp(const X509 *a, const X509 *b)
  99. {
  100. return(X509_NAME_cmp(a->cert_info->issuer,b->cert_info->issuer));
  101. }
  102. int X509_subject_name_cmp(const X509 *a, const X509 *b)
  103. {
  104. return(X509_NAME_cmp(a->cert_info->subject,b->cert_info->subject));
  105. }
  106. int X509_CRL_cmp(const X509_CRL *a, const X509_CRL *b)
  107. {
  108. return(X509_NAME_cmp(a->crl->issuer,b->crl->issuer));
  109. }
  110. X509_NAME *X509_get_issuer_name(X509 *a)
  111. {
  112. return(a->cert_info->issuer);
  113. }
  114. unsigned long X509_issuer_name_hash(X509 *x)
  115. {
  116. return(X509_NAME_hash(x->cert_info->issuer));
  117. }
  118. X509_NAME *X509_get_subject_name(X509 *a)
  119. {
  120. return(a->cert_info->subject);
  121. }
  122. ASN1_INTEGER *X509_get_serialNumber(X509 *a)
  123. {
  124. return(a->cert_info->serialNumber);
  125. }
  126. unsigned long X509_subject_name_hash(X509 *x)
  127. {
  128. return(X509_NAME_hash(x->cert_info->subject));
  129. }
  130. #ifndef OPENSSL_NO_SHA
  131. /* Compare two certificates: they must be identical for
  132. * this to work. NB: Although "cmp" operations are generally
  133. * prototyped to take "const" arguments (eg. for use in
  134. * STACKs), the way X509 handling is - these operations may
  135. * involve ensuring the hashes are up-to-date and ensuring
  136. * certain cert information is cached. So this is the point
  137. * where the "depth-first" constification tree has to halt
  138. * with an evil cast.
  139. */
  140. int X509_cmp(const X509 *a, const X509 *b)
  141. {
  142. /* ensure hash is valid */
  143. X509_check_purpose((X509 *)a, -1, 0);
  144. X509_check_purpose((X509 *)b, -1, 0);
  145. return memcmp(a->sha1_hash, b->sha1_hash, SHA_DIGEST_LENGTH);
  146. }
  147. #endif
  148. /* Case insensitive string comparision */
  149. static int nocase_cmp(const ASN1_STRING *a, const ASN1_STRING *b)
  150. {
  151. int i;
  152. if (a->length != b->length)
  153. return (a->length - b->length);
  154. for (i=0; i<a->length; i++)
  155. {
  156. int ca, cb;
  157. ca = tolower(a->data[i]);
  158. cb = tolower(b->data[i]);
  159. if (ca != cb)
  160. return(ca-cb);
  161. }
  162. return 0;
  163. }
  164. /* Case insensitive string comparision with space normalization
  165. * Space normalization - ignore leading, trailing spaces,
  166. * multiple spaces between characters are replaced by single space
  167. */
  168. static int nocase_spacenorm_cmp(const ASN1_STRING *a, const ASN1_STRING *b)
  169. {
  170. unsigned char *pa = NULL, *pb = NULL;
  171. int la, lb;
  172. la = a->length;
  173. lb = b->length;
  174. pa = a->data;
  175. pb = b->data;
  176. /* skip leading spaces */
  177. while (la > 0 && isspace(*pa))
  178. {
  179. la--;
  180. pa++;
  181. }
  182. while (lb > 0 && isspace(*pb))
  183. {
  184. lb--;
  185. pb++;
  186. }
  187. /* skip trailing spaces */
  188. while (la > 0 && isspace(pa[la-1]))
  189. la--;
  190. while (lb > 0 && isspace(pb[lb-1]))
  191. lb--;
  192. /* compare strings with space normalization */
  193. while (la > 0 && lb > 0)
  194. {
  195. int ca, cb;
  196. /* compare character */
  197. ca = tolower(*pa);
  198. cb = tolower(*pb);
  199. if (ca != cb)
  200. return (ca - cb);
  201. pa++; pb++;
  202. la--; lb--;
  203. if (la <= 0 || lb <= 0)
  204. break;
  205. /* is white space next character ? */
  206. if (isspace(*pa) && isspace(*pb))
  207. {
  208. /* skip remaining white spaces */
  209. while (la > 0 && isspace(*pa))
  210. {
  211. la--;
  212. pa++;
  213. }
  214. while (lb > 0 && isspace(*pb))
  215. {
  216. lb--;
  217. pb++;
  218. }
  219. }
  220. }
  221. if (la > 0 || lb > 0)
  222. return la - lb;
  223. return 0;
  224. }
  225. static int asn1_string_memcmp(ASN1_STRING *a, ASN1_STRING *b)
  226. {
  227. int j;
  228. j = a->length - b->length;
  229. if (j)
  230. return j;
  231. return memcmp(a->data, b->data, a->length);
  232. }
  233. #define STR_TYPE_CMP (B_ASN1_PRINTABLESTRING|B_ASN1_T61STRING|B_ASN1_UTF8STRING)
  234. int X509_NAME_cmp(const X509_NAME *a, const X509_NAME *b)
  235. {
  236. int i,j;
  237. X509_NAME_ENTRY *na,*nb;
  238. unsigned long nabit, nbbit;
  239. j = sk_X509_NAME_ENTRY_num(a->entries)
  240. - sk_X509_NAME_ENTRY_num(b->entries);
  241. if (j)
  242. return j;
  243. for (i=sk_X509_NAME_ENTRY_num(a->entries)-1; i>=0; i--)
  244. {
  245. na=sk_X509_NAME_ENTRY_value(a->entries,i);
  246. nb=sk_X509_NAME_ENTRY_value(b->entries,i);
  247. j=na->value->type-nb->value->type;
  248. if (j)
  249. {
  250. nabit = ASN1_tag2bit(na->value->type);
  251. nbbit = ASN1_tag2bit(nb->value->type);
  252. if (!(nabit & STR_TYPE_CMP) ||
  253. !(nbbit & STR_TYPE_CMP))
  254. return j;
  255. j = asn1_string_memcmp(na->value, nb->value);
  256. }
  257. else if (na->value->type == V_ASN1_PRINTABLESTRING)
  258. j=nocase_spacenorm_cmp(na->value, nb->value);
  259. else if (na->value->type == V_ASN1_IA5STRING
  260. && OBJ_obj2nid(na->object) == NID_pkcs9_emailAddress)
  261. j=nocase_cmp(na->value, nb->value);
  262. else
  263. j = asn1_string_memcmp(na->value, nb->value);
  264. if (j) return(j);
  265. j=na->set-nb->set;
  266. if (j) return(j);
  267. }
  268. /* We will check the object types after checking the values
  269. * since the values will more often be different than the object
  270. * types. */
  271. for (i=sk_X509_NAME_ENTRY_num(a->entries)-1; i>=0; i--)
  272. {
  273. na=sk_X509_NAME_ENTRY_value(a->entries,i);
  274. nb=sk_X509_NAME_ENTRY_value(b->entries,i);
  275. j=OBJ_cmp(na->object,nb->object);
  276. if (j) return(j);
  277. }
  278. return(0);
  279. }
  280. #ifndef OPENSSL_NO_MD5
  281. /* I now DER encode the name and hash it. Since I cache the DER encoding,
  282. * this is reasonably efficient. */
  283. unsigned long X509_NAME_hash(X509_NAME *x)
  284. {
  285. unsigned long ret=0;
  286. unsigned char md[16];
  287. /* Make sure X509_NAME structure contains valid cached encoding */
  288. i2d_X509_NAME(x,NULL);
  289. EVP_Digest(x->bytes->data, x->bytes->length, md, NULL, EVP_md5(), NULL);
  290. ret=( ((unsigned long)md[0] )|((unsigned long)md[1]<<8L)|
  291. ((unsigned long)md[2]<<16L)|((unsigned long)md[3]<<24L)
  292. )&0xffffffffL;
  293. return(ret);
  294. }
  295. #endif
  296. /* Search a stack of X509 for a match */
  297. X509 *X509_find_by_issuer_and_serial(STACK_OF(X509) *sk, X509_NAME *name,
  298. ASN1_INTEGER *serial)
  299. {
  300. int i;
  301. X509_CINF cinf;
  302. X509 x,*x509=NULL;
  303. if(!sk) return NULL;
  304. x.cert_info= &cinf;
  305. cinf.serialNumber=serial;
  306. cinf.issuer=name;
  307. for (i=0; i<sk_X509_num(sk); i++)
  308. {
  309. x509=sk_X509_value(sk,i);
  310. if (X509_issuer_and_serial_cmp(x509,&x) == 0)
  311. return(x509);
  312. }
  313. return(NULL);
  314. }
  315. X509 *X509_find_by_subject(STACK_OF(X509) *sk, X509_NAME *name)
  316. {
  317. X509 *x509;
  318. int i;
  319. for (i=0; i<sk_X509_num(sk); i++)
  320. {
  321. x509=sk_X509_value(sk,i);
  322. if (X509_NAME_cmp(X509_get_subject_name(x509),name) == 0)
  323. return(x509);
  324. }
  325. return(NULL);
  326. }
  327. EVP_PKEY *X509_get_pubkey(X509 *x)
  328. {
  329. if ((x == NULL) || (x->cert_info == NULL))
  330. return(NULL);
  331. return(X509_PUBKEY_get(x->cert_info->key));
  332. }
  333. ASN1_BIT_STRING *X509_get0_pubkey_bitstr(const X509 *x)
  334. {
  335. if(!x) return NULL;
  336. return x->cert_info->key->public_key;
  337. }
  338. int X509_check_private_key(X509 *x, EVP_PKEY *k)
  339. {
  340. EVP_PKEY *xk;
  341. int ret;
  342. xk=X509_get_pubkey(x);
  343. if (xk)
  344. ret = EVP_PKEY_cmp(xk, k);
  345. else
  346. ret = -2;
  347. switch (ret)
  348. {
  349. case 1:
  350. break;
  351. case 0:
  352. X509err(X509_F_X509_CHECK_PRIVATE_KEY,X509_R_KEY_VALUES_MISMATCH);
  353. break;
  354. case -1:
  355. X509err(X509_F_X509_CHECK_PRIVATE_KEY,X509_R_KEY_TYPE_MISMATCH);
  356. break;
  357. case -2:
  358. X509err(X509_F_X509_CHECK_PRIVATE_KEY,X509_R_UNKNOWN_KEY_TYPE);
  359. }
  360. if (xk)
  361. EVP_PKEY_free(xk);
  362. if (ret > 0)
  363. return 1;
  364. return 0;
  365. }