visaljs 0.0.1 → 0.0.3

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

@@ -1,40 +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 bearssl_rsa.h */
-uint32_t
-br_rsa_i31_pss_sign(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,
-	const br_rsa_private_key *sk, unsigned char *x)
-{
-	if (!br_rsa_pss_sig_pad(rng, hf_data, hf_mgf1, hash,
-		salt_len, sk->n_bitlen, x))
-	{
-		return 0;
-	}
-	return br_rsa_i31_private(x, sk);
-}

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

@@ -1,44 +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 bearssl_rsa.h */
-uint32_t
-br_rsa_i31_pss_vrfy(const unsigned char *x, size_t xlen,
-	const br_hash_class *hf_data, const br_hash_class *hf_mgf1,
-	const void *hash, size_t salt_len, const br_rsa_public_key *pk)
-{
-	unsigned char sig[BR_MAX_RSA_SIZE >> 3];
-
-	if (xlen > (sizeof sig)) {
-		return 0;
-	}
-	memcpy(sig, x, xlen);
-	if (!br_rsa_i31_public(sig, xlen, pk)) {
-		return 0;
-	}
-	return br_rsa_pss_sig_unpad(hf_data, hf_mgf1,
-		hash, salt_len, pk, sig);
-}

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

@@ -1,106 +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"
-
-/*
- * As a strict minimum, we need four buffers that can hold a
- * modular integer.
- */
-#define TLEN   (4 * (2 + ((BR_MAX_RSA_SIZE + 30) / 31)))
-
-/* see bearssl_rsa.h */
-uint32_t
-br_rsa_i31_public(unsigned char *x, size_t xlen,
-	const br_rsa_public_key *pk)
-{
-	const unsigned char *n;
-	size_t nlen;
-	uint32_t tmp[1 + TLEN];
-	uint32_t *m, *a, *t;
-	size_t fwlen;
-	long z;
-	uint32_t m0i, r;
-
-	/*
-	 * Get the actual length of the modulus, and see if it fits within
-	 * our stack buffer. We also check that the length of x[] is valid.
-	 */
-	n = pk->n;
-	nlen = pk->nlen;
-	while (nlen > 0 && *n == 0) {
-		n ++;
-		nlen --;
-	}
-	if (nlen == 0 || nlen > (BR_MAX_RSA_SIZE >> 3) || xlen != nlen) {
-		return 0;
-	}
-	z = (long)nlen << 3;
-	fwlen = 1;
-	while (z > 0) {
-		z -= 31;
-		fwlen ++;
-	}
-	/*
-	 * Round up length to an even number.
-	 */
-	fwlen += (fwlen & 1);
-
-	/*
-	 * The modulus gets decoded into m[].
-	 * The value to exponentiate goes into a[].
-	 * The temporaries for modular exponentiation are in t[].
-	 */
-	m = tmp;
-	a = m + fwlen;
-	t = m + 2 * fwlen;
-
-	/*
-	 * Decode the modulus.
-	 */
-	br_i31_decode(m, n, nlen);
-	m0i = br_i31_ninv31(m[1]);
-
-	/*
-	 * Note: if m[] is even, then m0i == 0. Otherwise, m0i must be
-	 * an odd integer.
-	 */
-	r = m0i & 1;
-
-	/*
-	 * Decode x[] into a[]; we also check that its value is proper.
-	 */
-	r &= br_i31_decode_mod(a, x, xlen, m);
-
-	/*
-	 * Compute the modular exponentiation.
-	 */
-	br_i31_modpow_opt(a, pk->e, pk->elen, m, m0i, t, TLEN - 2 * fwlen);
-
-	/*
-	 * Encode the result.
-	 */
-	br_i31_encode(x, xlen, a);
-	return r;
-}

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

