x_pubkey.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375
  1. /* crypto/asn1/x_pubkey.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 "cryptlib.h"
  60. #include <openssl/asn1t.h>
  61. #include <openssl/x509.h>
  62. #include "asn1_locl.h"
  63. #ifndef OPENSSL_NO_RSA
  64. # include <openssl/rsa.h>
  65. #endif
  66. #ifndef OPENSSL_NO_DSA
  67. # include <openssl/dsa.h>
  68. #endif
  69. /* Minor tweak to operation: free up EVP_PKEY */
  70. static int pubkey_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it,
  71. void *exarg)
  72. {
  73. if (operation == ASN1_OP_FREE_POST) {
  74. X509_PUBKEY *pubkey = (X509_PUBKEY *)*pval;
  75. EVP_PKEY_free(pubkey->pkey);
  76. }
  77. return 1;
  78. }
  79. ASN1_SEQUENCE_cb(X509_PUBKEY, pubkey_cb) = {
  80. ASN1_SIMPLE(X509_PUBKEY, algor, X509_ALGOR),
  81. ASN1_SIMPLE(X509_PUBKEY, public_key, ASN1_BIT_STRING)
  82. } ASN1_SEQUENCE_END_cb(X509_PUBKEY, X509_PUBKEY)
  83. IMPLEMENT_ASN1_FUNCTIONS(X509_PUBKEY)
  84. int X509_PUBKEY_set(X509_PUBKEY **x, EVP_PKEY *pkey)
  85. {
  86. X509_PUBKEY *pk = NULL;
  87. if (x == NULL)
  88. return (0);
  89. if ((pk = X509_PUBKEY_new()) == NULL)
  90. goto error;
  91. if (pkey->ameth) {
  92. if (pkey->ameth->pub_encode) {
  93. if (!pkey->ameth->pub_encode(pk, pkey)) {
  94. X509err(X509_F_X509_PUBKEY_SET,
  95. X509_R_PUBLIC_KEY_ENCODE_ERROR);
  96. goto error;
  97. }
  98. } else {
  99. X509err(X509_F_X509_PUBKEY_SET, X509_R_METHOD_NOT_SUPPORTED);
  100. goto error;
  101. }
  102. } else {
  103. X509err(X509_F_X509_PUBKEY_SET, X509_R_UNSUPPORTED_ALGORITHM);
  104. goto error;
  105. }
  106. if (*x != NULL)
  107. X509_PUBKEY_free(*x);
  108. *x = pk;
  109. return 1;
  110. error:
  111. if (pk != NULL)
  112. X509_PUBKEY_free(pk);
  113. return 0;
  114. }
  115. EVP_PKEY *X509_PUBKEY_get(X509_PUBKEY *key)
  116. {
  117. EVP_PKEY *ret = NULL;
  118. if (key == NULL)
  119. goto error;
  120. if (key->pkey != NULL) {
  121. CRYPTO_add(&key->pkey->references, 1, CRYPTO_LOCK_EVP_PKEY);
  122. return key->pkey;
  123. }
  124. if (key->public_key == NULL)
  125. goto error;
  126. if ((ret = EVP_PKEY_new()) == NULL) {
  127. X509err(X509_F_X509_PUBKEY_GET, ERR_R_MALLOC_FAILURE);
  128. goto error;
  129. }
  130. if (!EVP_PKEY_set_type(ret, OBJ_obj2nid(key->algor->algorithm))) {
  131. X509err(X509_F_X509_PUBKEY_GET, X509_R_UNSUPPORTED_ALGORITHM);
  132. goto error;
  133. }
  134. if (ret->ameth->pub_decode) {
  135. if (!ret->ameth->pub_decode(ret, key)) {
  136. X509err(X509_F_X509_PUBKEY_GET, X509_R_PUBLIC_KEY_DECODE_ERROR);
  137. goto error;
  138. }
  139. } else {
  140. X509err(X509_F_X509_PUBKEY_GET, X509_R_METHOD_NOT_SUPPORTED);
  141. goto error;
  142. }
  143. /* Check to see if another thread set key->pkey first */
  144. CRYPTO_w_lock(CRYPTO_LOCK_EVP_PKEY);
  145. if (key->pkey) {
  146. CRYPTO_w_unlock(CRYPTO_LOCK_EVP_PKEY);
  147. EVP_PKEY_free(ret);
  148. ret = key->pkey;
  149. } else {
  150. key->pkey = ret;
  151. CRYPTO_w_unlock(CRYPTO_LOCK_EVP_PKEY);
  152. }
  153. CRYPTO_add(&ret->references, 1, CRYPTO_LOCK_EVP_PKEY);
  154. return ret;
  155. error:
  156. if (ret != NULL)
  157. EVP_PKEY_free(ret);
  158. return (NULL);
  159. }
  160. /*
  161. * Now two pseudo ASN1 routines that take an EVP_PKEY structure and encode or
  162. * decode as X509_PUBKEY
  163. */
  164. EVP_PKEY *d2i_PUBKEY(EVP_PKEY **a, const unsigned char **pp, long length)
  165. {
  166. X509_PUBKEY *xpk;
  167. EVP_PKEY *pktmp;
  168. const unsigned char *q;
  169. q = *pp;
  170. xpk = d2i_X509_PUBKEY(NULL, &q, length);
  171. if (!xpk)
  172. return NULL;
  173. pktmp = X509_PUBKEY_get(xpk);
  174. X509_PUBKEY_free(xpk);
  175. if (!pktmp)
  176. return NULL;
  177. *pp = q;
  178. if (a) {
  179. EVP_PKEY_free(*a);
  180. *a = pktmp;
  181. }
  182. return pktmp;
  183. }
  184. int i2d_PUBKEY(EVP_PKEY *a, unsigned char **pp)
  185. {
  186. X509_PUBKEY *xpk = NULL;
  187. int ret;
  188. if (!a)
  189. return 0;
  190. if (!X509_PUBKEY_set(&xpk, a))
  191. return 0;
  192. ret = i2d_X509_PUBKEY(xpk, pp);
  193. X509_PUBKEY_free(xpk);
  194. return ret;
  195. }
  196. /*
  197. * The following are equivalents but which return RSA and DSA keys
  198. */
  199. #ifndef OPENSSL_NO_RSA
  200. RSA *d2i_RSA_PUBKEY(RSA **a, const unsigned char **pp, long length)
  201. {
  202. EVP_PKEY *pkey;
  203. RSA *key;
  204. const unsigned char *q;
  205. q = *pp;
  206. pkey = d2i_PUBKEY(NULL, &q, length);
  207. if (!pkey)
  208. return NULL;
  209. key = EVP_PKEY_get1_RSA(pkey);
  210. EVP_PKEY_free(pkey);
  211. if (!key)
  212. return NULL;
  213. *pp = q;
  214. if (a) {
  215. RSA_free(*a);
  216. *a = key;
  217. }
  218. return key;
  219. }
  220. int i2d_RSA_PUBKEY(RSA *a, unsigned char **pp)
  221. {
  222. EVP_PKEY *pktmp;
  223. int ret;
  224. if (!a)
  225. return 0;
  226. pktmp = EVP_PKEY_new();
  227. if (!pktmp) {
  228. ASN1err(ASN1_F_I2D_RSA_PUBKEY, ERR_R_MALLOC_FAILURE);
  229. return 0;
  230. }
  231. EVP_PKEY_set1_RSA(pktmp, a);
  232. ret = i2d_PUBKEY(pktmp, pp);
  233. EVP_PKEY_free(pktmp);
  234. return ret;
  235. }
  236. #endif
  237. #ifndef OPENSSL_NO_DSA
  238. DSA *d2i_DSA_PUBKEY(DSA **a, const unsigned char **pp, long length)
  239. {
  240. EVP_PKEY *pkey;
  241. DSA *key;
  242. const unsigned char *q;
  243. q = *pp;
  244. pkey = d2i_PUBKEY(NULL, &q, length);
  245. if (!pkey)
  246. return NULL;
  247. key = EVP_PKEY_get1_DSA(pkey);
  248. EVP_PKEY_free(pkey);
  249. if (!key)
  250. return NULL;
  251. *pp = q;
  252. if (a) {
  253. DSA_free(*a);
  254. *a = key;
  255. }
  256. return key;
  257. }
  258. int i2d_DSA_PUBKEY(DSA *a, unsigned char **pp)
  259. {
  260. EVP_PKEY *pktmp;
  261. int ret;
  262. if (!a)
  263. return 0;
  264. pktmp = EVP_PKEY_new();
  265. if (!pktmp) {
  266. ASN1err(ASN1_F_I2D_DSA_PUBKEY, ERR_R_MALLOC_FAILURE);
  267. return 0;
  268. }
  269. EVP_PKEY_set1_DSA(pktmp, a);
  270. ret = i2d_PUBKEY(pktmp, pp);
  271. EVP_PKEY_free(pktmp);
  272. return ret;
  273. }
  274. #endif
  275. #ifndef OPENSSL_NO_EC
  276. EC_KEY *d2i_EC_PUBKEY(EC_KEY **a, const unsigned char **pp, long length)
  277. {
  278. EVP_PKEY *pkey;
  279. EC_KEY *key;
  280. const unsigned char *q;
  281. q = *pp;
  282. pkey = d2i_PUBKEY(NULL, &q, length);
  283. if (!pkey)
  284. return (NULL);
  285. key = EVP_PKEY_get1_EC_KEY(pkey);
  286. EVP_PKEY_free(pkey);
  287. if (!key)
  288. return (NULL);
  289. *pp = q;
  290. if (a) {
  291. EC_KEY_free(*a);
  292. *a = key;
  293. }
  294. return (key);
  295. }
  296. int i2d_EC_PUBKEY(EC_KEY *a, unsigned char **pp)
  297. {
  298. EVP_PKEY *pktmp;
  299. int ret;
  300. if (!a)
  301. return (0);
  302. if ((pktmp = EVP_PKEY_new()) == NULL) {
  303. ASN1err(ASN1_F_I2D_EC_PUBKEY, ERR_R_MALLOC_FAILURE);
  304. return (0);
  305. }
  306. EVP_PKEY_set1_EC_KEY(pktmp, a);
  307. ret = i2d_PUBKEY(pktmp, pp);
  308. EVP_PKEY_free(pktmp);
  309. return (ret);
  310. }
  311. #endif
  312. int X509_PUBKEY_set0_param(X509_PUBKEY *pub, ASN1_OBJECT *aobj,
  313. int ptype, void *pval,
  314. unsigned char *penc, int penclen)
  315. {
  316. if (!X509_ALGOR_set0(pub->algor, aobj, ptype, pval))
  317. return 0;
  318. if (penc) {
  319. if (pub->public_key->data)
  320. OPENSSL_free(pub->public_key->data);
  321. pub->public_key->data = penc;
  322. pub->public_key->length = penclen;
  323. /* Set number of unused bits to zero */
  324. pub->public_key->flags &= ~(ASN1_STRING_FLAG_BITS_LEFT | 0x07);
  325. pub->public_key->flags |= ASN1_STRING_FLAG_BITS_LEFT;
  326. }
  327. return 1;
  328. }
  329. int X509_PUBKEY_get0_param(ASN1_OBJECT **ppkalg,
  330. const unsigned char **pk, int *ppklen,
  331. X509_ALGOR **pa, X509_PUBKEY *pub)
  332. {
  333. if (ppkalg)
  334. *ppkalg = pub->algor->algorithm;
  335. if (pk) {
  336. *pk = pub->public_key->data;
  337. *ppklen = pub->public_key->length;
  338. }
  339. if (pa)
  340. *pa = pub->algor;
  341. return 1;
  342. }