x509.c 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071
  1. /*
  2. * X.509 common functions for parsing and verification
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  5. * SPDX-License-Identifier: Apache-2.0
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License"); you may
  8. * not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
  15. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. *
  19. * This file is part of mbed TLS (https://tls.mbed.org)
  20. */
  21. /*
  22. * The ITU-T X.509 standard defines a certificate format for PKI.
  23. *
  24. * http://www.ietf.org/rfc/rfc5280.txt (Certificates and CRLs)
  25. * http://www.ietf.org/rfc/rfc3279.txt (Alg IDs for CRLs)
  26. * http://www.ietf.org/rfc/rfc2986.txt (CSRs, aka PKCS#10)
  27. *
  28. * http://www.itu.int/ITU-T/studygroups/com17/languages/X.680-0207.pdf
  29. * http://www.itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf
  30. */
  31. /* Ensure gmtime_r is available even with -std=c99; must be included before
  32. * config.h, which pulls in glibc's features.h. Harmless on other platforms. */
  33. #define _POSIX_C_SOURCE 200112L
  34. #if !defined(MBEDTLS_CONFIG_FILE)
  35. #include "mbedtls/config.h"
  36. #else
  37. #include MBEDTLS_CONFIG_FILE
  38. #endif
  39. #if defined(MBEDTLS_X509_USE_C)
  40. #include "mbedtls/x509.h"
  41. #include "mbedtls/asn1.h"
  42. #include "mbedtls/oid.h"
  43. #include <stdio.h>
  44. #include <string.h>
  45. #if defined(MBEDTLS_PEM_PARSE_C)
  46. #include "mbedtls/pem.h"
  47. #endif
  48. #if defined(MBEDTLS_PLATFORM_C)
  49. #include "mbedtls/platform.h"
  50. #else
  51. #include <stdio.h>
  52. #include <stdlib.h>
  53. #define mbedtls_free free
  54. #define mbedtls_calloc calloc
  55. #define mbedtls_printf printf
  56. #define mbedtls_snprintf snprintf
  57. #endif
  58. #if defined(MBEDTLS_HAVE_TIME)
  59. #include "mbedtls/platform_time.h"
  60. #endif
  61. #if defined(MBEDTLS_HAVE_TIME_DATE)
  62. #include <time.h>
  63. #endif
  64. #define CHECK(code) if( ( ret = code ) != 0 ){ return( ret ); }
  65. #define CHECK_RANGE(min, max, val) if( val < min || val > max ){ return( ret ); }
  66. /*
  67. * CertificateSerialNumber ::= INTEGER
  68. */
  69. int mbedtls_x509_get_serial( unsigned char **p, const unsigned char *end,
  70. mbedtls_x509_buf *serial )
  71. {
  72. int ret;
  73. if( ( end - *p ) < 1 )
  74. return( MBEDTLS_ERR_X509_INVALID_SERIAL +
  75. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  76. if( **p != ( MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_PRIMITIVE | 2 ) &&
  77. **p != MBEDTLS_ASN1_INTEGER )
  78. return( MBEDTLS_ERR_X509_INVALID_SERIAL +
  79. MBEDTLS_ERR_ASN1_UNEXPECTED_TAG );
  80. serial->tag = *(*p)++;
  81. if( ( ret = mbedtls_asn1_get_len( p, end, &serial->len ) ) != 0 )
  82. return( MBEDTLS_ERR_X509_INVALID_SERIAL + ret );
  83. serial->p = *p;
  84. *p += serial->len;
  85. return( 0 );
  86. }
  87. /* Get an algorithm identifier without parameters (eg for signatures)
  88. *
  89. * AlgorithmIdentifier ::= SEQUENCE {
  90. * algorithm OBJECT IDENTIFIER,
  91. * parameters ANY DEFINED BY algorithm OPTIONAL }
  92. */
  93. int mbedtls_x509_get_alg_null( unsigned char **p, const unsigned char *end,
  94. mbedtls_x509_buf *alg )
  95. {
  96. int ret;
  97. if( ( ret = mbedtls_asn1_get_alg_null( p, end, alg ) ) != 0 )
  98. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  99. return( 0 );
  100. }
  101. /*
  102. * Parse an algorithm identifier with (optional) paramaters
  103. */
  104. int mbedtls_x509_get_alg( unsigned char **p, const unsigned char *end,
  105. mbedtls_x509_buf *alg, mbedtls_x509_buf *params )
  106. {
  107. int ret;
  108. if( ( ret = mbedtls_asn1_get_alg( p, end, alg, params ) ) != 0 )
  109. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  110. return( 0 );
  111. }
  112. #if defined(MBEDTLS_X509_RSASSA_PSS_SUPPORT)
  113. /*
  114. * HashAlgorithm ::= AlgorithmIdentifier
  115. *
  116. * AlgorithmIdentifier ::= SEQUENCE {
  117. * algorithm OBJECT IDENTIFIER,
  118. * parameters ANY DEFINED BY algorithm OPTIONAL }
  119. *
  120. * For HashAlgorithm, parameters MUST be NULL or absent.
  121. */
  122. static int x509_get_hash_alg( const mbedtls_x509_buf *alg, mbedtls_md_type_t *md_alg )
  123. {
  124. int ret;
  125. unsigned char *p;
  126. const unsigned char *end;
  127. mbedtls_x509_buf md_oid;
  128. size_t len;
  129. /* Make sure we got a SEQUENCE and setup bounds */
  130. if( alg->tag != ( MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE ) )
  131. return( MBEDTLS_ERR_X509_INVALID_ALG +
  132. MBEDTLS_ERR_ASN1_UNEXPECTED_TAG );
  133. p = (unsigned char *) alg->p;
  134. end = p + alg->len;
  135. if( p >= end )
  136. return( MBEDTLS_ERR_X509_INVALID_ALG +
  137. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  138. /* Parse md_oid */
  139. md_oid.tag = *p;
  140. if( ( ret = mbedtls_asn1_get_tag( &p, end, &md_oid.len, MBEDTLS_ASN1_OID ) ) != 0 )
  141. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  142. md_oid.p = p;
  143. p += md_oid.len;
  144. /* Get md_alg from md_oid */
  145. if( ( ret = mbedtls_oid_get_md_alg( &md_oid, md_alg ) ) != 0 )
  146. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  147. /* Make sure params is absent of NULL */
  148. if( p == end )
  149. return( 0 );
  150. if( ( ret = mbedtls_asn1_get_tag( &p, end, &len, MBEDTLS_ASN1_NULL ) ) != 0 || len != 0 )
  151. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  152. if( p != end )
  153. return( MBEDTLS_ERR_X509_INVALID_ALG +
  154. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  155. return( 0 );
  156. }
  157. /*
  158. * RSASSA-PSS-params ::= SEQUENCE {
  159. * hashAlgorithm [0] HashAlgorithm DEFAULT sha1Identifier,
  160. * maskGenAlgorithm [1] MaskGenAlgorithm DEFAULT mgf1SHA1Identifier,
  161. * saltLength [2] INTEGER DEFAULT 20,
  162. * trailerField [3] INTEGER DEFAULT 1 }
  163. * -- Note that the tags in this Sequence are explicit.
  164. *
  165. * RFC 4055 (which defines use of RSASSA-PSS in PKIX) states that the value
  166. * of trailerField MUST be 1, and PKCS#1 v2.2 doesn't even define any other
  167. * option. Enfore this at parsing time.
  168. */
  169. int mbedtls_x509_get_rsassa_pss_params( const mbedtls_x509_buf *params,
  170. mbedtls_md_type_t *md_alg, mbedtls_md_type_t *mgf_md,
  171. int *salt_len )
  172. {
  173. int ret;
  174. unsigned char *p;
  175. const unsigned char *end, *end2;
  176. size_t len;
  177. mbedtls_x509_buf alg_id, alg_params;
  178. /* First set everything to defaults */
  179. *md_alg = MBEDTLS_MD_SHA1;
  180. *mgf_md = MBEDTLS_MD_SHA1;
  181. *salt_len = 20;
  182. /* Make sure params is a SEQUENCE and setup bounds */
  183. if( params->tag != ( MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE ) )
  184. return( MBEDTLS_ERR_X509_INVALID_ALG +
  185. MBEDTLS_ERR_ASN1_UNEXPECTED_TAG );
  186. p = (unsigned char *) params->p;
  187. end = p + params->len;
  188. if( p == end )
  189. return( 0 );
  190. /*
  191. * HashAlgorithm
  192. */
  193. if( ( ret = mbedtls_asn1_get_tag( &p, end, &len,
  194. MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 0 ) ) == 0 )
  195. {
  196. end2 = p + len;
  197. /* HashAlgorithm ::= AlgorithmIdentifier (without parameters) */
  198. if( ( ret = mbedtls_x509_get_alg_null( &p, end2, &alg_id ) ) != 0 )
  199. return( ret );
  200. if( ( ret = mbedtls_oid_get_md_alg( &alg_id, md_alg ) ) != 0 )
  201. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  202. if( p != end2 )
  203. return( MBEDTLS_ERR_X509_INVALID_ALG +
  204. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  205. }
  206. else if( ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG )
  207. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  208. if( p == end )
  209. return( 0 );
  210. /*
  211. * MaskGenAlgorithm
  212. */
  213. if( ( ret = mbedtls_asn1_get_tag( &p, end, &len,
  214. MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 1 ) ) == 0 )
  215. {
  216. end2 = p + len;
  217. /* MaskGenAlgorithm ::= AlgorithmIdentifier (params = HashAlgorithm) */
  218. if( ( ret = mbedtls_x509_get_alg( &p, end2, &alg_id, &alg_params ) ) != 0 )
  219. return( ret );
  220. /* Only MFG1 is recognised for now */
  221. if( MBEDTLS_OID_CMP( MBEDTLS_OID_MGF1, &alg_id ) != 0 )
  222. return( MBEDTLS_ERR_X509_FEATURE_UNAVAILABLE +
  223. MBEDTLS_ERR_OID_NOT_FOUND );
  224. /* Parse HashAlgorithm */
  225. if( ( ret = x509_get_hash_alg( &alg_params, mgf_md ) ) != 0 )
  226. return( ret );
  227. if( p != end2 )
  228. return( MBEDTLS_ERR_X509_INVALID_ALG +
  229. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  230. }
  231. else if( ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG )
  232. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  233. if( p == end )
  234. return( 0 );
  235. /*
  236. * salt_len
  237. */
  238. if( ( ret = mbedtls_asn1_get_tag( &p, end, &len,
  239. MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 2 ) ) == 0 )
  240. {
  241. end2 = p + len;
  242. if( ( ret = mbedtls_asn1_get_int( &p, end2, salt_len ) ) != 0 )
  243. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  244. if( p != end2 )
  245. return( MBEDTLS_ERR_X509_INVALID_ALG +
  246. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  247. }
  248. else if( ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG )
  249. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  250. if( p == end )
  251. return( 0 );
  252. /*
  253. * trailer_field (if present, must be 1)
  254. */
  255. if( ( ret = mbedtls_asn1_get_tag( &p, end, &len,
  256. MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | 3 ) ) == 0 )
  257. {
  258. int trailer_field;
  259. end2 = p + len;
  260. if( ( ret = mbedtls_asn1_get_int( &p, end2, &trailer_field ) ) != 0 )
  261. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  262. if( p != end2 )
  263. return( MBEDTLS_ERR_X509_INVALID_ALG +
  264. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  265. if( trailer_field != 1 )
  266. return( MBEDTLS_ERR_X509_INVALID_ALG );
  267. }
  268. else if( ret != MBEDTLS_ERR_ASN1_UNEXPECTED_TAG )
  269. return( MBEDTLS_ERR_X509_INVALID_ALG + ret );
  270. if( p != end )
  271. return( MBEDTLS_ERR_X509_INVALID_ALG +
  272. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  273. return( 0 );
  274. }
  275. #endif /* MBEDTLS_X509_RSASSA_PSS_SUPPORT */
  276. /*
  277. * AttributeTypeAndValue ::= SEQUENCE {
  278. * type AttributeType,
  279. * value AttributeValue }
  280. *
  281. * AttributeType ::= OBJECT IDENTIFIER
  282. *
  283. * AttributeValue ::= ANY DEFINED BY AttributeType
  284. */
  285. static int x509_get_attr_type_value( unsigned char **p,
  286. const unsigned char *end,
  287. mbedtls_x509_name *cur )
  288. {
  289. int ret;
  290. size_t len;
  291. mbedtls_x509_buf *oid;
  292. mbedtls_x509_buf *val;
  293. if( ( ret = mbedtls_asn1_get_tag( p, end, &len,
  294. MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE ) ) != 0 )
  295. return( MBEDTLS_ERR_X509_INVALID_NAME + ret );
  296. if( ( end - *p ) < 1 )
  297. return( MBEDTLS_ERR_X509_INVALID_NAME +
  298. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  299. oid = &cur->oid;
  300. oid->tag = **p;
  301. if( ( ret = mbedtls_asn1_get_tag( p, end, &oid->len, MBEDTLS_ASN1_OID ) ) != 0 )
  302. return( MBEDTLS_ERR_X509_INVALID_NAME + ret );
  303. oid->p = *p;
  304. *p += oid->len;
  305. if( ( end - *p ) < 1 )
  306. return( MBEDTLS_ERR_X509_INVALID_NAME +
  307. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  308. if( **p != MBEDTLS_ASN1_BMP_STRING && **p != MBEDTLS_ASN1_UTF8_STRING &&
  309. **p != MBEDTLS_ASN1_T61_STRING && **p != MBEDTLS_ASN1_PRINTABLE_STRING &&
  310. **p != MBEDTLS_ASN1_IA5_STRING && **p != MBEDTLS_ASN1_UNIVERSAL_STRING &&
  311. **p != MBEDTLS_ASN1_BIT_STRING )
  312. return( MBEDTLS_ERR_X509_INVALID_NAME +
  313. MBEDTLS_ERR_ASN1_UNEXPECTED_TAG );
  314. val = &cur->val;
  315. val->tag = *(*p)++;
  316. if( ( ret = mbedtls_asn1_get_len( p, end, &val->len ) ) != 0 )
  317. return( MBEDTLS_ERR_X509_INVALID_NAME + ret );
  318. val->p = *p;
  319. *p += val->len;
  320. cur->next = NULL;
  321. return( 0 );
  322. }
  323. /*
  324. * Name ::= CHOICE { -- only one possibility for now --
  325. * rdnSequence RDNSequence }
  326. *
  327. * RDNSequence ::= SEQUENCE OF RelativeDistinguishedName
  328. *
  329. * RelativeDistinguishedName ::=
  330. * SET OF AttributeTypeAndValue
  331. *
  332. * AttributeTypeAndValue ::= SEQUENCE {
  333. * type AttributeType,
  334. * value AttributeValue }
  335. *
  336. * AttributeType ::= OBJECT IDENTIFIER
  337. *
  338. * AttributeValue ::= ANY DEFINED BY AttributeType
  339. *
  340. * The data structure is optimized for the common case where each RDN has only
  341. * one element, which is represented as a list of AttributeTypeAndValue.
  342. * For the general case we still use a flat list, but we mark elements of the
  343. * same set so that they are "merged" together in the functions that consume
  344. * this list, eg mbedtls_x509_dn_gets().
  345. */
  346. int mbedtls_x509_get_name( unsigned char **p, const unsigned char *end,
  347. mbedtls_x509_name *cur )
  348. {
  349. int ret;
  350. size_t set_len;
  351. const unsigned char *end_set;
  352. /* don't use recursion, we'd risk stack overflow if not optimized */
  353. while( 1 )
  354. {
  355. /*
  356. * parse SET
  357. */
  358. if( ( ret = mbedtls_asn1_get_tag( p, end, &set_len,
  359. MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SET ) ) != 0 )
  360. return( MBEDTLS_ERR_X509_INVALID_NAME + ret );
  361. end_set = *p + set_len;
  362. while( 1 )
  363. {
  364. if( ( ret = x509_get_attr_type_value( p, end_set, cur ) ) != 0 )
  365. return( ret );
  366. if( *p == end_set )
  367. break;
  368. /* Mark this item as being no the only one in a set */
  369. cur->next_merged = 1;
  370. cur->next = mbedtls_calloc( 1, sizeof( mbedtls_x509_name ) );
  371. if( cur->next == NULL )
  372. return( MBEDTLS_ERR_X509_ALLOC_FAILED );
  373. cur = cur->next;
  374. }
  375. /*
  376. * continue until end of SEQUENCE is reached
  377. */
  378. if( *p == end )
  379. return( 0 );
  380. cur->next = mbedtls_calloc( 1, sizeof( mbedtls_x509_name ) );
  381. if( cur->next == NULL )
  382. return( MBEDTLS_ERR_X509_ALLOC_FAILED );
  383. cur = cur->next;
  384. }
  385. }
  386. static int x509_parse_int( unsigned char **p, size_t n, int *res )
  387. {
  388. *res = 0;
  389. for( ; n > 0; --n )
  390. {
  391. if( ( **p < '0') || ( **p > '9' ) )
  392. return ( MBEDTLS_ERR_X509_INVALID_DATE );
  393. *res *= 10;
  394. *res += ( *(*p)++ - '0' );
  395. }
  396. return( 0 );
  397. }
  398. static int x509_date_is_valid(const mbedtls_x509_time *t )
  399. {
  400. int ret = MBEDTLS_ERR_X509_INVALID_DATE;
  401. int month_len;
  402. CHECK_RANGE( 0, 9999, t->year );
  403. CHECK_RANGE( 0, 23, t->hour );
  404. CHECK_RANGE( 0, 59, t->min );
  405. CHECK_RANGE( 0, 59, t->sec );
  406. switch( t->mon )
  407. {
  408. case 1: case 3: case 5: case 7: case 8: case 10: case 12:
  409. month_len = 31;
  410. break;
  411. case 4: case 6: case 9: case 11:
  412. month_len = 30;
  413. break;
  414. case 2:
  415. if( ( !( t->year % 4 ) && t->year % 100 ) ||
  416. !( t->year % 400 ) )
  417. month_len = 29;
  418. else
  419. month_len = 28;
  420. break;
  421. default:
  422. return( ret );
  423. }
  424. CHECK_RANGE( 1, month_len, t->day );
  425. return( 0 );
  426. }
  427. /*
  428. * Parse an ASN1_UTC_TIME (yearlen=2) or ASN1_GENERALIZED_TIME (yearlen=4)
  429. * field.
  430. */
  431. static int x509_parse_time( unsigned char **p, size_t len, size_t yearlen,
  432. mbedtls_x509_time *tm )
  433. {
  434. int ret;
  435. /*
  436. * Minimum length is 10 or 12 depending on yearlen
  437. */
  438. if ( len < yearlen + 8 )
  439. return ( MBEDTLS_ERR_X509_INVALID_DATE );
  440. len -= yearlen + 8;
  441. /*
  442. * Parse year, month, day, hour, minute
  443. */
  444. CHECK( x509_parse_int( p, yearlen, &tm->year ) );
  445. if ( 2 == yearlen )
  446. {
  447. if ( tm->year < 50 )
  448. tm->year += 100;
  449. tm->year += 1900;
  450. }
  451. CHECK( x509_parse_int( p, 2, &tm->mon ) );
  452. CHECK( x509_parse_int( p, 2, &tm->day ) );
  453. CHECK( x509_parse_int( p, 2, &tm->hour ) );
  454. CHECK( x509_parse_int( p, 2, &tm->min ) );
  455. /*
  456. * Parse seconds if present
  457. */
  458. if ( len >= 2 )
  459. {
  460. CHECK( x509_parse_int( p, 2, &tm->sec ) );
  461. len -= 2;
  462. }
  463. else
  464. return ( MBEDTLS_ERR_X509_INVALID_DATE );
  465. /*
  466. * Parse trailing 'Z' if present
  467. */
  468. if ( 1 == len && 'Z' == **p )
  469. {
  470. (*p)++;
  471. len--;
  472. }
  473. /*
  474. * We should have parsed all characters at this point
  475. */
  476. if ( 0 != len )
  477. return ( MBEDTLS_ERR_X509_INVALID_DATE );
  478. CHECK( x509_date_is_valid( tm ) );
  479. return ( 0 );
  480. }
  481. /*
  482. * Time ::= CHOICE {
  483. * utcTime UTCTime,
  484. * generalTime GeneralizedTime }
  485. */
  486. int mbedtls_x509_get_time( unsigned char **p, const unsigned char *end,
  487. mbedtls_x509_time *tm )
  488. {
  489. int ret;
  490. size_t len, year_len;
  491. unsigned char tag;
  492. if( ( end - *p ) < 1 )
  493. return( MBEDTLS_ERR_X509_INVALID_DATE +
  494. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  495. tag = **p;
  496. if( tag == MBEDTLS_ASN1_UTC_TIME )
  497. year_len = 2;
  498. else if( tag == MBEDTLS_ASN1_GENERALIZED_TIME )
  499. year_len = 4;
  500. else
  501. return( MBEDTLS_ERR_X509_INVALID_DATE +
  502. MBEDTLS_ERR_ASN1_UNEXPECTED_TAG );
  503. (*p)++;
  504. ret = mbedtls_asn1_get_len( p, end, &len );
  505. if( ret != 0 )
  506. return( MBEDTLS_ERR_X509_INVALID_DATE + ret );
  507. return x509_parse_time( p, len, year_len, tm );
  508. }
  509. int mbedtls_x509_get_sig( unsigned char **p, const unsigned char *end, mbedtls_x509_buf *sig )
  510. {
  511. int ret;
  512. size_t len;
  513. int tag_type;
  514. if( ( end - *p ) < 1 )
  515. return( MBEDTLS_ERR_X509_INVALID_SIGNATURE +
  516. MBEDTLS_ERR_ASN1_OUT_OF_DATA );
  517. tag_type = **p;
  518. if( ( ret = mbedtls_asn1_get_bitstring_null( p, end, &len ) ) != 0 )
  519. return( MBEDTLS_ERR_X509_INVALID_SIGNATURE + ret );
  520. sig->tag = tag_type;
  521. sig->len = len;
  522. sig->p = *p;
  523. *p += len;
  524. return( 0 );
  525. }
  526. /*
  527. * Get signature algorithm from alg OID and optional parameters
  528. */
  529. int mbedtls_x509_get_sig_alg( const mbedtls_x509_buf *sig_oid, const mbedtls_x509_buf *sig_params,
  530. mbedtls_md_type_t *md_alg, mbedtls_pk_type_t *pk_alg,
  531. void **sig_opts )
  532. {
  533. int ret;
  534. if( *sig_opts != NULL )
  535. return( MBEDTLS_ERR_X509_BAD_INPUT_DATA );
  536. if( ( ret = mbedtls_oid_get_sig_alg( sig_oid, md_alg, pk_alg ) ) != 0 )
  537. return( MBEDTLS_ERR_X509_UNKNOWN_SIG_ALG + ret );
  538. #if defined(MBEDTLS_X509_RSASSA_PSS_SUPPORT)
  539. if( *pk_alg == MBEDTLS_PK_RSASSA_PSS )
  540. {
  541. mbedtls_pk_rsassa_pss_options *pss_opts;
  542. pss_opts = mbedtls_calloc( 1, sizeof( mbedtls_pk_rsassa_pss_options ) );
  543. if( pss_opts == NULL )
  544. return( MBEDTLS_ERR_X509_ALLOC_FAILED );
  545. ret = mbedtls_x509_get_rsassa_pss_params( sig_params,
  546. md_alg,
  547. &pss_opts->mgf1_hash_id,
  548. &pss_opts->expected_salt_len );
  549. if( ret != 0 )
  550. {
  551. mbedtls_free( pss_opts );
  552. return( ret );
  553. }
  554. *sig_opts = (void *) pss_opts;
  555. }
  556. else
  557. #endif /* MBEDTLS_X509_RSASSA_PSS_SUPPORT */
  558. {
  559. /* Make sure parameters are absent or NULL */
  560. if( ( sig_params->tag != MBEDTLS_ASN1_NULL && sig_params->tag != 0 ) ||
  561. sig_params->len != 0 )
  562. return( MBEDTLS_ERR_X509_INVALID_ALG );
  563. }
  564. return( 0 );
  565. }
  566. /*
  567. * X.509 Extensions (No parsing of extensions, pointer should
  568. * be either manually updated or extensions should be parsed!)
  569. */
  570. int mbedtls_x509_get_ext( unsigned char **p, const unsigned char *end,
  571. mbedtls_x509_buf *ext, int tag )
  572. {
  573. int ret;
  574. size_t len;
  575. if( *p == end )
  576. return( 0 );
  577. ext->tag = **p;
  578. if( ( ret = mbedtls_asn1_get_tag( p, end, &ext->len,
  579. MBEDTLS_ASN1_CONTEXT_SPECIFIC | MBEDTLS_ASN1_CONSTRUCTED | tag ) ) != 0 )
  580. return( ret );
  581. ext->p = *p;
  582. end = *p + ext->len;
  583. /*
  584. * Extensions ::= SEQUENCE SIZE (1..MAX) OF Extension
  585. *
  586. * Extension ::= SEQUENCE {
  587. * extnID OBJECT IDENTIFIER,
  588. * critical BOOLEAN DEFAULT FALSE,
  589. * extnValue OCTET STRING }
  590. */
  591. if( ( ret = mbedtls_asn1_get_tag( p, end, &len,
  592. MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE ) ) != 0 )
  593. return( MBEDTLS_ERR_X509_INVALID_EXTENSIONS + ret );
  594. if( end != *p + len )
  595. return( MBEDTLS_ERR_X509_INVALID_EXTENSIONS +
  596. MBEDTLS_ERR_ASN1_LENGTH_MISMATCH );
  597. return( 0 );
  598. }
  599. /*
  600. * Store the name in printable form into buf; no more
  601. * than size characters will be written
  602. */
  603. int mbedtls_x509_dn_gets( char *buf, size_t size, const mbedtls_x509_name *dn )
  604. {
  605. int ret;
  606. size_t i, n;
  607. unsigned char c, merge = 0;
  608. const mbedtls_x509_name *name;
  609. const char *short_name = NULL;
  610. char s[MBEDTLS_X509_MAX_DN_NAME_SIZE], *p;
  611. memset( s, 0, sizeof( s ) );
  612. name = dn;
  613. p = buf;
  614. n = size;
  615. while( name != NULL )
  616. {
  617. if( !name->oid.p )
  618. {
  619. name = name->next;
  620. continue;
  621. }
  622. if( name != dn )
  623. {
  624. ret = mbedtls_snprintf( p, n, merge ? " + " : ", " );
  625. MBEDTLS_X509_SAFE_SNPRINTF;
  626. }
  627. ret = mbedtls_oid_get_attr_short_name( &name->oid, &short_name );
  628. if( ret == 0 )
  629. ret = mbedtls_snprintf( p, n, "%s=", short_name );
  630. else
  631. ret = mbedtls_snprintf( p, n, "\?\?=" );
  632. MBEDTLS_X509_SAFE_SNPRINTF;
  633. for( i = 0; i < name->val.len; i++ )
  634. {
  635. if( i >= sizeof( s ) - 1 )
  636. break;
  637. c = name->val.p[i];
  638. if( c < 32 || c == 127 || ( c > 128 && c < 160 ) )
  639. s[i] = '?';
  640. else s[i] = c;
  641. }
  642. s[i] = '\0';
  643. ret = mbedtls_snprintf( p, n, "%s", s );
  644. MBEDTLS_X509_SAFE_SNPRINTF;
  645. merge = name->next_merged;
  646. name = name->next;
  647. }
  648. return( (int) ( size - n ) );
  649. }
  650. /*
  651. * Store the serial in printable form into buf; no more
  652. * than size characters will be written
  653. */
  654. int mbedtls_x509_serial_gets( char *buf, size_t size, const mbedtls_x509_buf *serial )
  655. {
  656. int ret;
  657. size_t i, n, nr;
  658. char *p;
  659. p = buf;
  660. n = size;
  661. nr = ( serial->len <= 32 )
  662. ? serial->len : 28;
  663. for( i = 0; i < nr; i++ )
  664. {
  665. if( i == 0 && nr > 1 && serial->p[i] == 0x0 )
  666. continue;
  667. ret = mbedtls_snprintf( p, n, "%02X%s",
  668. serial->p[i], ( i < nr - 1 ) ? ":" : "" );
  669. MBEDTLS_X509_SAFE_SNPRINTF;
  670. }
  671. if( nr != serial->len )
  672. {
  673. ret = mbedtls_snprintf( p, n, "...." );
  674. MBEDTLS_X509_SAFE_SNPRINTF;
  675. }
  676. return( (int) ( size - n ) );
  677. }
  678. /*
  679. * Helper for writing signature algorithms
  680. */
  681. int mbedtls_x509_sig_alg_gets( char *buf, size_t size, const mbedtls_x509_buf *sig_oid,
  682. mbedtls_pk_type_t pk_alg, mbedtls_md_type_t md_alg,
  683. const void *sig_opts )
  684. {
  685. int ret;
  686. char *p = buf;
  687. size_t n = size;
  688. const char *desc = NULL;
  689. ret = mbedtls_oid_get_sig_alg_desc( sig_oid, &desc );
  690. if( ret != 0 )
  691. ret = mbedtls_snprintf( p, n, "???" );
  692. else
  693. ret = mbedtls_snprintf( p, n, "%s", desc );
  694. MBEDTLS_X509_SAFE_SNPRINTF;
  695. #if defined(MBEDTLS_X509_RSASSA_PSS_SUPPORT)
  696. if( pk_alg == MBEDTLS_PK_RSASSA_PSS )
  697. {
  698. const mbedtls_pk_rsassa_pss_options *pss_opts;
  699. const mbedtls_md_info_t *md_info, *mgf_md_info;
  700. pss_opts = (const mbedtls_pk_rsassa_pss_options *) sig_opts;
  701. md_info = mbedtls_md_info_from_type( md_alg );
  702. mgf_md_info = mbedtls_md_info_from_type( pss_opts->mgf1_hash_id );
  703. ret = mbedtls_snprintf( p, n, " (%s, MGF1-%s, 0x%02X)",
  704. md_info ? mbedtls_md_get_name( md_info ) : "???",
  705. mgf_md_info ? mbedtls_md_get_name( mgf_md_info ) : "???",
  706. pss_opts->expected_salt_len );
  707. MBEDTLS_X509_SAFE_SNPRINTF;
  708. }
  709. #else
  710. ((void) pk_alg);
  711. ((void) md_alg);
  712. ((void) sig_opts);
  713. #endif /* MBEDTLS_X509_RSASSA_PSS_SUPPORT */
  714. return( (int)( size - n ) );
  715. }
  716. /*
  717. * Helper for writing "RSA key size", "EC key size", etc
  718. */
  719. int mbedtls_x509_key_size_helper( char *buf, size_t buf_size, const char *name )
  720. {
  721. char *p = buf;
  722. size_t n = buf_size;
  723. int ret;
  724. ret = mbedtls_snprintf( p, n, "%s key size", name );
  725. MBEDTLS_X509_SAFE_SNPRINTF;
  726. return( 0 );
  727. }
  728. #if defined(MBEDTLS_HAVE_TIME_DATE)
  729. /*
  730. * Set the time structure to the current time.
  731. * Return 0 on success, non-zero on failure.
  732. */
  733. static int x509_get_current_time( mbedtls_x509_time *now )
  734. {
  735. struct tm *lt, tm_buf;
  736. mbedtls_time_t tt;
  737. int ret = 0;
  738. tt = mbedtls_time( NULL );
  739. #if defined(_WIN32) && !defined(EFIX64) && !defined(EFI32)
  740. lt = gmtime_s( &tm_buf, &tt ) == 0 ? &tm_buf : NULL;
  741. #else
  742. lt = gmtime_r( &tt, &tm_buf );
  743. #endif
  744. if( lt == NULL )
  745. ret = -1;
  746. else
  747. {
  748. now->year = lt->tm_year + 1900;
  749. now->mon = lt->tm_mon + 1;
  750. now->day = lt->tm_mday;
  751. now->hour = lt->tm_hour;
  752. now->min = lt->tm_min;
  753. now->sec = lt->tm_sec;
  754. }
  755. return( ret );
  756. }
  757. /*
  758. * Return 0 if before <= after, 1 otherwise
  759. */
  760. static int x509_check_time( const mbedtls_x509_time *before, const mbedtls_x509_time *after )
  761. {
  762. if( before->year > after->year )
  763. return( 1 );
  764. if( before->year == after->year &&
  765. before->mon > after->mon )
  766. return( 1 );
  767. if( before->year == after->year &&
  768. before->mon == after->mon &&
  769. before->day > after->day )
  770. return( 1 );
  771. if( before->year == after->year &&
  772. before->mon == after->mon &&
  773. before->day == after->day &&
  774. before->hour > after->hour )
  775. return( 1 );
  776. if( before->year == after->year &&
  777. before->mon == after->mon &&
  778. before->day == after->day &&
  779. before->hour == after->hour &&
  780. before->min > after->min )
  781. return( 1 );
  782. if( before->year == after->year &&
  783. before->mon == after->mon &&
  784. before->day == after->day &&
  785. before->hour == after->hour &&
  786. before->min == after->min &&
  787. before->sec > after->sec )
  788. return( 1 );
  789. return( 0 );
  790. }
  791. int mbedtls_x509_time_is_past( const mbedtls_x509_time *to )
  792. {
  793. mbedtls_x509_time now;
  794. if( x509_get_current_time( &now ) != 0 )
  795. return( 1 );
  796. return( x509_check_time( &now, to ) );
  797. }
  798. int mbedtls_x509_time_is_future( const mbedtls_x509_time *from )
  799. {
  800. mbedtls_x509_time now;
  801. if( x509_get_current_time( &now ) != 0 )
  802. return( 1 );
  803. return( x509_check_time( from, &now ) );
  804. }
  805. #else /* MBEDTLS_HAVE_TIME_DATE */
  806. int mbedtls_x509_time_is_past( const mbedtls_x509_time *to )
  807. {
  808. ((void) to);
  809. return( 0 );
  810. }
  811. int mbedtls_x509_time_is_future( const mbedtls_x509_time *from )
  812. {
  813. ((void) from);
  814. return( 0 );
  815. }
  816. #endif /* MBEDTLS_HAVE_TIME_DATE */
  817. #if defined(MBEDTLS_SELF_TEST)
  818. #include "mbedtls/x509_crt.h"
  819. #include "mbedtls/certs.h"
  820. /*
  821. * Checkup routine
  822. */
  823. int mbedtls_x509_self_test( int verbose )
  824. {
  825. #if defined(MBEDTLS_CERTS_C) && defined(MBEDTLS_SHA256_C)
  826. int ret;
  827. uint32_t flags;
  828. mbedtls_x509_crt cacert;
  829. mbedtls_x509_crt clicert;
  830. if( verbose != 0 )
  831. mbedtls_printf( " X.509 certificate load: " );
  832. mbedtls_x509_crt_init( &clicert );
  833. ret = mbedtls_x509_crt_parse( &clicert, (const unsigned char *) mbedtls_test_cli_crt,
  834. mbedtls_test_cli_crt_len );
  835. if( ret != 0 )
  836. {
  837. if( verbose != 0 )
  838. mbedtls_printf( "failed\n" );
  839. return( ret );
  840. }
  841. mbedtls_x509_crt_init( &cacert );
  842. ret = mbedtls_x509_crt_parse( &cacert, (const unsigned char *) mbedtls_test_ca_crt,
  843. mbedtls_test_ca_crt_len );
  844. if( ret != 0 )
  845. {
  846. if( verbose != 0 )
  847. mbedtls_printf( "failed\n" );
  848. return( ret );
  849. }
  850. if( verbose != 0 )
  851. mbedtls_printf( "passed\n X.509 signature verify: ");
  852. ret = mbedtls_x509_crt_verify( &clicert, &cacert, NULL, NULL, &flags, NULL, NULL );
  853. if( ret != 0 )
  854. {
  855. if( verbose != 0 )
  856. mbedtls_printf( "failed\n" );
  857. return( ret );
  858. }
  859. if( verbose != 0 )
  860. mbedtls_printf( "passed\n\n");
  861. mbedtls_x509_crt_free( &cacert );
  862. mbedtls_x509_crt_free( &clicert );
  863. return( 0 );
  864. #else
  865. ((void) verbose);
  866. return( 0 );
  867. #endif /* MBEDTLS_CERTS_C && MBEDTLS_SHA1_C */
  868. }
  869. #endif /* MBEDTLS_SELF_TEST */
  870. #endif /* MBEDTLS_X509_USE_C */