Home
last modified time | relevance | path

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

12345678910>>...43

/freebsd/crypto/openssl/crypto/rsa/
H A Drsa_backend.c68 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL; in ossl_rsa_fromdata()
91 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params, in ossl_rsa_fromdata()
100 if (sk_BIGNUM_num(factors) != 0 in ossl_rsa_fromdata()
101 && !ossl_rsa_set0_all_params(rsa, factors, exps, coeffs)) in ossl_rsa_fromdata()
106 sk_BIGNUM_free(factors); in ossl_rsa_fromdata()
115 sk_BIGNUM_pop_free(factors, BN_free); in ossl_rsa_fromdata()
128 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null(); in DEFINE_SPECIAL_STACK_OF_CONST()
132 if (rsa == NULL || factors == NULL || exps == NULL || coeffs == NULL) in DEFINE_SPECIAL_STACK_OF_CONST()
136 ossl_rsa_get0_all_params(rsa, factors, exps, coeffs); in DEFINE_SPECIAL_STACK_OF_CONST()
149 factors) in DEFINE_SPECIAL_STACK_OF_CONST()
[all …]
H A Drsa_mp_names.c20 * A fixed table of names for the RSA prime factors starting with
/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/secure/lib/libcrypto/man/man7/
H A DEVP_PKEY-RSA.772 . \" fudge factors for nroff and troff
147 factors, exponents and coefficient for \s-1CRT\s0 calculations, of which the first
201 \&\s-1RSA\s0 prime factors. The factors are known as \*(L"p\*(R", \*(L"q\*(R" and \*(L"r_i\*(R" in …
202 Up to eight additional \*(L"r_i\*(R" prime factors are supported.
321 These 4 fields are normally randomly generated. The prime factors \*(L"p1\*(R", \*(L"p2\*(R",
H A DEVP_KDF-SCRYPT.772 . \" fudge factors for nroff and troff
153 scrypt provides three work factors that can be customized: N, r and p. N, which
198 These parameters configure the scrypt work factors N, r, maxmem and p.
/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/secure/lib/libcrypto/man/man3/
H A DEVP_PKEY_CTX_set_scrypt_N.372 . \" fudge factors for nroff and troff
173 \&\fBEVP_PKEY_CTX_set_scrypt_p()\fR configure the work factors N, r and p.
177 If \s-1RAM\s0 is exceeded because the load factors are chosen too high, the
185 The work factors \fBN\fR, \fBr\fR and \fBp\fR as well as \fBmaxmem_bytes\fR can be
H A DEVP_KDF.372 . \" fudge factors for nroff and troff
383 memory that depends on the load factors provided as input.
387 If this memory usage limit is exceeded because the load factors are chosen
H A DOSSL_PARAM_BLD.372 . \" fudge factors for nroff and troff
262 \& BIGNUM *p, *q; /* first two prime factors */
/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.
160 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/crypto/openssl/providers/implementations/encode_decode/
H A Dencode_key2text.c636 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text()
648 factors = sk_BIGNUM_const_new_null(); in rsa_to_text()
652 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text()
668 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text()
669 primes = sk_BIGNUM_const_num(factors); in rsa_to_text()
691 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text()
694 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text()
705 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text()
709 sk_BIGNUM_const_value(factors, i))) in rsa_to_text()
775 sk_BIGNUM_const_free(factors); in rsa_to_text()
/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
/freebsd/contrib/bearssl/test/
H A Dtest_math.c407 * lengths of both factors can be arbitrary modulo 2^32. Factors
411 * To keep computation time reasonable, we use p and q factors of
/freebsd/contrib/ntp/conf/
H A Drackety.conf9 # sender is blocked. Note that the precise fudge factors were

12345678910>>...43