Coverage Report

Created: 2025-03-09 06:52

/src/libressl/crypto/evp/evp_encode.c
Line
Count
Source (jump to first uncovered line)
1
/* $OpenBSD: evp_encode.c,v 1.3 2024/04/09 13:52:41 beck Exp $ */
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
59
#include <limits.h>
60
#include <stdio.h>
61
#include <string.h>
62
63
#include <openssl/evp.h>
64
65
#include "evp_local.h"
66
67
static unsigned char conv_ascii2bin(unsigned char a);
68
0
#define conv_bin2ascii(a) (data_bin2ascii[(a)&0x3f])
69
70
/* 64 char lines
71
 * pad input with 0
72
 * left over chars are set to =
73
 * 1 byte  => xx==
74
 * 2 bytes => xxx=
75
 * 3 bytes => xxxx
76
 */
77
#define BIN_PER_LINE    (64/4*3)
78
#define CHUNKS_PER_LINE (64/4)
79
#define CHAR_PER_LINE   (64+1)
80
81
static const unsigned char data_bin2ascii[65] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ\
82
abcdefghijklmnopqrstuvwxyz0123456789+/";
83
84
/* 0xF0 is a EOLN
85
 * 0xF1 is ignore but next needs to be 0xF0 (for \r\n processing).
86
 * 0xF2 is EOF
87
 * 0xE0 is ignore at start of line.
88
 * 0xFF is error
89
 */
90
91
#define B64_EOLN    0xF0
92
#define B64_CR      0xF1
93
2.48M
#define B64_EOF     0xF2
94
42.0k
#define B64_WS      0xE0
95
2.48M
#define B64_ERROR   0xFF
96
2.53M
#define B64_NOT_BASE64(a) (((a)|0x13) == 0xF3)
97
2.49M
#define B64_BASE64(a)   !B64_NOT_BASE64(a)
98
99
static const unsigned char data_ascii2bin[128] = {
100
  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
101
  0xFF, 0xE0, 0xF0, 0xFF, 0xFF, 0xF1, 0xFF, 0xFF,
102
  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
103
  0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
104
  0xE0, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
105
  0xFF, 0xFF, 0xFF, 0x3E, 0xFF, 0xF2, 0xFF, 0x3F,
106
  0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B,
107
  0x3C, 0x3D, 0xFF, 0xFF, 0xFF, 0x00, 0xFF, 0xFF,
108
  0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
109
  0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,
110
  0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,
111
  0x17, 0x18, 0x19, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
112
  0xFF, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20,
113
  0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
114
  0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30,
115
  0x31, 0x32, 0x33, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
116
};
117
118
static unsigned char
119
conv_ascii2bin(unsigned char a)
120
5.01M
{
121
5.01M
  if (a & 0x80)
122
0
    return B64_ERROR;
123
5.01M
  return data_ascii2bin[a];
124
5.01M
}
125
126
EVP_ENCODE_CTX *
127
EVP_ENCODE_CTX_new(void)
128
0
{
129
0
  return calloc(1, sizeof(EVP_ENCODE_CTX));
130
0
}
131
LCRYPTO_ALIAS(EVP_ENCODE_CTX_new);
132
133
void
134
EVP_ENCODE_CTX_free(EVP_ENCODE_CTX *ctx)
135
0
{
136
0
  free(ctx);
137
0
}
138
LCRYPTO_ALIAS(EVP_ENCODE_CTX_free);
139
140
void
141
EVP_EncodeInit(EVP_ENCODE_CTX *ctx)
142
0
{
143
0
  ctx->length = 48;
144
0
  ctx->num = 0;
145
0
  ctx->line_num = 0;
146
0
}
147
LCRYPTO_ALIAS(EVP_EncodeInit);
148
149
int
150
EVP_EncodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
151
    const unsigned char *in, int inl)
