visaljs 0.0.1 → 0.0.3

package/runtime/third_party/bearssl/src/rsa/rsa_pkcs1_sig_unpad.c

@@ -1,121 +0,0 @@
-/*
- * Copyright (c) 2017 Thomas Pornin <pornin@bolet.org>
- *
- * 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 "inner.h"
-
-/* see bearssl_rsa.h */
-uint32_t
-br_rsa_pkcs1_sig_unpad(const unsigned char *sig, size_t sig_len,
-	const unsigned char *hash_oid, size_t hash_len,
-	unsigned char *hash_out)
-{
-	static const unsigned char pad1[] = {
-		0x00, 0x01, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
-	};
-
-	unsigned char pad2[43];
-	size_t u, x2, x3, pad_len, zlen;
-
-	if (sig_len < 11) {
-		return 0;
-	}
-
-	/*
-	 * Expected format:
-	 *  00 01 FF ... FF 00 30 x1 30 x2 06 x3 OID [ 05 00 ] 04 x4 HASH
-	 *
-	 * with the following rules:
-	 *
-	 *  -- Total length is that of the modulus and the signature
-	 *     (this was already verified by br_rsa_i31_public()).
-	 *
-	 *  -- There are at least eight bytes of value 0xFF.
-	 *
-	 *  -- x4 is equal to the hash length (hash_len).
-	 *
-	 *  -- x3 is equal to the encoded OID value length (so x3 is the
-	 *     first byte of hash_oid[]).
-	 *
-	 *  -- If the "05 00" is present, then x2 == x3 + 4; otherwise,
-	 *     x2 == x3 + 2.
-	 *
-	 *  -- x1 == x2 + x4 + 4.
-	 *
-	 * So the total length after the last "FF" is either x3 + x4 + 11
-	 * (with the "05 00") or x3 + x4 + 9 (without the "05 00").
-	 */
-
-	/*
-	 * Check the "00 01 FF .. FF 00" with at least eight 0xFF bytes.
-	 * The comparison is valid because we made sure that the signature
-	 * is at least 11 bytes long.
-	 */
-	if (memcmp(sig, pad1, sizeof pad1) != 0) {
-		return 0;
-	}
-	for (u = sizeof pad1; u < sig_len; u ++) {
-		if (sig[u] != 0xFF) {
-			break;
-		}
-	}
-
-	/*
-	 * Remaining length is sig_len - u bytes (including the 00 just
-	 * after the last FF). This must be equal to one of the two
-	 * possible values (depending on whether the "05 00" sequence is
-	 * present or not).
-	 */
-	if (hash_oid == NULL) {
-		if (sig_len - u != hash_len + 1 || sig[u] != 0x00) {
-			return 0;
-		}
-	} else {
-		x3 = hash_oid[0];
-		pad_len = x3 + 9;
-		memset(pad2, 0, pad_len);
-		zlen = sig_len - u - hash_len;
-		if (zlen == pad_len) {
-			x2 = x3 + 2;
-		} else if (zlen == pad_len + 2) {
-			x2 = x3 + 4;
-			pad_len = zlen;
-			pad2[pad_len - 4] = 0x05;
-		} else {
-			return 0;
-		}
-		pad2[1] = 0x30;
-		pad2[2] = x2 + hash_len + 4;
-		pad2[3] = 0x30;
-		pad2[4] = x2;
-		pad2[5] = 0x06;
-		memcpy(pad2 + 6, hash_oid, x3 + 1);
-		pad2[pad_len - 2] = 0x04;
-		pad2[pad_len - 1] = hash_len;
-		if (memcmp(pad2, sig + u, pad_len) != 0) {
-			return 0;
-		}
-	}
-	memcpy(hash_out, sig + sig_len - hash_len, hash_len);
-	return 1;
-}

package/runtime/third_party/bearssl/src/rsa/rsa_pss_sig_pad.c

