asn1write.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485
  1. /*
  2. * ASN.1 buffer writing functionality
  3. *
  4. * Copyright The Mbed TLS Contributors
  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. #include "common.h"
  20. #if defined(MBEDTLS_ASN1_WRITE_C)
  21. #include "mbedtls/asn1write.h"
  22. #include "mbedtls/error.h"
  23. #include <string.h>
  24. #if defined(MBEDTLS_PLATFORM_C)
  25. #include "mbedtls/platform.h"
  26. #else
  27. #include <stdlib.h>
  28. #define mbedtls_calloc calloc
  29. #define mbedtls_free free
  30. #endif
  31. int mbedtls_asn1_write_len( unsigned char **p, unsigned char *start, size_t len )
  32. {
  33. if( len < 0x80 )
  34. {
  35. if( *p - start < 1 )
  36. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  37. *--(*p) = (unsigned char) len;
  38. return( 1 );
  39. }
  40. if( len <= 0xFF )
  41. {
  42. if( *p - start < 2 )
  43. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  44. *--(*p) = (unsigned char) len;
  45. *--(*p) = 0x81;
  46. return( 2 );
  47. }
  48. if( len <= 0xFFFF )
  49. {
  50. if( *p - start < 3 )
  51. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  52. *--(*p) = MBEDTLS_BYTE_0( len );
  53. *--(*p) = MBEDTLS_BYTE_1( len );
  54. *--(*p) = 0x82;
  55. return( 3 );
  56. }
  57. if( len <= 0xFFFFFF )
  58. {
  59. if( *p - start < 4 )
  60. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  61. *--(*p) = MBEDTLS_BYTE_0( len );
  62. *--(*p) = MBEDTLS_BYTE_1( len );
  63. *--(*p) = MBEDTLS_BYTE_2( len );
  64. *--(*p) = 0x83;
  65. return( 4 );
  66. }
  67. #if SIZE_MAX > 0xFFFFFFFF
  68. if( len <= 0xFFFFFFFF )
  69. #endif
  70. {
  71. if( *p - start < 5 )
  72. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  73. *--(*p) = MBEDTLS_BYTE_0( len );
  74. *--(*p) = MBEDTLS_BYTE_1( len );
  75. *--(*p) = MBEDTLS_BYTE_2( len );
  76. *--(*p) = MBEDTLS_BYTE_3( len );
  77. *--(*p) = 0x84;
  78. return( 5 );
  79. }
  80. #if SIZE_MAX > 0xFFFFFFFF
  81. return( MBEDTLS_ERR_ASN1_INVALID_LENGTH );
  82. #endif
  83. }
  84. int mbedtls_asn1_write_tag( unsigned char **p, unsigned char *start, unsigned char tag )
  85. {
  86. if( *p - start < 1 )
  87. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  88. *--(*p) = tag;
  89. return( 1 );
  90. }
  91. int mbedtls_asn1_write_raw_buffer( unsigned char **p, unsigned char *start,
  92. const unsigned char *buf, size_t size )
  93. {
  94. size_t len = 0;
  95. if( *p < start || (size_t)( *p - start ) < size )
  96. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  97. len = size;
  98. (*p) -= len;
  99. memcpy( *p, buf, len );
  100. return( (int) len );
  101. }
  102. #if defined(MBEDTLS_BIGNUM_C)
  103. int mbedtls_asn1_write_mpi( unsigned char **p, unsigned char *start, const mbedtls_mpi *X )
  104. {
  105. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  106. size_t len = 0;
  107. // Write the MPI
  108. //
  109. len = mbedtls_mpi_size( X );
  110. /* DER represents 0 with a sign bit (0=nonnegative) and 7 value bits, not
  111. * as 0 digits. We need to end up with 020100, not with 0200. */
  112. if( len == 0 )
  113. len = 1;
  114. if( *p < start || (size_t)( *p - start ) < len )
  115. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  116. (*p) -= len;
  117. MBEDTLS_MPI_CHK( mbedtls_mpi_write_binary( X, *p, len ) );
  118. // DER format assumes 2s complement for numbers, so the leftmost bit
  119. // should be 0 for positive numbers and 1 for negative numbers.
  120. //
  121. if( X->s ==1 && **p & 0x80 )
  122. {
  123. if( *p - start < 1 )
  124. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  125. *--(*p) = 0x00;
  126. len += 1;
  127. }
  128. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  129. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_INTEGER ) );
  130. ret = (int) len;
  131. cleanup:
  132. return( ret );
  133. }
  134. #endif /* MBEDTLS_BIGNUM_C */
  135. int mbedtls_asn1_write_null( unsigned char **p, unsigned char *start )
  136. {
  137. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  138. size_t len = 0;
  139. // Write NULL
  140. //
  141. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, 0) );
  142. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_NULL ) );
  143. return( (int) len );
  144. }
  145. int mbedtls_asn1_write_oid( unsigned char **p, unsigned char *start,
  146. const char *oid, size_t oid_len )
  147. {
  148. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  149. size_t len = 0;
  150. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_raw_buffer( p, start,
  151. (const unsigned char *) oid, oid_len ) );
  152. MBEDTLS_ASN1_CHK_ADD( len , mbedtls_asn1_write_len( p, start, len ) );
  153. MBEDTLS_ASN1_CHK_ADD( len , mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_OID ) );
  154. return( (int) len );
  155. }
  156. int mbedtls_asn1_write_algorithm_identifier( unsigned char **p, unsigned char *start,
  157. const char *oid, size_t oid_len,
  158. size_t par_len )
  159. {
  160. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  161. size_t len = 0;
  162. if( par_len == 0 )
  163. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_null( p, start ) );
  164. else
  165. len += par_len;
  166. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_oid( p, start, oid, oid_len ) );
  167. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  168. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start,
  169. MBEDTLS_ASN1_CONSTRUCTED | MBEDTLS_ASN1_SEQUENCE ) );
  170. return( (int) len );
  171. }
  172. int mbedtls_asn1_write_bool( unsigned char **p, unsigned char *start, int boolean )
  173. {
  174. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  175. size_t len = 0;
  176. if( *p - start < 1 )
  177. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  178. *--(*p) = (boolean) ? 255 : 0;
  179. len++;
  180. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  181. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_BOOLEAN ) );
  182. return( (int) len );
  183. }
  184. static int asn1_write_tagged_int( unsigned char **p, unsigned char *start, int val, int tag )
  185. {
  186. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  187. size_t len = 0;
  188. do
  189. {
  190. if( *p - start < 1 )
  191. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  192. len += 1;
  193. *--(*p) = val & 0xff;
  194. val >>= 8;
  195. }
  196. while( val > 0 );
  197. if( **p & 0x80 )
  198. {
  199. if( *p - start < 1 )
  200. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  201. *--(*p) = 0x00;
  202. len += 1;
  203. }
  204. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  205. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, tag ) );
  206. return( (int) len );
  207. }
  208. int mbedtls_asn1_write_int( unsigned char **p, unsigned char *start, int val )
  209. {
  210. return( asn1_write_tagged_int( p, start, val, MBEDTLS_ASN1_INTEGER ) );
  211. }
  212. int mbedtls_asn1_write_enum( unsigned char **p, unsigned char *start, int val )
  213. {
  214. return( asn1_write_tagged_int( p, start, val, MBEDTLS_ASN1_ENUMERATED ) );
  215. }
  216. int mbedtls_asn1_write_tagged_string( unsigned char **p, unsigned char *start, int tag,
  217. const char *text, size_t text_len )
  218. {
  219. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  220. size_t len = 0;
  221. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_raw_buffer( p, start,
  222. (const unsigned char *) text, text_len ) );
  223. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  224. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, tag ) );
  225. return( (int) len );
  226. }
  227. int mbedtls_asn1_write_utf8_string( unsigned char **p, unsigned char *start,
  228. const char *text, size_t text_len )
  229. {
  230. return( mbedtls_asn1_write_tagged_string(p, start, MBEDTLS_ASN1_UTF8_STRING, text, text_len) );
  231. }
  232. int mbedtls_asn1_write_printable_string( unsigned char **p, unsigned char *start,
  233. const char *text, size_t text_len )
  234. {
  235. return( mbedtls_asn1_write_tagged_string(p, start, MBEDTLS_ASN1_PRINTABLE_STRING, text, text_len) );
  236. }
  237. int mbedtls_asn1_write_ia5_string( unsigned char **p, unsigned char *start,
  238. const char *text, size_t text_len )
  239. {
  240. return( mbedtls_asn1_write_tagged_string(p, start, MBEDTLS_ASN1_IA5_STRING, text, text_len) );
  241. }
  242. int mbedtls_asn1_write_named_bitstring( unsigned char **p,
  243. unsigned char *start,
  244. const unsigned char *buf,
  245. size_t bits )
  246. {
  247. size_t unused_bits, byte_len;
  248. const unsigned char *cur_byte;
  249. unsigned char cur_byte_shifted;
  250. unsigned char bit;
  251. byte_len = ( bits + 7 ) / 8;
  252. unused_bits = ( byte_len * 8 ) - bits;
  253. /*
  254. * Named bitstrings require that trailing 0s are excluded in the encoding
  255. * of the bitstring. Trailing 0s are considered part of the 'unused' bits
  256. * when encoding this value in the first content octet
  257. */
  258. if( bits != 0 )
  259. {
  260. cur_byte = buf + byte_len - 1;
  261. cur_byte_shifted = *cur_byte >> unused_bits;
  262. for( ; ; )
  263. {
  264. bit = cur_byte_shifted & 0x1;
  265. cur_byte_shifted >>= 1;
  266. if( bit != 0 )
  267. break;
  268. bits--;
  269. if( bits == 0 )
  270. break;
  271. if( bits % 8 == 0 )
  272. cur_byte_shifted = *--cur_byte;
  273. }
  274. }
  275. return( mbedtls_asn1_write_bitstring( p, start, buf, bits ) );
  276. }
  277. int mbedtls_asn1_write_bitstring( unsigned char **p, unsigned char *start,
  278. const unsigned char *buf, size_t bits )
  279. {
  280. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  281. size_t len = 0;
  282. size_t unused_bits, byte_len;
  283. byte_len = ( bits + 7 ) / 8;
  284. unused_bits = ( byte_len * 8 ) - bits;
  285. if( *p < start || (size_t)( *p - start ) < byte_len + 1 )
  286. return( MBEDTLS_ERR_ASN1_BUF_TOO_SMALL );
  287. len = byte_len + 1;
  288. /* Write the bitstring. Ensure the unused bits are zeroed */
  289. if( byte_len > 0 )
  290. {
  291. byte_len--;
  292. *--( *p ) = buf[byte_len] & ~( ( 0x1 << unused_bits ) - 1 );
  293. ( *p ) -= byte_len;
  294. memcpy( *p, buf, byte_len );
  295. }
  296. /* Write unused bits */
  297. *--( *p ) = (unsigned char)unused_bits;
  298. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  299. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_BIT_STRING ) );
  300. return( (int) len );
  301. }
  302. int mbedtls_asn1_write_octet_string( unsigned char **p, unsigned char *start,
  303. const unsigned char *buf, size_t size )
  304. {
  305. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  306. size_t len = 0;
  307. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_raw_buffer( p, start, buf, size ) );
  308. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_len( p, start, len ) );
  309. MBEDTLS_ASN1_CHK_ADD( len, mbedtls_asn1_write_tag( p, start, MBEDTLS_ASN1_OCTET_STRING ) );
  310. return( (int) len );
  311. }
  312. /* This is a copy of the ASN.1 parsing function mbedtls_asn1_find_named_data(),
  313. * which is replicated to avoid a dependency ASN1_WRITE_C on ASN1_PARSE_C. */
  314. static mbedtls_asn1_named_data *asn1_find_named_data(
  315. mbedtls_asn1_named_data *list,
  316. const char *oid, size_t len )
  317. {
  318. while( list != NULL )
  319. {
  320. if( list->oid.len == len &&
  321. memcmp( list->oid.p, oid, len ) == 0 )
  322. {
  323. break;
  324. }
  325. list = list->next;
  326. }
  327. return( list );
  328. }
  329. mbedtls_asn1_named_data *mbedtls_asn1_store_named_data(
  330. mbedtls_asn1_named_data **head,
  331. const char *oid, size_t oid_len,
  332. const unsigned char *val,
  333. size_t val_len )
  334. {
  335. mbedtls_asn1_named_data *cur;
  336. if( ( cur = asn1_find_named_data( *head, oid, oid_len ) ) == NULL )
  337. {
  338. // Add new entry if not present yet based on OID
  339. //
  340. cur = (mbedtls_asn1_named_data*)mbedtls_calloc( 1,
  341. sizeof(mbedtls_asn1_named_data) );
  342. if( cur == NULL )
  343. return( NULL );
  344. cur->oid.len = oid_len;
  345. cur->oid.p = mbedtls_calloc( 1, oid_len );
  346. if( cur->oid.p == NULL )
  347. {
  348. mbedtls_free( cur );
  349. return( NULL );
  350. }
  351. memcpy( cur->oid.p, oid, oid_len );
  352. cur->val.len = val_len;
  353. if( val_len != 0 )
  354. {
  355. cur->val.p = mbedtls_calloc( 1, val_len );
  356. if( cur->val.p == NULL )
  357. {
  358. mbedtls_free( cur->oid.p );
  359. mbedtls_free( cur );
  360. return( NULL );
  361. }
  362. }
  363. cur->next = *head;
  364. *head = cur;
  365. }
  366. else if( val_len == 0 )
  367. {
  368. mbedtls_free( cur->val.p );
  369. cur->val.p = NULL;
  370. }
  371. else if( cur->val.len != val_len )
  372. {
  373. /*
  374. * Enlarge existing value buffer if needed
  375. * Preserve old data until the allocation succeeded, to leave list in
  376. * a consistent state in case allocation fails.
  377. */
  378. void *p = mbedtls_calloc( 1, val_len );
  379. if( p == NULL )
  380. return( NULL );
  381. mbedtls_free( cur->val.p );
  382. cur->val.p = p;
  383. cur->val.len = val_len;
  384. }
  385. if( val != NULL && val_len != 0 )
  386. memcpy( cur->val.p, val, val_len );
  387. return( cur );
  388. }
  389. #endif /* MBEDTLS_ASN1_WRITE_C */