36 	uint32_t *mp, *mq, *s1, *s2, *t1, *t2, *t3;  in br_rsa_i32_private()  local
44 	 * The mp, mq, s1, s2, t1 and t2 buffers are large enough to  in br_rsa_i32_private()
46 	 * RSA modulus. t3 shares its storage space with s2, s1 and t1,  in br_rsa_i32_private()
52 	s2 = tmp + 3 * U;  in br_rsa_i32_private()
55 	t3 = s2;  in br_rsa_i32_private()
111 	 * Compute s2 = x^dq mod q.  in br_rsa_i32_private()
114 	br_i32_decode_reduce(s2, x, xlen, mq);  in br_rsa_i32_private()
115 	br_i32_modpow(s2, sk->dq, sk->dqlen, mq, q0i, t1, t2);  in br_rsa_i32_private()
119 	 *   h = (s1 - s2)*(1/q) mod p  in br_rsa_i32_private()
120 	 * s1 is an integer modulo p, but s2 is modulo q. PKCS#1 is  in br_rsa_i32_private()
130 	br_i32_reduce(t2, s2, mp);  in br_rsa_i32_private()
138 	 *   s = s2 + q*h  in br_rsa_i32_private()
141 	 * We need mq, s2 and t2. We use the t3 buffer as destination.  in br_rsa_i32_private()
143 	 * the first step is to copy s2 into the destination buffer t3.  in br_rsa_i32_private()
144 	 * We thus arranged for t3 to actually share space with s2, and  in br_rsa_i32_private()