152
0
{
153
0
  int i, j;
154
0
  size_t total = 0;
155
156
0
  *outl = 0;
157
0
  if (inl <= 0)
158
0
    return 0;
159
0
  OPENSSL_assert(ctx->length <= (int)sizeof(ctx->enc_data));
160
0
  if (ctx->length - ctx->num > inl) {
161
0
    memcpy(&(ctx->enc_data[ctx->num]), in, inl);
162
0
    ctx->num += inl;
163
0
    return 1;
164
0
  }
165
0
  if (ctx->num != 0) {
166
0
    i = ctx->length - ctx->num;
167
0
    memcpy(&(ctx->enc_data[ctx->num]), in, i);
168
0
    in += i;
169
0
    inl -= i;
170
0
    j = EVP_EncodeBlock(out, ctx->enc_data, ctx->length);
171
0
    ctx->num = 0;
172
0
    out += j;
173
0
    *(out++) = '\n';
174
0
    *out = '\0';
175
0
    total = j + 1;
176
0
  }
177
0
  while (inl >= ctx->length && total <= INT_MAX) {
178
0
    j = EVP_EncodeBlock(out, in, ctx->length);
179
0
    in += ctx->length;
180
0
    inl -= ctx->length;
181
0
    out += j;
182
0
    *(out++) = '\n';
183
0
    *out = '\0';
184
0
    total += j + 1;
185
0
  }
186
0
  if (total > INT_MAX) {
187
    /* Too much output data! */
188
0
    *outl = 0;
189
0
    return 0;
190
0
  }
191
0
  if (inl != 0)
192
0
    memcpy(&(ctx->enc_data[0]), in, inl);
193
0
  ctx->num = inl;
194
0
  *outl = total;
195
196
0
  return 1;
197
0
}
198
LCRYPTO_ALIAS(EVP_EncodeUpdate);
199
200
void
201
EVP_EncodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
202
0
{
203
0
  unsigned int ret = 0;
204
205
0
  if (ctx->num != 0) {
206
0
    ret = EVP_EncodeBlock(out, ctx->enc_data, ctx->num);
207
0
    out[ret++] = '\n';
208
0
    out[ret] = '\0';
209
0
    ctx->num = 0;
210
0
  }
211
0
  *outl = ret;
212
0
}
213
LCRYPTO_ALIAS(EVP_EncodeFinal);
214
215
int
216
EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int dlen)
217
0
{
218
0
  int i, ret = 0;
219
0
  unsigned long l;
220
221
0
  for (i = dlen; i > 0; i -= 3) {
222
0
    if (i >= 3) {
223
0
      l = (((unsigned long)f[0]) << 16L) |
224
0
          (((unsigned long)f[1]) << 8L) | f[2];
225
0
      *(t++) = conv_bin2ascii(l >> 18L);
226
0
      *(t++) = conv_bin2ascii(l >> 12L);
227
0
      *(t++) = conv_bin2ascii(l >> 6L);
228
0
      *(t++) = conv_bin2ascii(l     );
229
0
    } else {
230
0
      l = ((unsigned long)f[0]) << 16L;
231
0
      if (i == 2)
232
0
        l |= ((unsigned long)f[1] << 8L);
233
234
0
      *(t++) = conv_bin2ascii(l >> 18L);
235
0
      *(t++) = conv_bin2ascii(l >> 12L);
236
0
      *(t++) = (i == 1) ? '=' : conv_bin2ascii(l >> 6L);
237
0
      *(t++) = '=';
238
0
    }
239
0
    ret += 4;
240
0
    f += 3;
241
0
  }
242
243
0
  *t = '\0';
244
0
  return (ret);
245
0
}
246
LCRYPTO_ALIAS(EVP_EncodeBlock);
247
248
void
249
EVP_DecodeInit(EVP_ENCODE_CTX *ctx)
250
7.64k
{
251
7.64k
  ctx->num = 0;
252
7.64k
  ctx->length = 0;
253
7.64k
  ctx->line_num = 0;
254
7.64k
  ctx->expect_nl = 0;
255
7.64k
}
256
LCRYPTO_ALIAS(EVP_DecodeInit);
257
258
int
259
EVP_DecodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
260
    const unsigned char *in, int inl)
