2 * Copyright (c) 1996, 1998 by Internet Software Consortium.
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.
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
19 * Portions Copyright (c) 1995 by International Business Machines, Inc.
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
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.
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.
42 #include <ldns/config.h>
44 #include <sys/types.h>
45 #include <sys/param.h>
46 #ifdef HAVE_SYS_SOCKET_H
47 #include <sys/socket.h>
50 #ifdef HAVE_NETINET_IN_H
51 #include <netinet/in.h>
53 #ifdef HAVE_ARPA_INET_H
54 #include <arpa/inet.h>
62 /* "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";*/
63 static const char Base32[] =
64 "abcdefghijklmnopqrstuvwxyz234567";
65 /* "0123456789ABCDEFGHIJKLMNOPQRSTUV";*/
66 static const char Base32_extended_hex[] =
67 "0123456789abcdefghijklmnopqrstuv";
68 static const char Pad32 = '=';
70 /* (From RFC1521 and draft-ietf-dnssec-secext-03.txt)
73 The Base 32 encoding is designed to represent arbitrary sequences of
74 octets in a form that needs to be case insensitive but need not be
77 A 33-character subset of US-ASCII is used, enabling 5 bits to be
78 represented per printable character. (The extra 33rd character, "=",
79 is used to signify a special processing function.)
81 The encoding process represents 40-bit groups of input bits as output
82 strings of 8 encoded characters. Proceeding from left to right, a
83 40-bit input group is formed by concatenating 5 8bit input groups.
84 These 40 bits are then treated as 8 concatenated 5-bit groups, each
85 of which is translated into a single digit in the base 32 alphabet.
86 When encoding a bit stream via the base 32 encoding, the bit stream
87 must be presumed to be ordered with the most-significant-bit first.
88 That is, the first bit in the stream will be the high-order bit in
89 the first 8bit byte, and the eighth bit will be the low-order bit in
90 the first 8bit byte, and so on.
92 Each 5-bit group is used as an index into an array of 32 printable
93 characters. The character referenced by the index is placed in the
94 output string. These characters, identified in Table 3, below, are
95 selected from US-ASCII digits and uppercase letters.
97 Table 3: The Base 32 Alphabet
99 Value Encoding Value Encoding Value Encoding Value Encoding
106 6 G 15 P 24 Y (pad) =
111 Special processing is performed if fewer than 40 bits are available
112 at the end of the data being encoded. A full encoding quantum is
113 always completed at the end of a body. When fewer than 40 input bits
114 are available in an input group, zero bits are added (on the right)
115 to form an integral number of 5-bit groups. Padding at the end of
116 the data is performed using the "=" character. Since all base 32
117 input is an integral number of octets, only the following cases can
120 (1) the final quantum of encoding input is an integral multiple of 40
121 bits; here, the final unit of encoded output will be an integral
122 multiple of 8 characters with no "=" padding,
124 (2) the final quantum of encoding input is exactly 8 bits; here, the
125 final unit of encoded output will be two characters followed by six
126 "=" padding characters,
128 (3) the final quantum of encoding input is exactly 16 bits; here, the
129 final unit of encoded output will be four characters followed by four
130 "=" padding characters,
132 (4) the final quantum of encoding input is exactly 24 bits; here, the
133 final unit of encoded output will be five characters followed by
134 three "=" padding characters, or
136 (5) the final quantum of encoding input is exactly 32 bits; here, the
137 final unit of encoded output will be seven characters followed by one
138 "=" padding character.
141 6. Base 32 Encoding with Extended Hex Alphabet
143 The following description of base 32 is due to [7]. This encoding
144 should not be regarded as the same as the "base32" encoding, and
145 should not be referred to as only "base32".
147 One property with this alphabet, that the base32 and base32 alphabet
148 lack, is that encoded data maintain its sort order when the encoded
149 data is compared bit-wise.
151 This encoding is identical to the previous one, except for the
152 alphabet. The new alphabet is found in table 4.
154 Table 4: The "Extended Hex" Base 32 Alphabet
156 Value Encoding Value Encoding Value Encoding Value Encoding
163 6 6 15 F 24 O (pad) =
171 /* skips all whitespace anywhere.
172 converts characters, four at a time, starting at (or after)
173 src from base - 32 numbers into three 8 bit bytes in the target area.
174 it returns the number of data bytes stored at the target, or -1 on error.
178 ldns_b32_pton_ar(char const *src, size_t hashed_owner_str_len, uint8_t *target, size_t targsize, const char B32_ar[])
180 int tarindex, state, ch;
187 while ((ch = *src++) != '\0' && (i == 0 || i < (int) hashed_owner_str_len)) {
190 if (isspace((unsigned char)ch)) /* Skip whitespace anywhere. */
196 pos = strchr(B32_ar, ch);
198 /* A non-base32 character. */
205 if ((size_t)tarindex >= targsize) {
208 target[tarindex] = (pos - B32_ar) << 3;
214 if ((size_t)tarindex + 1 >= targsize) {
217 target[tarindex] |= (pos - B32_ar) >> 2;
218 target[tarindex+1] = ((pos - B32_ar) & 0x03)
226 if ((size_t)tarindex + 1 >= targsize) {
229 target[tarindex] |= (pos - B32_ar) << 1;
236 if ((size_t)tarindex + 1 >= targsize) {
239 target[tarindex] |= (pos - B32_ar) >> 4;
240 target[tarindex+1] = ((pos - B32_ar) & 0x0f) << 4 ;
247 if ((size_t)tarindex + 1 >= targsize) {
250 target[tarindex] |= (pos - B32_ar) >> 1;
251 target[tarindex+1] = ((pos - B32_ar) & 0x01)
259 if ((size_t)tarindex + 1 >= targsize) {
262 target[tarindex] |= (pos - B32_ar) << 2;
268 if ((size_t)tarindex + 1 >= targsize) {
271 target[tarindex] |= (pos - B32_ar) >> 3;
272 target[tarindex+1] = ((pos - B32_ar) & 0x07)
280 if ((size_t)tarindex + 1 >= targsize) {
283 target[tarindex] |= (pos - B32_ar);
294 * We are done decoding Base-32 chars. Let's see if we ended
295 * on a byte boundary, and/or with erroneous trailing characters.
298 if (ch == Pad32) { /* We got a pad char. */
299 ch = *src++; /* Skip it, get next. */
301 case 0: /* Invalid = in first position */
302 case 1: /* Invalid = in second position */
305 case 2: /* Valid, means one byte of info */
307 /* Skip any number of spaces. */
308 for ((void)NULL; ch != '\0'; ch = *src++)
309 if (!isspace((unsigned char)ch))
311 /* Make sure there is another trailing = sign. */
315 ch = *src++; /* Skip the = */
316 /* Fall through to "single trailing =" case. */
319 case 4: /* Valid, means two bytes of info */
323 * We know this char is an =. Is there anything but
324 * whitespace after it?
326 for ((void)NULL; ch != '\0'; ch = *src++)
327 if (!(isspace((unsigned char)ch) || ch == '=')) {
331 case 7: /* Valid, means three bytes of info */
333 * We know this char is an =. Is there anything but
334 * whitespace after it?
336 for ((void)NULL; ch != '\0'; ch = *src++)
337 if (!isspace((unsigned char)ch)) {
342 * Now make sure for cases 2 and 3 that the "extra"
343 * bits that slopped past the last full byte were
344 * zeros. If we don't check them, they become a
345 * subliminal channel.
347 if (target && target[tarindex] != 0) {
353 * We ended by seeing the end of the string. Make sure we
354 * have no partial bytes lying around.
364 ldns_b32_pton(char const *src, size_t hashed_owner_str_len, uint8_t *target, size_t targsize)
366 return ldns_b32_pton_ar(src, hashed_owner_str_len, target, targsize, Base32);
369 /* deprecated, here for backwards compatibility */
371 b32_pton(char const *src, size_t hashed_owner_str_len, uint8_t *target, size_t targsize)
373 return ldns_b32_pton_ar(src, hashed_owner_str_len, target, targsize, Base32);
377 ldns_b32_pton_extended_hex(char const *src, size_t hashed_owner_str_len, uint8_t *target, size_t targsize)
379 return ldns_b32_pton_ar(src, hashed_owner_str_len, target, targsize, Base32_extended_hex);
382 /* deprecated, here for backwards compatibility */
384 b32_pton_extended_hex(char const *src, size_t hashed_owner_str_len, uint8_t *target, size_t targsize)
386 return ldns_b32_pton_ar(src, hashed_owner_str_len, target, targsize, Base32_extended_hex);