@@ -1,152 +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"
-
-/*
- * Recompute public exponent, based on factor p and reduced private
- * exponent dp.
- */
-static uint32_t
-get_pubexp(const unsigned char *pbuf, size_t plen,
-	const unsigned char *dpbuf, size_t dplen)
-{
-	/*
-	 * dp is the inverse of e modulo p-1. If p = 3 mod 4, then
-	 * p-1 = 2*((p-1)/2). Taken modulo 2, e is odd and has inverse 1;
-	 * thus, dp must be odd.
-	 *
-	 * We compute the inverse of dp modulo (p-1)/2. This requires
-	 * first reducing dp modulo (p-1)/2 (this can be done with a
-	 * conditional subtract, no need to use the generic modular
-	 * reduction function); then, we use moddiv.
-	 */
-
-	uint32_t tmp[6 * ((BR_MAX_RSA_FACTOR + 61) / 31)];
-	uint32_t *p, *dp, *x;
-	size_t len;
-	uint32_t e;
-
-	/*
-	 * Compute actual factor length (in bytes) and check that it fits
-	 * under our size constraints.
-	 */
-	while (plen > 0 && *pbuf == 0) {
-		pbuf ++;
-		plen --;
-	}
-	if (plen == 0 || plen < 5 || plen > (BR_MAX_RSA_FACTOR / 8)) {
-		return 0;
-	}
-
-	/*
-	 * Compute actual reduced exponent length (in bytes) and check that
-	 * it is not longer than p.
-	 */
-	while (dplen > 0 && *dpbuf == 0) {
-		dpbuf ++;
-		dplen --;
-	}
-	if (dplen > plen || dplen == 0
-		|| (dplen == plen && dpbuf[0] > pbuf[0]))
-	{
-		return 0;
-	}
-
-	/*
-	 * Verify that p = 3 mod 4 and that dp is odd.
-	 */
-	if ((pbuf[plen - 1] & 3) != 3 || (dpbuf[dplen - 1] & 1) != 1) {
-		return 0;
-	}
-
-	/*
-	 * Decode p and compute (p-1)/2.
-	 */
-	p = tmp;
-	br_i31_decode(p, pbuf, plen);
-	len = (p[0] + 63) >> 5;
-	br_i31_rshift(p, 1);
-
-	/*
-	 * Decode dp and make sure its announced bit length matches that of
-	 * p (we already know that the size of dp, in bits, does not exceed
-	 * the size of p, so we just have to copy the header word).
-	 */
-	dp = p + len;
-	memset(dp, 0, len * sizeof *dp);
-	br_i31_decode(dp, dpbuf, dplen);
-	dp[0] = p[0];
-
-	/*
-	 * Subtract (p-1)/2 from dp if necessary.
-	 */
-	br_i31_sub(dp, p, NOT(br_i31_sub(dp, p, 0)));
-
-	/*
-	 * If another subtraction is needed, then this means that the
-	 * value was invalid. We don't care to leak information about
-	 * invalid keys.
-	 */
-	if (br_i31_sub(dp, p, 0) == 0) {
-		return 0;
-	}
-
-	/*
-	 * Invert dp modulo (p-1)/2. If the inversion fails, then the
-	 * key value was invalid.
-	 */
-	x = dp + len;
-	br_i31_zero(x, p[0]);
-	x[1] = 1;
-	if (br_i31_moddiv(x, dp, p, br_i31_ninv31(p[1]), x + len) == 0) {
-		return 0;
-	}
-
-	/*
-	 * We now have an inverse. We must set it to zero (error) if its
-	 * length is greater than 32 bits and/or if it is an even integer.
-	 * Take care that the bit_length function returns an encoded
-	 * bit length.
-	 */
-	e = (uint32_t)x[1] | ((uint32_t)x[2] << 31);
-	e &= -LT(br_i31_bit_length(x + 1, len - 1), 34);
-	e &= -(e & 1);
-	return e;
-}
-
-/* see bearssl_rsa.h */
-uint32_t
-br_rsa_i31_compute_pubexp(const br_rsa_private_key *sk)
-{
-	/*
-	 * Get the public exponent from both p and q. This is the right
-	 * exponent if we get twice the same value.
-	 */
-	uint32_t ep, eq;
-
-	ep = get_pubexp(sk->p, sk->plen, sk->dp, sk->dplen);
-	eq = get_pubexp(sk->q, sk->qlen, sk->dq, sk->dqlen);
-	return ep & -EQ(ep, eq);
-}

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

