Lines Matching defs:s1
1505 * Let q be the product of n distinct primes s1[j] (j = 1...n), where
1506 * each s1[j] has m significant bits. Let p be a prime p = 2 * q + 1, so
1507 * that q and each s1[j] divide p - 1 and p has M = n * m + 1
1534 * product s = prod(s1[j]) (j = 1...n) above. If the factor s1[j] is
1565 BIGNUM *s1[MVMAX]; /* private enabling keys */
1585 * distinct primes s1[j] (j = 1...n) and q divides p - 1. We
1604 s1[j] = BN_new();
1606 BN_generate_prime_ex(s1[j], modulus2 / n, 0,
1609 if (BN_cmp(s1[i], s1[j]) == 0)
1635 BN_mul(q, q, s1[j], ctx);
1648 if (BN_cmp(u, s1[i]) == 0)
1654 BN_copy(s1[j], u);
1787 * that the keys for the jth client do not s1[j] or the product
1788 * s1[j]) (j = 1...n) which is q by construction.
1790 * Compute the factor w such that w s1[j] = s1[j] for all j. The
1791 * easy way to do this is to compute (q + s1[j]) / s1[j].
1797 BN_add(w, q, s1[j]);
1798 BN_div(w, u, w, s1[j], ctx);
1814 * We revoke client j by dividing q by s1[j]. The quotient
1822 BN_div(s, u, s, s1[n], ctx);
1841 * the enabling keys s1[j]. Associated with each s1[j] are
1955 BN_free(s1[j]);