@@ -1,106 +0,0 @@
-/*
- * Copyright (c) 2018 Thomas Pornin <pornin@bolet.org>
- *
- * 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 "inner.h"
-
-/* see inner.h */
-uint32_t
-br_rsa_pss_sig_pad(const br_prng_class **rng,
-	const br_hash_class *hf_data, const br_hash_class *hf_mgf1,
-	const unsigned char *hash, size_t salt_len,
-	uint32_t n_bitlen, unsigned char *x)
-{
-	size_t xlen, hash_len;
-	br_hash_compat_context hc;
-	unsigned char *salt, *seed;
-
-	hash_len = br_digest_size(hf_data);
-
-	/*
-	 * The padded string is one bit smaller than the modulus;
-	 * notably, if the modulus length is equal to 1 modulo 8, then
-	 * the padded string will be one _byte_ smaller, and the first
-	 * byte will be set to 0. We apply these transformations here.
-	 */
-	n_bitlen --;
-	if ((n_bitlen & 7) == 0) {
-		*x ++ = 0;
-	}
-	xlen = (n_bitlen + 7) >> 3;
-
-	/*
-	 * Check that the modulus is large enough for the hash value
-	 * length combined with the intended salt length.
-	 */
-	if (hash_len > xlen || salt_len > xlen
-		|| (hash_len + salt_len + 2) > xlen)
-	{
-		return 0;
-	}
-
-	/*
-	 * Produce a random salt.
-	 */
-	salt = x + xlen - hash_len - salt_len - 1;
-	if (salt_len != 0) {
-		(*rng)->generate(rng, salt, salt_len);
-	}
-
-	/*
-	 * Compute the seed for MGF1.
-	 */
-	seed = x + xlen - hash_len - 1;
-	hf_data->init(&hc.vtable);
-	memset(seed, 0, 8);
-	hf_data->update(&hc.vtable, seed, 8);
-	hf_data->update(&hc.vtable, hash, hash_len);
-	hf_data->update(&hc.vtable, salt, salt_len);
-	hf_data->out(&hc.vtable, seed);
-
-	/*
-	 * Prepare string PS (padded salt). The salt is already at the
-	 * right place.
-	 */
-	memset(x, 0, xlen - salt_len - hash_len - 2);
-	x[xlen - salt_len - hash_len - 2] = 0x01;
-
-	/*
-	 * Generate the mask and XOR it into PS.
-	 */
-	br_mgf1_xor(x, xlen - hash_len - 1, hf_mgf1, seed, hash_len);
-
-	/*
-	 * Clear the top bits to ensure the value is lower than the
-	 * modulus.
-	 */
-	x[0] &= 0xFF >> (((uint32_t)xlen << 3) - n_bitlen);
-
-	/*
-	 * The seed (H) is already in the right place. We just set the
-	 * last byte.
-	 */
-	x[xlen - 1] = 0xBC;
-
-	return 1;
-}

package/runtime/third_party/bearssl/src/rsa/rsa_pss_sig_unpad.c

@@ -1,121 +0,0 @@
-/*
- * Copyright (c) 2018 Thomas Pornin <pornin@bolet.org>
- *
- * 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 "inner.h"
-
-/* see inner.h */
-uint32_t
-br_rsa_pss_sig_unpad(const br_hash_class *hf_data,
-	const br_hash_class *hf_mgf1,
-	const unsigned char *hash, size_t salt_len,
-	const br_rsa_public_key *pk, unsigned char *x)
-{
-	size_t u, xlen, hash_len;
-	br_hash_compat_context hc;
-	unsigned char *seed, *salt;
-	unsigned char tmp[64];
-	uint32_t r, n_bitlen;
-
-	hash_len = br_digest_size(hf_data);
-
-	/*
-	 * Value r will be set to a non-zero value is any test fails.
-	 */
-	r = 0;
-
-	/*
-	 * The value bit length (as an integer) must be strictly less than
-	 * that of the modulus.
-	 */
-	for (u = 0; u < pk->nlen; u ++) {
-		if (pk->n[u] != 0) {
-			break;
-		}
-	}
-	if (u == pk->nlen) {
-		return 0;
-	}
-	n_bitlen = BIT_LENGTH(pk->n[u]) + ((uint32_t)(pk->nlen - u - 1) << 3);
-	n_bitlen --;
-	if ((n_bitlen & 7) == 0) {
-		r |= *x ++;
-	} else {
-		r |= x[0] & (0xFF << (n_bitlen & 7));
-	}
-	xlen = (n_bitlen + 7) >> 3;
-
-	/*
-	 * Check that the modulus is large enough for the hash value
-	 * length combined with the intended salt length.
-	 */
-	if (hash_len > xlen || salt_len > xlen
-		|| (hash_len + salt_len + 2) > xlen)
-	{
-		return 0;
-	}
-
-	/*
-	 * Check value of rightmost byte.
-	 */
-	r |= x[xlen - 1] ^ 0xBC;
-
-	/*
-	 * Generate the mask and XOR it into the first bytes to reveal PS;
-	 * we must also mask out the leading bits.
-	 */
-	seed = x + xlen - hash_len - 1;
-	br_mgf1_xor(x, xlen - hash_len - 1, hf_mgf1, seed, hash_len);
-	if ((n_bitlen & 7) != 0) {
-		x[0] &= 0xFF >> (8 - (n_bitlen & 7));
-	}
-
-	/*
-	 * Check that all padding bytes have the expected value.
-	 */
-	for (u = 0; u < (xlen - hash_len - salt_len - 2); u ++) {
-		r |= x[u];
-	}
-	r |= x[xlen - hash_len - salt_len - 2] ^ 0x01;
-
-	/*
-	 * Recompute H.
-	 */
-	salt = x + xlen - hash_len - salt_len - 1;
-	hf_data->init(&hc.vtable);
-	memset(tmp, 0, 8);
-	hf_data->update(&hc.vtable, tmp, 8);
-	hf_data->update(&hc.vtable, hash, hash_len);
-	hf_data->update(&hc.vtable, salt, salt_len);
-	hf_data->out(&hc.vtable, tmp);
-
-	/*
-	 * Check that the recomputed H value matches the one appearing
-	 * in the string.
-	 */
-	for (u = 0; u < hash_len; u ++) {
-		r |= tmp[u] ^ x[(xlen - hash_len - 1) + u];
-	}
-
-	return EQ0(r);
-}