@@ -1,41 +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 bearssl_rsa.h */
-uint32_t
-br_rsa_i32_oaep_decrypt(const br_hash_class *dig,
-	const void *label, size_t label_len,
-	const br_rsa_private_key *sk, void *data, size_t *len)
-{
-	uint32_t r;
-
-	if (*len != ((sk->n_bitlen + 7) >> 3)) {
-		return 0;
-	}
-	r = br_rsa_i32_private(data, sk);
-	r &= br_rsa_oaep_unpad(dig, label, label_len, data, len);
-	return r;
-}

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

@@ -1,44 +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 bearssl_rsa.h */
-size_t
-br_rsa_i32_oaep_encrypt(
-	const br_prng_class **rnd, const br_hash_class *dig,
-	const void *label, size_t label_len,
-	const br_rsa_public_key *pk,
-	void *dst, size_t dst_max_len,
-	const void *src, size_t src_len)
-{
-	size_t dlen;
-
-	dlen = br_rsa_oaep_pad(rnd, dig, label, label_len,
-		pk, dst, dst_max_len, src, src_len);
-	if (dlen == 0) {
-		return 0;
-	}
-	return dlen & -(size_t)br_rsa_i32_public(dst, dlen, pk);
-}

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

@@ -1,37 +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_i32_pkcs1_sign(const unsigned char *hash_oid,
-	const unsigned char *hash, size_t hash_len,
-	const br_rsa_private_key *sk, unsigned char *x)
-{
-	if (!br_rsa_pkcs1_sig_pad(hash_oid, hash, hash_len, sk->n_bitlen, x)) {
-		return 0;
-	}
-	return br_rsa_i32_private(x, sk);
-}

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

@@ -1,43 +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_i32_pkcs1_vrfy(const unsigned char *x, size_t xlen,
-	const unsigned char *hash_oid, size_t hash_len,
-	const br_rsa_public_key *pk, unsigned char *hash_out)
-{
-	unsigned char sig[BR_MAX_RSA_SIZE >> 3];
-
-	if (xlen > (sizeof sig)) {
-		return 0;
-	}
-	memcpy(sig, x, xlen);
-	if (!br_rsa_i32_public(sig, xlen, pk)) {
-		return 0;
-	}
-	return br_rsa_pkcs1_sig_unpad(sig, xlen, hash_oid, hash_len, hash_out);
-}

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

