| /src/crypto/openssl/crypto/rsa/ |
| H A D | rsa_backend.c | 70 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL; in ossl_rsa_fromdata()
124 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params, in ossl_rsa_fromdata()
136 * need to have at least 2 factors in ossl_rsa_fromdata()
138 if (sk_BIGNUM_num(factors) < 2) { in ossl_rsa_fromdata()
144 * if we have more than two factors, n and d must also have in ossl_rsa_fromdata()
147 if (sk_BIGNUM_num(factors) > 2 in ossl_rsa_fromdata()
154 if (sk_BIGNUM_num(factors) == 2) { in ossl_rsa_fromdata()
155 /* for 2 factors we can use the sp800 functions to do this */ in ossl_rsa_fromdata()
156 if (!RSA_set0_factors(rsa, sk_BIGNUM_value(factors, 0), in ossl_rsa_fromdata()
157 sk_BIGNUM_value(factors, 1))) { in ossl_rsa_fromdata()
[all …]
|
| H A D | rsa_gen.c | 84 STACK_OF(BIGNUM) *factors, in DEFINE_STACK_OF()
127 p = sk_BIGNUM_value(factors, 0); in DEFINE_STACK_OF()
128 q = sk_BIGNUM_value(factors, 1); in DEFINE_STACK_OF()
131 for (i = 0; i < sk_BIGNUM_num(factors); i++) { in DEFINE_STACK_OF()
153 factor = sk_BIGNUM_value(factors, i); in DEFINE_STACK_OF()
175 for (i = 2; i < sk_BIGNUM_num(factors); i++) { in DEFINE_STACK_OF()
176 factor = sk_BIGNUM_value(factors, i); in DEFINE_STACK_OF()
210 for (i = 2; i < sk_BIGNUM_num(factors); i++) { in DEFINE_STACK_OF()
227 if (BN_mod_inverse(iqmp, sk_BIGNUM_value(factors, 1), in DEFINE_STACK_OF()
228 sk_BIGNUM_value(factors, 0), ctx) in DEFINE_STACK_OF()
[all …]
|
| H A D | rsa_mp_names.c | 20 * A fixed table of names for the RSA prime factors starting with
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 1108 SmallVector<ValueEntry, 8> Factors; in RemoveFactorFromExpression() local
1109 Factors.reserve(Tree.size()); in RemoveFactorFromExpression()
1112 Factors.append(E.second, ValueEntry(getRank(E.first), E.first)); in RemoveFactorFromExpression()
1117 for (unsigned i = 0, e = Factors.size(); i != e; ++i) { in RemoveFactorFromExpression()
1118 if (Factors[i].Op == Factor) { in RemoveFactorFromExpression()
1120 Factors.erase(Factors.begin()+i); in RemoveFactorFromExpression()
1126 if (ConstantInt *FC2 = dyn_cast<ConstantInt>(Factors[i].Op)) in RemoveFactorFromExpression()
1129 Factors.erase(Factors.begin()+i); in RemoveFactorFromExpression()
1133 if (ConstantFP *FC2 = dyn_cast<ConstantFP>(Factors[i].Op)) { in RemoveFactorFromExpression()
1139 Factors.erase(Factors.begin() + i); in RemoveFactorFromExpression()
[all …]
|
| /src/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | SampleProfileProbe.h | 38 // factors.
45 // violation of updating probe factors. In principle, the sum of distribution
56 // Allow a little bias due the rounding to integral factors.
58 // Distribution factors from last pass.
132 // pass updates distribution factors for each pseudo probe at the end of the
|
| /src/crypto/krb5/src/plugins/preauth/spake/ |
| H A D | spake_client.c | 49 /* Return true if SF-NONE is present in factors. */
51 contains_sf_none(krb5_spake_factor **factors) in contains_sf_none() argument
55 for (i = 0; factors != NULL && factors[i] != NULL; i++) { in contains_sf_none()
56 if (factors[i]->type == SPAKE_SF_NONE) in contains_sf_none()
137 * based on the factors in the challenge. */ in spake_prep_questions()
138 if (!contains_sf_none(ch->factors)) in spake_prep_questions()
221 if (!contains_sf_none(ch->factors)) in process_challenge()
|
| H A D | spake_kdc.c | 91 krb5_data thash, spake, factors; in parse_cookie() local
109 factors = make_data((char *)in.ptr, in.len); in parse_cookie()
115 *factors_out = factors; in parse_cookie()
250 msg.u.challenge.factors = flist; in send_challenge()
373 krb5_data cookie, thash_in, kdcpriv, factors, *der_req; in verify_response() local
392 ret = parse_cookie(&cookie, &stage, &group, &kdcpriv, &thash_in, &factors); in verify_response()
|
| /src/crypto/openssl/doc/man3/ |
| H A D | EVP_PKEY_CTX_set_scrypt_N.pod | 38 EVP_PKEY_CTX_set_scrypt_p() configure the work factors N, r and p.
42 If RAM is exceeded because the load factors are chosen too high, the
51 The work factors B<N>, B<r> and B<p> as well as B<maxmem_bytes> can be
|
| /src/crypto/openssl/providers/implementations/encode_decode/ |
| H A D | encode_key2text.c | 465 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text()
477 factors = sk_BIGNUM_const_new_null(); in rsa_to_text()
481 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text()
497 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text()
498 primes = sk_BIGNUM_const_num(factors); in rsa_to_text()
522 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text()
525 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text()
536 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text()
540 sk_BIGNUM_const_value(factors, i))) in rsa_to_text()
609 sk_BIGNUM_const_free(factors); in rsa_to_text()
|
| /src/crypto/openssl/doc/man7/ |
| H A D | EVP_PKEY-RSA.pod | 13 factors, exponents and coefficient for CRT calculations, of which the first
59 RSA prime factors. The factors are known as "p", "q" and "r_i" in RFC8017.
60 Up to eight additional "r_i" prime factors are supported.
169 These 4 fields are normally randomly generated. The prime factors "p1", "p2",
|
| H A D | EVP_KDF-SCRYPT.pod | 19 scrypt provides three work factors that can be customized: N, r and p. N, which
60 These parameters configure the scrypt work factors N, r, maxmem and p.
|
| /src/secure/lib/libcrypto/man/man3/ |
| H A D | EVP_PKEY_CTX_set_scrypt_N.3 | 100 \&\fBEVP_PKEY_CTX_set_scrypt_p()\fR configure the work factors N, r and p.
104 If RAM is exceeded because the load factors are chosen too high, the
112 The work factors \fBN\fR, \fBr\fR and \fBp\fR as well as \fBmaxmem_bytes\fR can be
|
| /src/secure/lib/libcrypto/man/man7/ |
| H A D | EVP_PKEY-RSA.7 | 74 factors, exponents and coefficient for CRT calculations, of which the first
115 RSA prime factors. The factors are known as "p", "q" and "r_i" in RFC8017.
116 Up to eight additional "r_i" prime factors are supported.
215 These 4 fields are normally randomly generated. The prime factors "p1", "p2",
|
| H A D | EVP_KDF-SCRYPT.7 | 80 scrypt provides three work factors that can be customized: N, r and p. N, which
119 These parameters configure the scrypt work factors N, r, maxmem and p.
|
| /src/usr.bin/factor/ |
| H A D | factor.c | 78 static void pollard_pminus1(BIGNUM *); /* print factors for big numbers */
102 static void pr_fact(BIGNUM *); /* print factors of a value */
157 * pr_fact - print the factors of a number
159 * Print the factors of the number, from the lowest to the highest.
163 * Factors are printed with leading tabs.
|
| H A D | factor.6 | 54 and the list of factors on a single line.
55 Factors are listed in ascending order, and are preceded by a space.
|
| /src/sys/contrib/device-tree/Bindings/display/imx/ |
| H A D | fsl,imx8qxp-dc-scaling-engine.yaml | 20 In general all scale factors are supported inside the supported frame
21 dimensions. In range of scale factors 1/16..16 the filtered output colors
|
| /src/usr.bin/primes/ |
| H A D | primes.h | 63 * To avoid excessive sieves for small factors, we use the table below to
65 * with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13.
|
| /src/sys/contrib/device-tree/Bindings/memory-controllers/ |
| H A D | renesas,rzg3e-xspi.yaml | 47 - description: Interrupt pulse signal by factors excluding errors
48 - description: Interrupt pulse signal by error factors
|
| /src/contrib/bearssl/src/x509/ |
| H A D | encode_rsa_rawder.c | 49 * are exactly two prime factors), and 'otherPrimeInfos' will in br_encode_rsa_raw_der()
50 * be absent (because there are exactly two prime factors). in br_encode_rsa_raw_der()
|
| /src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | Delinearization.cpp | 110 // Find factors that are multiplied with an expression that (possibly as a
115 // "%p * %q" are factors multiplied by the expression "(%a + {0, +, 1}_loop)"
266 SmallVector<const SCEV *, 2> Factors; in removeConstantFactors() local
269 Factors.push_back(Op); in removeConstantFactors()
271 return SE.getMulExpr(Factors); in removeConstantFactors()
315 // Remove constant factors. in findArrayDimensions()
|
| /src/share/doc/papers/diskperf/ |
| H A D | conclusions.ms | 44 In most situations, we feel that other factors are more
48 factors.
|
| /src/share/man/man4/ |
| H A D | aibs.4 | 137 the required resistor factors are provided by
140 in the native drivers, the resistor factors
|
| /src/sys/netinet6/ |
| H A D | ip6_id.c | 112 const u_int32_t pfacts[4]; /* factors of ru_n */
132 { 2, 3, 59652323, 0 }, /* factors of ru_n */
143 { 2, 3, 14563, 0 }, /* factors of ru_n */
|
| /src/contrib/bearssl/inc/ |
| H A D | bearssl_rsa.h | 89 * - They support only private keys with two prime factors. RSA private
90 * keys with three or more prime factors are nominally supported, but
93 * "too many" prime factors.
101 * - The two prime factors of the modulus need not have the same length
106 * - Prime factors and modulus must be smaller than a compile-time limit.
121 * are supported. There is no requirement that prime factors or
176 * The structure references the private factors, reduced private
424 * private key bytes (lengths of the modulus and the individual factors
468 * private key bytes (lengths of the modulus and the individual factors
1588 * - Both private factors `p` and `q` are equal to 3 modulo 4.
|