cryb-to/lib/enc/cryb_base32.c

197 lines
6.5 KiB
C
Raw Normal View History

2014-07-04 11:18:53 +00:00
/*-
* Copyright (c) 2013-2014 The University of Oslo
2014-07-04 11:18:53 +00:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote
* products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "cryb/impl.h"
#include <sys/types.h>
#include <errno.h>
#include <stdint.h>
#include <cryb/rfc4648.h>
static const char b32enc[] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
static const char b32dec[256] = {
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,
0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,
0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
};
/*
* Encode data in RFC 4648 base 32 representation. The target buffer must
* have room for base32_enclen(len) characters and a terminating NUL.
*/
int
base32_encode(const uint8_t *in, size_t ilen, char *out, size_t *olen)
{
uint64_t bits;
if (*olen <= base32_enclen(ilen)) {
*olen = base32_enclen(ilen) + 1;
errno = ENOSPC;
return (-1);
}
*olen = base32_enclen(ilen) + 1;
while (ilen >= 5) {
bits = 0;
bits |= (uint64_t)*in++ << 32;
bits |= (uint64_t)*in++ << 24;
bits |= (uint64_t)*in++ << 16;
bits |= (uint64_t)*in++ << 8;
bits |= (uint64_t)*in++;
*out++ = b32enc[bits >> 35 & 0x1f];
*out++ = b32enc[bits >> 30 & 0x1f];
*out++ = b32enc[bits >> 25 & 0x1f];
*out++ = b32enc[bits >> 20 & 0x1f];
*out++ = b32enc[bits >> 15 & 0x1f];
*out++ = b32enc[bits >> 10 & 0x1f];
*out++ = b32enc[bits >> 5 & 0x1f];
*out++ = b32enc[bits & 0x1f];
ilen -= 5;
}
if (ilen > 0) {
bits = 0;
switch (ilen) {
case 4:
bits |= (uint64_t)in[3] << 8;
case 3:
bits |= (uint64_t)in[2] << 16;
case 2:
bits |= (uint64_t)in[1] << 24;
case 1:
bits |= (uint64_t)in[0] << 32;
2014-07-19 02:59:42 +00:00
CRYB_NO_DEFAULT_CASE;
2014-07-04 11:18:53 +00:00
}
*out++ = b32enc[bits >> 35 & 0x1f];
*out++ = b32enc[bits >> 30 & 0x1f];
*out++ = ilen > 1 ? b32enc[bits >> 25 & 0x1f] : '=';
*out++ = ilen > 1 ? b32enc[bits >> 20 & 0x1f] : '=';
*out++ = ilen > 2 ? b32enc[bits >> 15 & 0x1f] : '=';
*out++ = ilen > 3 ? b32enc[bits >> 10 & 0x1f] : '=';
*out++ = ilen > 3 ? b32enc[bits >> 5 & 0x1f] : '=';
*out++ = '=';
}
*out++ = '\0';
return (0);
}
/*
* Decode data in RFC 4648 base 32 representation, stopping at the
* terminating NUL, the first invalid (non-base32, non-whitespace)
* character or after len characters, whichever comes first.
*
* Padding is handled sloppily: any padding character following the data
* is silently consumed. This not only simplifies the code but ensures
* compatibility with implementations which do not emit or understand
* padding.
*
* The olen argument is used by the caller to pass the size of the buffer
* and by base32_decode() to return the amount of data successfully
* decoded. If the buffer is too small, base32_decode() discards the
* excess data, but returns the total amount.
*/
int
base32_decode(const char *in, size_t ilen, uint8_t *out, size_t *olen)
{
size_t len;
int bits, shift, padding;
for (bits = shift = padding = len = 0; ilen && *in; --ilen, ++in) {
if (*in == ' ' || *in == '\t' || *in == '\r' || *in == '\n' ||
(padding && *in == '=')) {
/* consume */
continue;
} else if (!padding && b32dec[(uint8_t)*in] >= 0) {
/* shift into accumulator */
shift += 5;
bits = bits << 5 | b32dec[(uint8_t)*in];
} else if (!padding && *in == '=' &&
(shift == 1 || shift == 2 || shift == 3 || shift == 4)) {
/* final byte */
padding = 1;
} else {
/* error */
*olen = 0;
errno = EINVAL;
return (-1);
}
if (shift >= 8) {
/* output accumulated byte */
shift -= 8;
if (len++ < *olen)
*out++ = (bits >> shift) & 0xff;
}
}
/* non-zero bits in last byte before padding */
if (shift && (bits & ~(~0 << shift)) != 0) {
errno = EINVAL;
return (-1);
}
/* report decoded length */
if (len > *olen) {
/* overflow */
*olen = len;
errno = ENOSPC;
return (-1);
}
*olen = len;
return (0);
}