@@ -1,160 +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"
-
-#define U   (1 + (BR_MAX_RSA_FACTOR >> 5))
-
-/* see bearssl_rsa.h */
-uint32_t
-br_rsa_i32_private(unsigned char *x, const br_rsa_private_key *sk)
-{
-	const unsigned char *p, *q;
-	size_t plen, qlen;
-	uint32_t tmp[6 * U];
-	uint32_t *mp, *mq, *s1, *s2, *t1, *t2, *t3;
-	uint32_t p0i, q0i;
-	size_t xlen, u;
-	uint32_t r;
-
-	/*
-	 * All our temporary buffers are from the tmp[] array.
-	 *
-	 * The mp, mq, s1, s2, t1 and t2 buffers are large enough to
-	 * contain a RSA factor. The t3 buffer can contain a complete
-	 * RSA modulus. t3 shares its storage space with s2, s1 and t1,
-	 * in that order (this is important, see below).
-	 */
-	mq = tmp;
-	mp = tmp + U;
-	t2 = tmp + 2 * U;
-	s2 = tmp + 3 * U;
-	s1 = tmp + 4 * U;
-	t1 = tmp + 5 * U;
-	t3 = s2;
-
-	/*
-	 * Compute the actual lengths (in bytes) of p and q, and check
-	 * that they fit within our stack buffers.
-	 */
-	p = sk->p;
-	plen = sk->plen;
-	while (plen > 0 && *p == 0) {
-		p ++;
-		plen --;
-	}
-	q = sk->q;
-	qlen = sk->qlen;
-	while (qlen > 0 && *q == 0) {
-		q ++;
-		qlen --;
-	}
-	if (plen > (BR_MAX_RSA_FACTOR >> 3)
-		|| qlen > (BR_MAX_RSA_FACTOR >> 3))
-	{
-		return 0;
-	}
-
-	/*
-	 * Decode p and q.
-	 */
-	br_i32_decode(mp, p, plen);
-	br_i32_decode(mq, q, qlen);
-
-	/*
-	 * Recompute modulus, to compare with the source value.
-	 */
-	br_i32_zero(t2, mp[0]);
-	br_i32_mulacc(t2, mp, mq);
-	xlen = (sk->n_bitlen + 7) >> 3;
-	br_i32_encode(t2 + 2 * U, xlen, t2);
-	u = xlen;
-	r = 0;
-	while (u > 0) {
-		uint32_t wn, wx;
-
-		u --;
-		wn = ((unsigned char *)(t2 + 2 * U))[u];
-		wx = x[u];
-		r = ((wx - (wn + r)) >> 8) & 1;
-	}
-
-	/*
-	 * Compute s1 = x^dp mod p.
-	 */
-	p0i = br_i32_ninv32(mp[1]);
-	br_i32_decode_reduce(s1, x, xlen, mp);
-	br_i32_modpow(s1, sk->dp, sk->dplen, mp, p0i, t1, t2);
-
-	/*
-	 * Compute s2 = x^dq mod q.
-	 */
-	q0i = br_i32_ninv32(mq[1]);
-	br_i32_decode_reduce(s2, x, xlen, mq);
-	br_i32_modpow(s2, sk->dq, sk->dqlen, mq, q0i, t1, t2);
-
-	/*
-	 * Compute:
-	 *   h = (s1 - s2)*(1/q) mod p
-	 * s1 is an integer modulo p, but s2 is modulo q. PKCS#1 is
-	 * unclear about whether p may be lower than q (some existing,
-	 * widely deployed implementations of RSA don't tolerate p < q),
-	 * but we want to support that occurrence, so we need to use the
-	 * reduction function.
-	 *
-	 * Since we use br_i32_decode_reduce() for iq (purportedly, the
-	 * inverse of q modulo p), we also tolerate improperly large
-	 * values for this parameter.
-	 */
-	br_i32_reduce(t2, s2, mp);
-	br_i32_add(s1, mp, br_i32_sub(s1, t2, 1));
-	br_i32_to_monty(s1, mp);
-	br_i32_decode_reduce(t1, sk->iq, sk->iqlen, mp);
-	br_i32_montymul(t2, s1, t1, mp, p0i);
-
-	/*
-	 * h is now in t2. We compute the final result:
-	 *   s = s2 + q*h
-	 * All these operations are non-modular.
-	 *
-	 * We need mq, s2 and t2. We use the t3 buffer as destination.
-	 * The buffers mp, s1 and t1 are no longer needed. Moreover,
-	 * the first step is to copy s2 into the destination buffer t3.
-	 * We thus arranged for t3 to actually share space with s2, and
-	 * to be followed by the space formerly used by s1 and t1.
-	 */
-	br_i32_mulacc(t3, mq, t2);
-
-	/*
-	 * Encode the result. Since we already checked the value of xlen,
-	 * we can just use it right away.
-	 */
-	br_i32_encode(x, xlen, t3);
-
-	/*
-	 * The only error conditions remaining at that point are invalid
-	 * values for p and q (even integers).
-	 */
-	return p0i & q0i & r;
-}