/freebsd/crypto/openssl/crypto/rsa/ |
H A D | rsa_backend.c | 68 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 …]
|
/freebsd/crypto/openssl/providers/implementations/encode_decode/ |
H A D | encode_key2text.c | 635 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text() 647 factors = sk_BIGNUM_const_new_null(); in rsa_to_text() 651 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text() 667 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text() 668 primes = sk_BIGNUM_const_num(factors); in rsa_to_text() 690 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text() 693 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text() 704 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text() 708 sk_BIGNUM_const_value(factors, i))) in rsa_to_text() 774 sk_BIGNUM_const_free(factors); in rsa_to_text()
|
/freebsd/crypto/openssl/util/perl/OpenSSL/ |
H A D | config.pm | 344 my @factors = (100, 1); 345 while (@numbers && @factors) { 346 $CCVER += shift(@numbers) * shift(@factors) 393 my @factors = (100, 1); 395 while (@numbers && @factors) { 396 $v += shift(@numbers) * shift(@factors)
|
/freebsd/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
|
H A D | EVP_KDF.pod | 251 memory that depends on the load factors provided as input. 255 If this memory usage limit is exceeded because the load factors are chosen
|
H A D | OSSL_PARAM_BLD.pod | 140 BIGNUM *p, *q; /* first two prime factors */
|
H A D | SSL_CTX_set_tlsext_servername_callback.pod | 70 The behaviour of SSL_get_servername() depends on a number of different factors.
|
H A D | SSL_CTX_set_split_send_fragment.pod | 108 value depends on a number of factors but it will be at least
|
H A D | RSA_get0_key.pod | 63 B<dmq1> and B<iqmp> are the factors for the second representation of a
|
/freebsd/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. 160 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.
|
/freebsd/usr.bin/dc/ |
H A D | bcode.c | 326 static unsigned long factors[] = { variable 342 if (abs_scale < sizeof(factors)/sizeof(factors[0])) { in scale_number() 344 bn_check(BN_mul_word(n, factors[abs_scale])); in scale_number() 346 BN_div_word(n, factors[abs_scale]); in scale_number() 380 else if (n->scale < sizeof(factors)/sizeof(factors[0])) { in split_number() 381 rem = BN_div_word(i, factors[n->scale]); in split_number()
|
/freebsd/sys/contrib/device-tree/Bindings/iio/light/ |
H A D | us5182d.txt | 28 If the optional properties are not specified these factors will default to the
|
/freebsd/sys/contrib/device-tree/Bindings/soc/mediatek/ |
H A D | mtk-svs.yaml | 18 chip process corner, temperatures and other factors. Then DVFS
|
/freebsd/sys/contrib/device-tree/Bindings/power/avs/ |
H A D | qcom,cpr.txt | 6 running at a particular frequency, CPR monitors dynamic factors such as
|
H A D | qcom,cpr.yaml | 16 running at a particular frequency, CPR monitors dynamic factors such as
|
/freebsd/sys/contrib/device-tree/Bindings/mtd/ |
H A D | gpmc-nand.txt | 109 on various other factors also like;
|
/freebsd/sys/contrib/device-tree/Bindings/iio/ |
H A D | mount-matrix.txt | 203 ???: this does not match "180 degrees" - factors indicate ca. 3 degrees compensation
|
/freebsd/crypto/openssl/crypto/evp/ |
H A D | ctrl_params_translate.c | 1843 const BIGNUM *factors[10]; in get_rsa_payload_factor() local 1846 && RSA_get0_multi_prime_factors(r, factors)) in get_rsa_payload_factor() 1847 bn = factors[factornum - 2]; in get_rsa_payload_factor()
|
/freebsd/ |
H A D | CONTRIBUTING.md | 17 The preferred method depends on a few factors including the size or scope of
|
/freebsd/crypto/openssl/crypto/bn/ |
H A D | README.pod | 180 factors have the same size: bn_mul_comba8() is used if they are 8
|
/freebsd/contrib/llvm-project/llvm/lib/Support/Windows/ |
H A D | Program.inc | 566 // of getting invalid command line due to unaccounted factors.
|
/freebsd/contrib/ntp/ntpd/ |
H A D | ntpd-opts.def | 351 compute server-client propagation delay correction factors and
|
/freebsd/contrib/ntp/ntpdc/ |
H A D | ntpdc-opts.def | 395 values obtained provide information on the setting of fudge factors
|
/freebsd/contrib/one-true-awk/testdir/ |
H A D | funstack.in | 5837 title = "Maximum computing power and cost factors in the centralization problem", 5850 …keywords = "centralisation; computer management; cost factors; decentralisation; economics; ec… 5889 …descriptors = "Fortran; graphics; iterative method; application; method; human factors; diagram m… 7124 keywords = "aesthetics; human factor; human factors; programming", 12760 …descriptors = "FORTRAN; graphics; application; method; human factors; hidden line algorithm; cont… 14300 …descriptors = "FORTRAN; graphics; application; method; human factors; diagram manipulation; three… 15731 …abstract = "A recursive algorithm for computing the inverse of a matrix from the LU factors ba… 17064 …g Theory; probability density function; queueing theory; scheduling; storage; utilization factors", 18386 …hing; information; information retrieval systems --- Evaluation; loading factors; record addressin… 20248 …n). The algorithms are shown to be optimal in time within small constant factors. Extensions to hi… [all …]
|