x509.c 28 KB

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