base64.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272
  1. /*
  2. * RFC 1521 base64 encoding/decoding
  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_BASE64_C)
  21. #include "mbedtls/base64.h"
  22. #include "constant_time_internal.h"
  23. #include <stdint.h>
  24. #if defined(MBEDTLS_SELF_TEST)
  25. #include <string.h>
  26. #include "mbedtls/platform.h"
  27. #endif /* MBEDTLS_SELF_TEST */
  28. #define BASE64_SIZE_T_MAX ( (size_t) -1 ) /* SIZE_T_MAX is not standard */
  29. /*
  30. * Encode a buffer into base64 format
  31. */
  32. int mbedtls_base64_encode( unsigned char *dst, size_t dlen, size_t *olen,
  33. const unsigned char *src, size_t slen )
  34. {
  35. size_t i, n;
  36. int C1, C2, C3;
  37. unsigned char *p;
  38. if( slen == 0 )
  39. {
  40. *olen = 0;
  41. return( 0 );
  42. }
  43. n = slen / 3 + ( slen % 3 != 0 );
  44. if( n > ( BASE64_SIZE_T_MAX - 1 ) / 4 )
  45. {
  46. *olen = BASE64_SIZE_T_MAX;
  47. return( MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL );
  48. }
  49. n *= 4;
  50. if( ( dlen < n + 1 ) || ( NULL == dst ) )
  51. {
  52. *olen = n + 1;
  53. return( MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL );
  54. }
  55. n = ( slen / 3 ) * 3;
  56. for( i = 0, p = dst; i < n; i += 3 )
  57. {
  58. C1 = *src++;
  59. C2 = *src++;
  60. C3 = *src++;
  61. *p++ = mbedtls_ct_base64_enc_char( ( C1 >> 2 ) & 0x3F );
  62. *p++ = mbedtls_ct_base64_enc_char( ( ( ( C1 & 3 ) << 4 ) + ( C2 >> 4 ) )
  63. & 0x3F );
  64. *p++ = mbedtls_ct_base64_enc_char( ( ( ( C2 & 15 ) << 2 ) + ( C3 >> 6 ) )
  65. & 0x3F );
  66. *p++ = mbedtls_ct_base64_enc_char( C3 & 0x3F );
  67. }
  68. if( i < slen )
  69. {
  70. C1 = *src++;
  71. C2 = ( ( i + 1 ) < slen ) ? *src++ : 0;
  72. *p++ = mbedtls_ct_base64_enc_char( ( C1 >> 2 ) & 0x3F );
  73. *p++ = mbedtls_ct_base64_enc_char( ( ( ( C1 & 3 ) << 4 ) + ( C2 >> 4 ) )
  74. & 0x3F );
  75. if( ( i + 1 ) < slen )
  76. *p++ = mbedtls_ct_base64_enc_char( ( ( C2 & 15 ) << 2 ) & 0x3F );
  77. else *p++ = '=';
  78. *p++ = '=';
  79. }
  80. *olen = p - dst;
  81. *p = 0;
  82. return( 0 );
  83. }
  84. /*
  85. * Decode a base64-formatted buffer
  86. */
  87. int mbedtls_base64_decode( unsigned char *dst, size_t dlen, size_t *olen,
  88. const unsigned char *src, size_t slen )
  89. {
  90. size_t i; /* index in source */
  91. size_t n; /* number of digits or trailing = in source */
  92. uint32_t x; /* value accumulator */
  93. unsigned accumulated_digits = 0;
  94. unsigned equals = 0;
  95. int spaces_present = 0;
  96. unsigned char *p;
  97. /* First pass: check for validity and get output length */
  98. for( i = n = 0; i < slen; i++ )
  99. {
  100. /* Skip spaces before checking for EOL */
  101. spaces_present = 0;
  102. while( i < slen && src[i] == ' ' )
  103. {
  104. ++i;
  105. spaces_present = 1;
  106. }
  107. /* Spaces at end of buffer are OK */
  108. if( i == slen )
  109. break;
  110. if( ( slen - i ) >= 2 &&
  111. src[i] == '\r' && src[i + 1] == '\n' )
  112. continue;
  113. if( src[i] == '\n' )
  114. continue;
  115. /* Space inside a line is an error */
  116. if( spaces_present )
  117. return( MBEDTLS_ERR_BASE64_INVALID_CHARACTER );
  118. if( src[i] > 127 )
  119. return( MBEDTLS_ERR_BASE64_INVALID_CHARACTER );
  120. if( src[i] == '=' )
  121. {
  122. if( ++equals > 2 )
  123. return( MBEDTLS_ERR_BASE64_INVALID_CHARACTER );
  124. }
  125. else
  126. {
  127. if( equals != 0 )
  128. return( MBEDTLS_ERR_BASE64_INVALID_CHARACTER );
  129. if( mbedtls_ct_base64_dec_value( src[i] ) < 0 )
  130. return( MBEDTLS_ERR_BASE64_INVALID_CHARACTER );
  131. }
  132. n++;
  133. }
  134. if( n == 0 )
  135. {
  136. *olen = 0;
  137. return( 0 );
  138. }
  139. /* The following expression is to calculate the following formula without
  140. * risk of integer overflow in n:
  141. * n = ( ( n * 6 ) + 7 ) >> 3;
  142. */
  143. n = ( 6 * ( n >> 3 ) ) + ( ( 6 * ( n & 0x7 ) + 7 ) >> 3 );
  144. n -= equals;
  145. if( dst == NULL || dlen < n )
  146. {
  147. *olen = n;
  148. return( MBEDTLS_ERR_BASE64_BUFFER_TOO_SMALL );
  149. }
  150. equals = 0;
  151. for( x = 0, p = dst; i > 0; i--, src++ )
  152. {
  153. if( *src == '\r' || *src == '\n' || *src == ' ' )
  154. continue;
  155. x = x << 6;
  156. if( *src == '=' )
  157. ++equals;
  158. else
  159. x |= mbedtls_ct_base64_dec_value( *src );
  160. if( ++accumulated_digits == 4 )
  161. {
  162. accumulated_digits = 0;
  163. *p++ = MBEDTLS_BYTE_2( x );
  164. if( equals <= 1 ) *p++ = MBEDTLS_BYTE_1( x );
  165. if( equals <= 0 ) *p++ = MBEDTLS_BYTE_0( x );
  166. }
  167. }
  168. *olen = p - dst;
  169. return( 0 );
  170. }
  171. #if defined(MBEDTLS_SELF_TEST)
  172. static const unsigned char base64_test_dec[64] =
  173. {
  174. 0x24, 0x48, 0x6E, 0x56, 0x87, 0x62, 0x5A, 0xBD,
  175. 0xBF, 0x17, 0xD9, 0xA2, 0xC4, 0x17, 0x1A, 0x01,
  176. 0x94, 0xED, 0x8F, 0x1E, 0x11, 0xB3, 0xD7, 0x09,
  177. 0x0C, 0xB6, 0xE9, 0x10, 0x6F, 0x22, 0xEE, 0x13,
  178. 0xCA, 0xB3, 0x07, 0x05, 0x76, 0xC9, 0xFA, 0x31,
  179. 0x6C, 0x08, 0x34, 0xFF, 0x8D, 0xC2, 0x6C, 0x38,
  180. 0x00, 0x43, 0xE9, 0x54, 0x97, 0xAF, 0x50, 0x4B,
  181. 0xD1, 0x41, 0xBA, 0x95, 0x31, 0x5A, 0x0B, 0x97
  182. };
  183. static const unsigned char base64_test_enc[] =
  184. "JEhuVodiWr2/F9mixBcaAZTtjx4Rs9cJDLbpEG8i7hPK"
  185. "swcFdsn6MWwINP+Nwmw4AEPpVJevUEvRQbqVMVoLlw==";
  186. /*
  187. * Checkup routine
  188. */
  189. int mbedtls_base64_self_test( int verbose )
  190. {
  191. size_t len;
  192. const unsigned char *src;
  193. unsigned char buffer[128];
  194. if( verbose != 0 )
  195. mbedtls_printf( " Base64 encoding test: " );
  196. src = base64_test_dec;
  197. if( mbedtls_base64_encode( buffer, sizeof( buffer ), &len, src, 64 ) != 0 ||
  198. memcmp( base64_test_enc, buffer, 88 ) != 0 )
  199. {
  200. if( verbose != 0 )
  201. mbedtls_printf( "failed\n" );
  202. return( 1 );
  203. }
  204. if( verbose != 0 )
  205. mbedtls_printf( "passed\n Base64 decoding test: " );
  206. src = base64_test_enc;
  207. if( mbedtls_base64_decode( buffer, sizeof( buffer ), &len, src, 88 ) != 0 ||
  208. memcmp( base64_test_dec, buffer, 64 ) != 0 )
  209. {
  210. if( verbose != 0 )
  211. mbedtls_printf( "failed\n" );
  212. return( 1 );
  213. }
  214. if( verbose != 0 )
  215. mbedtls_printf( "passed\n\n" );
  216. return( 0 );
  217. }
  218. #endif /* MBEDTLS_SELF_TEST */
  219. #endif /* MBEDTLS_BASE64_C */