/* Copyright (c) 2017 Pieter Wuille * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ #include #include #include #include "bech32.h" static uint32_t bech32_polymod_step(uint32_t pre) { uint8_t b = pre >> 25; return ((pre & 0x1ffffff) << 5) ^ (-((b >> 0) & 1) & 0x3b6a57b2ul) ^ (-((b >> 1) & 1) & 0x26508e6dul) ^ (-((b >> 2) & 1) & 0x1ea119faul) ^ (-((b >> 3) & 1) & 0x3d4233ddul) ^ (-((b >> 4) & 1) & 0x2a1462b3ul); } static const char *CHARSET = "qpzry9x8gf2tvdw0s3jn54khce6mua7l"; static const int8_t TABLE[128] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 15, -1, 10, 17, 21, 20, 26, 30, 7, 5, -1, -1, -1, -1, -1, -1, -1, 29, -1, 24, 13, 25, 9, 8, 23, -1, 18, 22, 31, 27, 19, -1, 1, 0, 3, 16, 11, 28, 12, 14, 6, 4, 2, -1, -1, -1, -1, -1, -1, 29, -1, 24, 13, 25, 9, 8, 23, -1, 18, 22, 31, 27, 19, -1, 1, 0, 3, 16, 11, 28, 12, 14, 6, 4, 2, -1, -1, -1, -1, -1 }; bool bstring_bech32_serialize( char *output, const char *hrp, const uint8_t *data, size_t data_len ) { uint32_t chk = 1; size_t i = 0; while (hrp[i] != 0) { if (!(hrp[i] >> 5)) return false; chk = bech32_polymod_step(chk) ^ (hrp[i] >> 5); i += 1; } if (i + 7 + data_len > 90) return false; chk = bech32_polymod_step(chk); while (*hrp != 0) { chk = bech32_polymod_step(chk) ^ (*hrp & 0x1f); *(output++) = *(hrp++); } *(output++) = '1'; for (i = 0; i < data_len; i++) { if (*data >> 5) return false; chk = bech32_polymod_step(chk) ^ (*data); *(output++) = CHARSET[*(data++)]; } for (i = 0; i < 6; i++) chk = bech32_polymod_step(chk); chk ^= 1; for (i = 0; i < 6; i++) *(output++) = CHARSET[(chk >> ((5 - i) * 5)) & 0x1f]; *output = 0; return true; } bool bstring_bech32_deserialize( char *hrp, uint8_t *data, size_t *data_len, const char *input ) { uint32_t chk = 1; size_t i; size_t input_len = strlen(input); size_t hrp_len; int have_lower = 0, have_upper = 0; if (input_len < 8 || input_len > 90) { return false; } *data_len = 0; while (*data_len < input_len && input[(input_len - 1) - *data_len] != '1') (*data_len) += 1; hrp_len = input_len - (1 + *data_len); if (1 + *data_len >= input_len || *data_len < 6) return false; *(data_len) -= 6; for (i = 0; i < hrp_len; i++) { int ch = input[i]; if (ch < 33 || ch > 126) return false; if (ch >= 'a' && ch <= 'z') { have_lower = 1; } else if (ch >= 'A' && ch <= 'Z') { have_upper = 1; ch = (ch - 'A') + 'a'; } hrp[i] = ch; chk = bech32_polymod_step(chk) ^ (ch >> 5); } hrp[i] = 0; chk = bech32_polymod_step(chk); for (i = 0; i < hrp_len; i++) chk = bech32_polymod_step(chk) ^ (input[i] & 0x1f); i += 1; while (i < input_len) { int v = (input[i] & 0x80) ? -1 : TABLE[(int)input[i]]; if (input[i] >= 'a' && input[i] <= 'z') have_lower = 1; if (input[i] >= 'A' && input[i] <= 'Z') have_upper = 1; if (v == -1) return false; chk = bech32_polymod_step(chk) ^ v; if (i + 6 < input_len) data[i - (1 + hrp_len)] = v; i += 1; } if (have_lower && have_upper) return false; return chk == 1; } bool bstring_bech32_is(const char *str) { char hrp[84]; uint8_t data[84]; size_t data_len; if (!bstring_bech32_deserialize(hrp, data, &data_len, str)) return false; return true; } bool bstring_bech32_convert_bits( uint8_t *out, size_t *outlen, int outbits, const uint8_t *in, size_t inlen, int inbits, int pad ) { uint32_t val = 0; int bits = 0; uint32_t maxv = (((uint32_t)1) << outbits) - 1; while (inlen--) { val = (val << inbits) | *(in++); bits += inbits; while (bits >= outbits) { bits -= outbits; out[(*outlen)++] = (val >> bits) & maxv; } } if (pad) { if (bits) { out[(*outlen)++] = (val << (outbits - bits)) & maxv; } } else if (((val << (outbits - bits)) & maxv) || bits >= inbits) { return false; } return true; } bool bstring_bech32_encode( char *output, const char *hrp, int witver, const uint8_t *witprog, size_t witprog_len ) { uint8_t data[65]; size_t datalen = 0; bool ret; if (witver > 31) return false; if (witprog_len < 2 || witprog_len > 40) return false; data[0] = witver; ret = bstring_bech32_convert_bits( data + 1, &datalen, 5, witprog, witprog_len, 8, 1 ); if (!ret) return false; datalen += 1; return bstring_bech32_serialize(output, hrp, data, datalen); } bool bstring_bech32_decode( int *witver, uint8_t *witdata, size_t *witdata_len, char *hrp, const char *addr ) { uint8_t data[84]; size_t data_len; bool ret; if (!bstring_bech32_deserialize(hrp, data, &data_len, addr)) return false; if (data_len == 0 || data_len > 65) return false; if (data[0] > 31) return false; *witdata_len = 0; ret = bstring_bech32_convert_bits( witdata, witdata_len, 8, data + 1, data_len - 1, 5, 0 ); if (!ret) return false; if (*witdata_len < 2 || *witdata_len > 40) return false; *witver = data[0]; return true; } bool bstring_bech32_test(const char *addr) { char hrp[84]; uint8_t data[84]; size_t data_len; if (!bstring_bech32_deserialize(hrp, data, &data_len, addr)) return false; if (data_len == 0 || data_len > 65) return false; if (data[0] > 31) return false; return true; }