| /third_party/boost/libs/multiprecision/performance/ |
| D | miller_rabin_performance.log | 2 Number of primes found = 9
4 Number of primes found = 9
6 Number of primes found = 9
8 Number of primes found = 9
10 Number of primes found = 9
12 Number of primes found = 9
14 Number of primes found = 9
16 Number of primes found = 9
18 Number of primes found = 9
20 Number of primes found = 9
[all …]
|
| /third_party/openssl/crypto/bn/ |
| D | bn_prime.pl | 28 my @primes = ( 2 );
30 loop: while ($#primes < $num-1) {
34 for (my $i = 0; defined($primes[$i]) && $primes[$i] <= $s; $i++) {
35 next loop if ($p % $primes[$i]) == 0;
37 push(@primes, $p);
44 for (my $i = 0; $i <= $#primes; $i++) {
46 printf " %5d,", $primes[$i];
|
| D | bn_prime.c | 174 BN_ULONG mod = BN_mod_word(a, primes[i]); in BN_is_prime_fasttest_ex()
178 return BN_is_word(a, primes[i]); in BN_is_prime_fasttest_ex()
276 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
286 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime()
302 && square(primes[i]) > BN_get_word(rnd) + delta) in probable_prime()
304 if (safe ? (mods[i] + delta) % primes[i] <= 1 in probable_prime()
305 : (mods[i] + delta) % primes[i] == 0) { in probable_prime()
327 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime_dh()
362 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime_dh()
372 && square(primes[i]) > BN_get_word(rnd) + delta) in probable_prime_dh()
[all …]
|
| D | bn_prime.h | 16 static const prime_t primes[2048] = { variable
|
| /third_party/openssl/crypto/rsa/ |
| D | rsa_gen.c | 22 static int rsa_builtin_keygen(RSA *rsa, int bits, int primes, BIGNUM *e_value,
41 int RSA_generate_multi_prime_key(RSA *rsa, int bits, int primes, in RSA_generate_multi_prime_key() argument
46 return rsa->meth->rsa_multi_prime_keygen(rsa, bits, primes, in RSA_generate_multi_prime_key()
55 if (primes == 2) in RSA_generate_multi_prime_key()
61 return rsa_builtin_keygen(rsa, bits, primes, e_value, cb); in RSA_generate_multi_prime_key()
64 static int rsa_builtin_keygen(RSA *rsa, int bits, int primes, BIGNUM *e_value, in rsa_builtin_keygen() argument
82 if (primes < RSA_DEFAULT_PRIME_NUM || primes > rsa_multip_cap(bits)) { in rsa_builtin_keygen()
99 quo = bits / primes; in rsa_builtin_keygen()
100 rmd = bits % primes; in rsa_builtin_keygen()
102 for (i = 0; i < primes; i++) in rsa_builtin_keygen()
[all …]
|
| D | rsa_lib.c | 263 int RSA_set0_multi_prime_params(RSA *r, BIGNUM *primes[], BIGNUM *exps[], in RSA_set0_multi_prime_params() argument
270 if (primes == NULL || exps == NULL || coeffs == NULL || pnum == 0) in RSA_set0_multi_prime_params()
284 if (primes[i] != NULL && exps[i] != NULL && coeffs[i] != NULL) { in RSA_set0_multi_prime_params()
288 pinfo->r = primes[i]; in RSA_set0_multi_prime_params()
356 int RSA_get0_multi_prime_factors(const RSA *r, const BIGNUM *primes[]) in RSA_get0_multi_prime_factors() argument
370 primes[i] = pinfo->r; in RSA_get0_multi_prime_factors()
|
| /third_party/openssl/test/recipes/ |
| D | 15-test_mp_rsa.t | 29 primes => '3',
34 primes => '4',
39 primes => '5',
53 my $primes = $param->{primes};
55 my $name = ($evp ? "evp" : "") . "${bits}p${primes}";
59 '-algorithm', 'RSA', '-pkeyopt', "rsa_keygen_primes:$primes",
63 '-primes', $primes, $bits])), "genrsa $name");
|
| /third_party/boost/libs/math/test/ |
| D | test_difference.cpp | 103 static const int primes[] = { in test_values() local
115 for(unsigned i = 0; i < sizeof(primes) / sizeof(primes[0]); ++i) in test_values()
117 for(unsigned j = 0; j < sizeof(primes) / sizeof(primes[0]); ++j) in test_values()
119 test_value(T(primes[i]) / T(primes[j]), name); in test_values()
120 test_value(-T(primes[i]) / T(primes[j]), name); in test_values()
|
| D | test_next_decimal.cpp | 153 static const int primes[] = { in test_values() local
165 for(unsigned i = 0; i < sizeof(primes)/sizeof(primes[0]); ++i) in test_values()
169 for(int j = 0; j < primes[i]; ++j) in test_values()
174 BOOST_CHECK_EQUAL(boost::math::float_distance(v1, val), -primes[i]); in test_values()
175 BOOST_CHECK_EQUAL(boost::math::float_distance(v2, val), primes[i]); in test_values()
176 BOOST_CHECK_EQUAL(boost::math::float_advance(val, primes[i]), v1); in test_values()
177 BOOST_CHECK_EQUAL(boost::math::float_advance(val, -primes[i]), v2); in test_values()
|
| D | test_next.cpp | 148 static const int primes[] = { in test_values() local
160 for(unsigned i = 0; i < sizeof(primes)/sizeof(primes[0]); ++i) in test_values()
164 for(int j = 0; j < primes[i]; ++j) in test_values()
169 BOOST_CHECK_EQUAL(boost::math::float_distance(v1, val), -primes[i]); in test_values()
170 BOOST_CHECK_EQUAL(boost::math::float_distance(v2, val), primes[i]); in test_values()
171 BOOST_CHECK_EQUAL(boost::math::float_advance(val, primes[i]), v1); in test_values()
172 BOOST_CHECK_EQUAL(boost::math::float_advance(val, -primes[i]), v2); in test_values()
|
| /third_party/boost/libs/python/test/ |
| D | iterator.cpp | 55 int primes[] = { 2, 3, 5, 7, 11, 13 }; in two_lists() local
56 std::copy(primes, primes + sizeof(primes)/sizeof(*primes), std::back_inserter(one)); in two_lists()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 77 if (pIndex < primes.length - 1) { in rehash()
78 arraySize = primes[++pIndex]; in rehash()
111 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
118 private int arraySize = primes[pIndex];
|
| /third_party/grpc/examples/python/multiprocessing/ |
| D | client.py | 72 primes = zip(check_range, map(operator.attrgetter('isPrime'), primality))
73 return tuple(primes)
83 primes = _calculate_primes(args.server_address)
84 print(primes)
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
| D | CalendarCache.java | 79 if (pIndex < primes.length - 1) { in rehash()
80 arraySize = primes[++pIndex]; in rehash()
113 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
120 private int arraySize = primes[pIndex];
|
| /third_party/boost/libs/mpl/test/ |
| D | transform.cpp | 41 typedef list_c<long,2,3,5,7,11,13> primes; in MPL_TEST_CASE() typedef
44 typedef transform2< evens, primes, plus<> >::type result; in MPL_TEST_CASE()
48 typedef transform< evens, primes, plus<> >::type result2; in MPL_TEST_CASE()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/examples/ |
| D | primes.cpp | 65 std::vector<int> primes; in main() local
68 primes.push_back(i); in main()
78 for (auto prime : primes) { in main()
|
| D | BUILD.bazel | 36 name = "primes",
38 "primes.cpp",
|
| /third_party/openssl/doc/man3/ |
| D | RSA_generate_key.pod | 13 int RSA_generate_multi_prime_key(RSA *rsa, int bits, int primes, BIGNUM *e, BN_GENCB *cb);
29 it in the B<RSA> structure provided in B<rsa>. The number of primes is given by
30 the B<primes> parameter. The random number generator must be seeded when
35 The modulus size will be of length B<bits>, the number of primes to form the
36 modulus will be B<primes>, and the public exponent will be B<e>. Key sizes
41 B<primes> depends on modulus bit length:
75 The process is then repeated for prime q and other primes (if any)
|
| D | RSA_get0_key.pod | 42 int RSA_get0_multi_prime_factors(const RSA *r, const BIGNUM *primes[]);
45 int RSA_set0_multi_prime_params(RSA *r, BIGNUM *primes[], BIGNUM *exps[],
92 can be used to obtain other primes and related CRT parameters. The
145 RSA_get_multi_prime_extra_count() returns two less than the number of primes
146 in use, which is 0 for traditional RSA and the number of extra primes for
|
| /third_party/openssl/apps/ |
| D | genrsa.c | 64 int ret = 1, num = DEFBITS, private = 0, primes = DEFPRIMES; in genrsa_main() local
111 if (!opt_int(opt_arg(), &primes)) in genrsa_main()
143 num, primes); in genrsa_main()
149 || !RSA_generate_multi_prime_key(rsa, num, primes, bn, cb)) in genrsa_main()
|
| /third_party/openssl/include/openssl/ |
| D | rsa.h | 129 # define EVP_PKEY_CTX_set_rsa_keygen_primes(ctx, primes) \ argument
131 EVP_PKEY_CTRL_RSA_KEYGEN_PRIMES, primes, NULL)
207 int RSA_set0_multi_prime_params(RSA *r, BIGNUM *primes[], BIGNUM *exps[],
213 int RSA_get0_multi_prime_factors(const RSA *r, const BIGNUM *primes[]);
242 int RSA_generate_multi_prime_key(RSA *rsa, int bits, int primes,
503 (RSA *rsa, int bits, int primes, BIGNUM *e, BN_GENCB *cb);
506 int primes, BIGNUM *e,
|
| /third_party/openssl/doc/man1/ |
| D | genrsa.pod | 31 [B<-primes num>]
87 =item B<-primes num>
89 Specify the number of primes to use while generating the RSA key. The B<num>
112 may vary somewhat. But in general, more primes lead to less generation time
|
| /third_party/mbedtls/library/ |
| D | rsa_alt_helpers.c | 76 const unsigned char primes[] = { 2, in mbedtls_rsa_deduce_primes() local
86 const size_t num_primes = sizeof( primes ) / sizeof( *primes ); in mbedtls_rsa_deduce_primes()
131 mbedtls_mpi_lset( &K, primes[attempt] ); in mbedtls_rsa_deduce_primes()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/kokoro/ubuntu/ |
| D | docker.sh | 116 ./primes > /dev/null
175 bazel run //examples:primes > /dev/null
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/kokoro/macos/ |
| D | build.sh | 96 ./primes > /dev/null
160 "${BAZEL}" run //examples:primes > /dev/null
|