1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.]
58 #include "internal/cryptlib.h"
61 void BN_RECP_CTX_init(BN_RECP_CTX *recp)
69 BN_RECP_CTX *BN_RECP_CTX_new(void)
73 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
76 BN_RECP_CTX_init(ret);
77 ret->flags = BN_FLG_MALLOCED;
81 void BN_RECP_CTX_free(BN_RECP_CTX *recp)
88 if (recp->flags & BN_FLG_MALLOCED)
92 int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
94 if (!BN_copy(&(recp->N), d))
97 recp->num_bits = BN_num_bits(d);
102 int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
103 BN_RECP_CTX *recp, BN_CTX *ctx)
110 if ((a = BN_CTX_get(ctx)) == NULL)
114 if (!BN_sqr(a, x, ctx))
117 if (!BN_mul(a, x, y, ctx))
122 ca = x; /* Just do the mod */
124 ret = BN_div_recp(NULL, r, ca, recp, ctx);
131 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
132 BN_RECP_CTX *recp, BN_CTX *ctx)
135 BIGNUM *a, *b, *d, *r;
148 if (a == NULL || b == NULL || d == NULL || r == NULL)
151 if (BN_ucmp(m, &(recp->N)) < 0) {
153 if (!BN_copy(r, m)) {
162 * We want the remainder Given input of ABCDEF / ab we need multiply
163 * ABCDEF by 3 digests of the reciprocal of ab
166 /* i := max(BN_num_bits(m), 2*BN_num_bits(N)) */
168 j = recp->num_bits << 1;
172 /* Nr := round(2^i / N) */
173 if (i != recp->shift)
174 recp->shift = BN_reciprocal(&(recp->Nr), &(recp->N), i, ctx);
175 /* BN_reciprocal could have returned -1 for an error */
176 if (recp->shift == -1)
180 * d := |round(round(m / 2^BN_num_bits(N)) * recp->Nr / 2^(i - BN_num_bits(N)))|
181 * = |round(round(m / 2^BN_num_bits(N)) * round(2^i / N) / 2^(i - BN_num_bits(N)))|
182 * <= |(m / 2^BN_num_bits(N)) * (2^i / N) * (2^BN_num_bits(N) / 2^i)|
185 if (!BN_rshift(a, m, recp->num_bits))
187 if (!BN_mul(b, a, &(recp->Nr), ctx))
189 if (!BN_rshift(d, b, i - recp->num_bits))
193 if (!BN_mul(b, &(recp->N), d, ctx))
195 if (!BN_usub(r, m, b))
200 while (BN_ucmp(r, &(recp->N)) >= 0) {
202 BNerr(BN_F_BN_DIV_RECP, BN_R_BAD_RECIPROCAL);
205 if (!BN_usub(r, r, &(recp->N)))
207 if (!BN_add_word(d, 1))
211 r->neg = BN_is_zero(r) ? 0 : m->neg;
212 d->neg = m->neg ^ recp->N.neg;
222 * len is the expected size of the result We actually calculate with an extra
223 * word of precision, so we can do faster division if the remainder is not
227 int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx)
233 if ((t = BN_CTX_get(ctx)) == NULL)
236 if (!BN_set_bit(t, len))
239 if (!BN_div(r, NULL, t, m, ctx))