package/runtime/third_party/bearssl/src/rsa/rsa_ssl_decrypt.c

@@ -1,52 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * 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 "inner.h"
-
-/* see bearssl_rsa.h */
-uint32_t
-br_rsa_ssl_decrypt(br_rsa_private core, const br_rsa_private_key *sk,
-	unsigned char *data, size_t len)
-{
-	uint32_t x;
-	size_t u;
-
-	/*
-	 * A first check on length. Since this test works only on the
-	 * buffer length, it needs not (and cannot) be constant-time.
-	 */
-	if (len < 59 || len != (sk->n_bitlen + 7) >> 3) {
-		return 0;
-	}
-	x = core(data, sk);
-
-	x &= EQ(data[0], 0x00);
-	x &= EQ(data[1], 0x02);
-	for (u = 2; u < (len - 49); u ++) {
-		x &= NEQ(data[u], 0);
-	}
-	x &= EQ(data[len - 49], 0x00);
-	memmove(data, data + len - 48, 48);
-	return x;
-}

package/runtime/third_party/bearssl/src/settings.c

@@ -1,306 +0,0 @@
-/*
- * Copyright (c) 2017 Thomas Pornin <pornin@bolet.org>
- *
- * 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 "inner.h"
-
-static const br_config_option config[] = {
-	{ "BR_64",
-#if BR_64
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_AES_X86NI",
-#if BR_AES_X86NI
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_amd64",
-#if BR_amd64
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_ARMEL_CORTEXM_GCC",
-#if BR_ARMEL_CORTEXM_GCC
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_BE_UNALIGNED",
-#if BR_BE_UNALIGNED
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_CLANG",
-#if BR_CLANG
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_CLANG_3_7",
-#if BR_CLANG_3_7
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_CLANG_3_8",
-#if BR_CLANG_3_8
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_CT_MUL15",
-#if BR_CT_MUL15
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_CT_MUL31",
-#if BR_CT_MUL31
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC",
-#if BR_GCC
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_4",
-#if BR_GCC_4_4
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_5",
-#if BR_GCC_4_5
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_6",
-#if BR_GCC_4_6
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_7",
-#if BR_GCC_4_7
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_8",
-#if BR_GCC_4_8
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_4_9",
-#if BR_GCC_4_9
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_GCC_5_0",
-#if BR_GCC_5_0
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_i386",
-#if BR_i386
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_INT128",
-#if BR_INT128
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_LE_UNALIGNED",
-#if BR_LE_UNALIGNED
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_LOMUL",
-#if BR_LOMUL
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MAX_EC_SIZE", BR_MAX_EC_SIZE },
-	{ "BR_MAX_RSA_SIZE", BR_MAX_RSA_SIZE },
-	{ "BR_MAX_RSA_FACTOR", BR_MAX_RSA_FACTOR },
-	{ "BR_MSC",
-#if BR_MSC
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2005",
-#if BR_MSC_2005
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2008",
-#if BR_MSC_2008
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2010",
-#if BR_MSC_2010
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2012",
-#if BR_MSC_2012
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2013",
-#if BR_MSC_2013
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_MSC_2015",
-#if BR_MSC_2015
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_POWER8",
-#if BR_POWER8
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_RDRAND",
-#if BR_RDRAND
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_SLOW_MUL",
-#if BR_SLOW_MUL
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_SLOW_MUL15",
-#if BR_SLOW_MUL15
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_SSE2",
-#if BR_SSE2
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_UMUL128",
-#if BR_UMUL128
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_USE_UNIX_TIME",
-#if BR_USE_UNIX_TIME
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_USE_WIN32_RAND",
-#if BR_USE_WIN32_RAND
-	 1
-#else
-	 0
-#endif
-	},
-	{ "BR_USE_WIN32_TIME",
-#if BR_USE_WIN32_TIME
-	 1
-#else
-	 0
-#endif
-	},
-
-	{ NULL, 0 }
-};
-
-/* see bearssl.h */
-const br_config_option *
-br_get_config(void)
-{
-	return config;
-}