261
7.64k
{
262
7.64k
  int seof = 0, eof = 0, rv = -1, ret = 0, i, v, tmp, n, decoded_len;
263
7.64k
  unsigned char *d;
264
265
7.64k
  n = ctx->num;
266
7.64k
  d = ctx->enc_data;
267
268
7.64k
  if (n > 0 && d[n - 1] == '=') {
269
0
    eof++;
270
0
    if (n > 1 && d[n - 2] == '=')
271
0
      eof++;
272
0
  }
273
274
  /* Legacy behaviour: an empty input chunk signals end of input. */
275
7.64k
  if (inl == 0) {
276
0
    rv = 0;
277
0
    goto end;
278
0
  }
279
280
2.49M
  for (i = 0; i < inl; i++) {
281
2.48M
    tmp = *(in++);
282
2.48M
    v = conv_ascii2bin(tmp);
283
2.48M
    if (v == B64_ERROR) {
284
0
      rv = -1;
285
0
      goto end;
286
0
    }
287
288
2.48M
    if (tmp == '=') {
289
15.2k
      eof++;
290
2.47M
    } else if (eof > 0 && B64_BASE64(v)) {
291
      /* More data after padding. */
292
0
      rv = -1;
293
0
      goto end;
294
0
    }
295
296
2.48M
    if (eof > 2) {
297
0
      rv = -1;
298
0
      goto end;
299
0
    }
300
301
2.48M
    if (v == B64_EOF) {
302
0
      seof = 1;
303
0
      goto tail;
304
0
    }
305
306
    /* Only save valid base64 characters. */
307
2.48M
    if (B64_BASE64(v)) {
308
2.44M
      if (n >= 64) {
309
        /*
310
         * We increment n once per loop, and empty the
311
         * buffer as soon as we reach 64 characters, so
312
         * this can only happen if someone's manually
313
         * messed with the ctx. Refuse to write any
314
         * more data.
315
         */
316
0
        rv = -1;
317
0
        goto end;
318
0
      }
319
2.44M
      OPENSSL_assert(n < (int)sizeof(ctx->enc_data));
320
0
      d[n++] = tmp;
321
2.44M
    }
322
323
2.48M
    if (n == 64) {
324
34.3k
      decoded_len = EVP_DecodeBlock(out, d, n);
325
34.3k
      n = 0;
326
34.3k
      if (decoded_len < 0 || eof > decoded_len) {
327
0
        rv = -1;
328
0
        goto end;
329
0
      }
330
34.3k
      ret += decoded_len - eof;
331
34.3k
      out += decoded_len - eof;
332
34.3k
    }
333
2.48M
  }
334
335
  /*
336
   * Legacy behaviour: if the current line is a full base64-block (i.e.,
337
   * has 0 mod 4 base64 characters), it is processed immediately. We keep
338
   * this behaviour as applications may not be calling EVP_DecodeFinal
339
   * properly.
340
   */
341
7.64k
 tail:
342
7.64k
  if (n > 0) {
343
7.64k
    if ((n & 3) == 0) {
344
7.64k
      decoded_len = EVP_DecodeBlock(out, d, n);
345
7.64k
      n = 0;
346
7.64k
      if (decoded_len < 0 || eof > decoded_len) {
347
0
        rv = -1;
348
0
        goto end;
349
0
      }
350
7.64k
      ret += (decoded_len - eof);
351
7.64k
    } else if (seof) {
352
      /* EOF in the middle of a base64 block. */
353
0
      rv = -1;
354
0
      goto end;
355
0
    }
356
7.64k
  }
357
358
7.64k
  rv = seof || (n == 0 && eof) ? 0 : 1;
359
7.64k
 end:
360
  /* Legacy behaviour. This should probably rather be zeroed on error. */
361
7.64k
  *outl = ret;
362
7.64k
  ctx->num = n;
363
7.64k
  return (rv);
364
7.64k
}
365
LCRYPTO_ALIAS(EVP_DecodeUpdate);
366
367
int
368
EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n)
369
42.0k
{
370
42.0k
  int i, ret = 0, a, b, c, d;
371
42.0k
  unsigned long l;
372
373
  /* trim white space from the start of the line. */
374
42.0k
  while ((conv_ascii2bin(*f) == B64_WS) && (n > 0)) {
375
0
    f++;
376
0
    n--;
377
0
  }
378
379
  /* strip off stuff at the end of the line
380
   * ascii2bin values B64_WS, B64_EOLN, B64_EOLN and B64_EOF */
381
42.0k
  while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n - 1]))))
382
0
    n--;
383
384
42.0k
  if (n % 4 != 0)
385
0
    return (-1);
386
387
653k
  for (i = 0; i < n; i += 4) {
388
611k
    a = conv_ascii2bin(*(f++));
389
611k
    b = conv_ascii2bin(*(f++));
390
611k
    c = conv_ascii2bin(*(f++));
391
611k
    d = conv_ascii2bin(*(f++));
392
611k
    if ((a & 0x80) || (b & 0x80) ||
393
611k
        (c & 0x80) || (d & 0x80))
394
0
      return (-1);
395
611k
    l = ((((unsigned long)a) << 18L) |
396
611k
        (((unsigned long)b) << 12L) |
397
611k
        (((unsigned long)c) << 6L) |
398
611k
        (((unsigned long)d)));
399
611k
    *(t++) = (unsigned char)(l >> 16L) & 0xff;
400
611k
    *(t++) = (unsigned char)(l >> 8L) & 0xff;
401
611k
    *(t++) = (unsigned char)(l) & 0xff;
402
611k
    ret += 3;
403
611k
  }
404
42.0k
  return (ret);
405
42.0k
}
406
LCRYPTO_ALIAS(EVP_DecodeBlock);
407
408
int
409
EVP_DecodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
410
7.64k
{
411
7.64k
  int i;
412
413
7.64k
  *outl = 0;
414
7.64k
  if (ctx->num != 0) {
415
0
    i = EVP_DecodeBlock(out, ctx->enc_data, ctx->num);
416
0
    if (i < 0)
417
0
      return (-1);
418
0
    ctx->num = 0;
419
0
    *outl = i;
420
0
    return (1);
421
0
  } else
422
7.64k
    return (1);
423
7.64k
}
424
LCRYPTO_ALIAS(EVP_DecodeFinal);