Fabcoin Core  0.16.2
P2P Digital Currency
b64.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 1996 by Internet Software Consortium.
3  *
4  * Permission to use, copy, modify, and distribute this software for any
5  * purpose with or without fee is hereby granted, provided that the above
6  * copyright notice and this permission notice appear in all copies.
7  *
8  * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
9  * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
10  * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
11  * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
12  * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
13  * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
14  * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
15  * SOFTWARE.
16  */
17 
18 /*
19  * Portions Copyright (c) 1995 by International Business Machines, Inc.
20  *
21  * International Business Machines, Inc. (hereinafter called IBM) grants
22  * permission under its copyrights to use, copy, modify, and distribute this
23  * Software with or without fee, provided that the above copyright notice and
24  * all paragraphs of this notice appear in all copies, and that the name of IBM
25  * not be used in connection with the marketing of any product incorporating
26  * the Software or modifications thereof, without specific, written prior
27  * permission.
28  *
29  * To the extent it has a right to do so, IBM grants an immunity from suit
30  * under its patents, if any, for the use, sale or manufacture of products to
31  * the extent that such products are used for performing Domain Name System
32  * dynamic updates in TCP/IP networks by means of the Software. No immunity is
33  * granted for any product per se or for any other function of any product.
34  *
35  * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
36  * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
37  * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
38  * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
39  * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
40  * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
41  */
42 
43 /*
44  * Base64 encode/decode functions from OpenBSD (src/lib/libc/net/base64.c).
45  */
46 #include <stdio.h>
47 #include <string.h>
48 #include <stdlib.h>
49 #include <ctype.h>
50 #include <sys/types.h>
51 
52 #include "b64.h"
53 
54 
55 static const char Base64[] =
56  "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
57 static const char Pad64 = '=';
58 
59 /* (From RFC1521 and draft-ietf-dnssec-secext-03.txt)
60  The following encoding technique is taken from RFC 1521 by Borenstein
61  and Freed. It is reproduced here in a slightly edited form for
62  convenience.
63 
64  A 65-character subset of US-ASCII is used, enabling 6 bits to be
65  represented per printable character. (The extra 65th character, "=",
66  is used to signify a special processing function.)
67 
68  The encoding process represents 24-bit groups of input bits as output
69  strings of 4 encoded characters. Proceeding from left to right, a
70  24-bit input group is formed by concatenating 3 8-bit input groups.
71  These 24 bits are then treated as 4 concatenated 6-bit groups, each
72  of which is translated into a single digit in the base64 alphabet.
73 
74  Each 6-bit group is used as an index into an array of 64 printable
75  characters. The character referenced by the index is placed in the
76  output string.
77 
78  Table 1: The Base64 Alphabet
79 
80  Value Encoding Value Encoding Value Encoding Value Encoding
81  0 A 17 R 34 i 51 z
82  1 B 18 S 35 j 52 0
83  2 C 19 T 36 k 53 1
84  3 D 20 U 37 l 54 2
85  4 E 21 V 38 m 55 3
86  5 F 22 W 39 n 56 4
87  6 G 23 X 40 o 57 5
88  7 H 24 Y 41 p 58 6
89  8 I 25 Z 42 q 59 7
90  9 J 26 a 43 r 60 8
91  10 K 27 b 44 s 61 9
92  11 L 28 c 45 t 62 +
93  12 M 29 d 46 u 63 /
94  13 N 30 e 47 v
95  14 O 31 f 48 w (pad) =
96  15 P 32 g 49 x
97  16 Q 33 h 50 y
98 
99  Special processing is performed if fewer than 24 bits are available
100  at the end of the data being encoded. A full encoding quantum is
101  always completed at the end of a quantity. When fewer than 24 input
102  bits are available in an input group, zero bits are added (on the
103  right) to form an integral number of 6-bit groups. Padding at the
104  end of the data is performed using the '=' character.
105 
106  Since all base64 input is an integral number of octets, only the
107  -------------------------------------------------
108  following cases can arise:
109 
110  (1) the final quantum of encoding input is an integral
111  multiple of 24 bits; here, the final unit of encoded
112  output will be an integral multiple of 4 characters
113  with no "=" padding,
114  (2) the final quantum of encoding input is exactly 8 bits;
115  here, the final unit of encoded output will be two
116  characters followed by two "=" padding characters, or
117  (3) the final quantum of encoding input is exactly 16 bits;
118  here, the final unit of encoded output will be three
119  characters followed by one "=" padding character.
120 */
121 
122 int
123 libscrypt_b64_encode(src, srclength, target, targsize)
124  unsigned char const *src;
125  size_t srclength;
126  char *target;
127  size_t targsize;
128 {
129  size_t datalength = 0;
130  unsigned char input[3];
131  unsigned char output[4];
132  unsigned int i;
133 
134  while (2 < srclength) {
135  input[0] = *src++;
136  input[1] = *src++;
137  input[2] = *src++;
138  srclength -= 3;
139 
140  output[0] = input[0] >> 2;
141  output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4);
142  output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6);
143  output[3] = input[2] & 0x3f;
144 
145  if (datalength + 4 > targsize)
146  return (-1);
147  target[datalength++] = Base64[output[0]];
148  target[datalength++] = Base64[output[1]];
149  target[datalength++] = Base64[output[2]];
150  target[datalength++] = Base64[output[3]];
151  }
152 
153  /* Now we worry about padding. */
154  if (0 != srclength) {
155  /* Get what's left. */
156  input[0] = input[1] = input[2] = '\0';
157  for (i = 0; i < srclength; i++)
158  input[i] = *src++;
159 
160  output[0] = input[0] >> 2;
161  output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4);
162  output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6);
163 
164  if (datalength + 4 > targsize)
165  return (-1);
166  target[datalength++] = Base64[output[0]];
167  target[datalength++] = Base64[output[1]];
168  if (srclength == 1)
169  target[datalength++] = Pad64;
170  else
171  target[datalength++] = Base64[output[2]];
172  target[datalength++] = Pad64;
173  }
174  if (datalength >= targsize)
175  return (-1);
176  target[datalength] = '\0'; /* Returned value doesn't count \0. */
177  return (int)(datalength);
178 }
179 
180 /* skips all whitespace anywhere.
181  converts characters, four at a time, starting at (or after)
182  src from base - 64 numbers into three 8 bit bytes in the target area.
183  it returns the number of data bytes stored at the target, or -1 on error.
184  */
185 
186 int
187 libscrypt_b64_decode(src, target, targsize)
188  char const *src;
189  unsigned char *target;
190  size_t targsize;
191 {
192  int state, ch;
193  unsigned int tarindex;
194  unsigned char nextbyte;
195  char *pos;
196 
197  state = 0;
198  tarindex = 0;
199 
200  while ((ch = (unsigned char)*src++) != '\0') {
201  if (isspace(ch)) /* Skip whitespace anywhere. */
202  continue;
203 
204  if (ch == Pad64)
205  break;
206 
207  pos = strchr(Base64, ch);
208  if (pos == 0) /* A non-base64 character. */
209  return (-1);
210 
211  switch (state) {
212  case 0:
213  if (target) {
214  if (tarindex >= targsize)
215  return (-1);
216  target[tarindex] = (pos - Base64) << 2;
217  }
218  state = 1;
219  break;
220  case 1:
221  if (target) {
222  if (tarindex >= targsize)
223  return (-1);
224  target[tarindex] |= (pos - Base64) >> 4;
225  nextbyte = ((pos - Base64) & 0x0f) << 4;
226  if (tarindex + 1 < targsize)
227  target[tarindex+1] = nextbyte;
228  else if (nextbyte)
229  return (-1);
230  }
231  tarindex++;
232  state = 2;
233  break;
234  case 2:
235  if (target) {
236  if (tarindex >= targsize)
237  return (-1);
238  target[tarindex] |= (pos - Base64) >> 2;
239  nextbyte = ((pos - Base64) & 0x03) << 6;
240  if (tarindex + 1 < targsize)
241  target[tarindex+1] = nextbyte;
242  else if (nextbyte)
243  return (-1);
244  }
245  tarindex++;
246  state = 3;
247  break;
248  case 3:
249  if (target) {
250  if (tarindex >= targsize)
251  return (-1);
252  target[tarindex] |= (pos - Base64);
253  }
254  tarindex++;
255  state = 0;
256  break;
257  }
258  }
259 
260  /*
261  * We are done decoding Base-64 chars. Let's see if we ended
262  * on a byte boundary, and/or with erroneous trailing characters.
263  */
264 
265  if (ch == Pad64) { /* We got a pad char. */
266  ch = (unsigned char)*src++; /* Skip it, get next. */
267  switch (state) {
268  case 0: /* Invalid = in first position */
269  case 1: /* Invalid = in second position */
270  return (-1);
271 
272  case 2: /* Valid, means one byte of info */
273  /* Skip any number of spaces. */
274  for (; ch != '\0'; ch = (unsigned char)*src++)
275  if (!isspace(ch))
276  break;
277  /* Make sure there is another trailing = sign. */
278  if (ch != Pad64)
279  return (-1);
280  ch = (unsigned char)*src++; /* Skip the = */
281  /* Fall through to "single trailing =" case. */
282  /* FALLTHROUGH */
283 
284  case 3: /* Valid, means two bytes of info */
285  /*
286  * We know this char is an =. Is there anything but
287  * whitespace after it?
288  */
289  for (; ch != '\0'; ch = (unsigned char)*src++)
290  if (!isspace(ch))
291  return (-1);
292 
293  /*
294  * Now make sure for cases 2 and 3 that the "extra"
295  * bits that slopped past the last full byte were
296  * zeros. If we don't check them, they become a
297  * subliminal channel.
298  */
299  if (target && tarindex < targsize &&
300  target[tarindex] != 0)
301  return (-1);
302  }
303  } else {
304  /*
305  * We ended by seeing the end of the string. Make sure we
306  * have no partial bytes lying around.
307  */
308  if (state != 0)
309  return (-1);
310  }
311 
312  return (tarindex);
313 }
int libscrypt_b64_decode(char const *src, unsigned char *target, size_t targsize)
Definition: b64.c:187
int libscrypt_b64_encode(unsigned char const *src, size_t srclength, char *target, size_t targsize)
Definition: b64.c:123
uint32_t ch(uint32_t x, uint32_t y, uint32_t z)
Definition: picosha2.h:73