Home
last modified time | relevance | path

Searched full:factors (Results 1 – 25 of 284) sorted by relevance

12345678910>>...12

/freebsd/crypto/openssl/crypto/rsa/
H A Drsa_backend.c70 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL; in ossl_rsa_fromdata()
125 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params, in ossl_rsa_fromdata()
137 * need to have at least 2 factors in ossl_rsa_fromdata()
139 if (sk_BIGNUM_num(factors) < 2) { in ossl_rsa_fromdata()
145 * if we have more than two factors, n and d must also have in ossl_rsa_fromdata()
148 if (sk_BIGNUM_num(factors) > 2 in ossl_rsa_fromdata()
155 if (sk_BIGNUM_num(factors) == 2) { in ossl_rsa_fromdata()
156 /* for 2 factors we can use the sp800 functions to do this */ in ossl_rsa_fromdata()
157 if (!RSA_set0_factors(rsa, sk_BIGNUM_value(factors, 0), in ossl_rsa_fromdata()
158 sk_BIGNUM_value(factors, 1))) { in ossl_rsa_fromdata()
[all …]
H A Drsa_gen.c84 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) == NULL) in DEFINE_STACK_OF()
[all …]
H A Drsa_mp_names.c20 * A fixed table of names for the RSA prime factors starting with
H A Drsa_lib.c914 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null(); in ossl_rsa_check_factors()
918 if (factors == NULL || exps == NULL || coeffs == NULL) in ossl_rsa_check_factors()
925 ossl_rsa_get0_all_params(r, factors, exps, coeffs); in ossl_rsa_check_factors()
937 for (i = 0; i < sk_BIGNUM_const_num(factors); i++) { in ossl_rsa_check_factors()
938 bits = safe_BN_num_bits(sk_BIGNUM_const_value(factors, i)); in ossl_rsa_check_factors()
952 sk_BIGNUM_const_free(factors); in ossl_rsa_check_factors()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp1108 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 …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DSampleProfileProbe.h38 // 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
/freebsd/crypto/krb5/src/plugins/preauth/spake/
H A Dspake_client.c49 /* 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 Dspake_kdc.c91 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()
/freebsd/crypto/openssl/doc/man3/
H A DEVP_PKEY_CTX_set_scrypt_N.pod38 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
/freebsd/crypto/openssl/providers/implementations/encode_decode/
H A Dencode_key2text.c463 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text()
475 factors = sk_BIGNUM_const_new_null(); in rsa_to_text()
479 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text()
495 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text()
496 primes = sk_BIGNUM_const_num(factors); in rsa_to_text()
518 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text()
521 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text()
532 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text()
536 sk_BIGNUM_const_value(factors, i))) in rsa_to_text()
602 sk_BIGNUM_const_free(factors); in rsa_to_text()
/freebsd/crypto/openssl/doc/man7/
H A DEVP_PKEY-RSA.pod13 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 DEVP_KDF-SCRYPT.pod19 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.
/freebsd/secure/lib/libcrypto/man/man7/
H A DEVP_PKEY-RSA.771 factors, exponents and coefficient for CRT calculations, of which the first
112 RSA prime factors. The factors are known as "p", "q" and "r_i" in RFC8017.
113 Up to eight additional "r_i" prime factors are supported.
212 These 4 fields are normally randomly generated. The prime factors "p1", "p2",
H A DEVP_KDF-SCRYPT.777 scrypt provides three work factors that can be customized: N, r and p. N, which
116 These parameters configure the scrypt work factors N, r, maxmem and p.
/freebsd/secure/lib/libcrypto/man/man3/
H A DEVP_PKEY_CTX_set_scrypt_N.397 \&\fBEVP_PKEY_CTX_set_scrypt_p()\fR configure the work factors N, r and p.
101 If RAM is exceeded because the load factors are chosen too high, the
109 The work factors \fBN\fR, \fBr\fR and \fBp\fR as well as \fBmaxmem_bytes\fR can be
/freebsd/usr.bin/factor/
H A Dfactor.c78 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 Dfactor.654 and the list of factors on a single line.
55 Factors are listed in ascending order, and are preceded by a space.
/freebsd/usr.bin/primes/
H A Dprimes.h63 * 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.
/freebsd/contrib/bearssl/src/x509/
H A Dencode_rsa_rawder.c49 * 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()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDelinearization.cpp110 // 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()
/freebsd/share/doc/papers/diskperf/
H A Dconclusions.ms44 In most situations, we feel that other factors are more
48 factors.
/freebsd/share/man/man4/
H A Daibs.4137 the required resistor factors are provided by
140 in the native drivers, the resistor factors
/freebsd/sys/netinet6/
H A Dip6_id.c113 const u_int32_t pfacts[4]; /* factors of ru_n */
133 { 2, 3, 59652323, 0 }, /* factors of ru_n */
144 { 2, 3, 14563, 0 }, /* factors of ru_n */
/freebsd/contrib/bearssl/inc/
H A Dbearssl_rsa.h89 * - 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.
/freebsd/sys/contrib/device-tree/Bindings/iio/light/
H A Dus5182d.txt28 If the optional properties are not specified these factors will default to the

12345678910>>...12