Home
last modified time | relevance | path

Searched refs:prime (Results 1 – 25 of 47) sorted by relevance

12

/openssl/doc/man1/
H A Dopenssl-prime.pod.in6 openssl-prime - compute prime numbers
10 B<openssl prime>
22 This command checks if the specified numbers are prime.
42 Generate a prime number.
46 Generate a prime with I<num> bits.
50 When used with B<-generate>, generates a "safe" prime. If the number
51 generated is I<n>, then check that C<(I<n>-1)/2> is also prime.
H A Dopenssl-genrsa.pod.in75 If I<num> is greater than 2, then the generated key is called a 'multi-prime'
107 prime numbers. When generating a private key various symbols will be output to
110 round of the Miller-Rabin primality test, B<*> means the current prime starts
112 has passed all the prime tests (the actual number depends on the key size).
H A Dopenssl-cmds.pod.in39 prime,
120 L<openssl-prime(1)>,
H A Dopenssl-dhparam.pod.in34 a key using a named safe prime group without generating intermediate
66 that (p-1)/2 is also prime) will be used for DH parameter generation.
H A Dopenssl-genpkey.pod.in227 The number of bits in the generated prime. If not specified 2048 is used.
307 The number of bits in the prime parameter I<p>. The default is 2048.
313 The number of bits in the sub prime parameter I<q>. The default is 224.
332 Use a safe prime generator with the option B<safeprime_generator>
437 Generate 4096 bit DH Key using safe prime group ffdhe4096:
449 Output DH parameters for safe prime group ffdhe2048:
H A Dbuild.info39 DEPEND[openssl-prime.pod]=../perlvars.pm
/openssl/doc/man7/
H A DEVP_PKEY-DH.pod12 approved named safe-prime groups, and a class of "FIPS186-type" domain
15 approved safe-prime groups.
110 A safe prime generator. See the "safeprime-generator" type above.
117 Sets the size (in bits) of the prime 'p'.
142 B<DH> parameters with named safe prime group instead.
152 test the I<p> value for being a prime (and a safe prime if I<q> is missing)
154 the prime tests.
161 prime group, otherwise it is the same as L<EVP_PKEY_public_check(3)>.
289 =item RFC 7919 (TLS ffdhe named safe prime groups)
291 =item RFC 3526 (IKE modp named safe prime groups)
[all …]
H A DEVP_PKEY-FFC.pod57 A DSA or Diffie-Hellman prime "p" value.
71 A DSA or Diffie-Hellman prime "q" value.
151 Sets the size (in bits) of the prime 'p'.
155 Sets the size (in bits) of the prime 'q'.
H A DEVP_PKEY-RSA.pod12 the public exponent I<e>, the private exponent I<d>, and a collection of prime
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_PKEY-EC.pod33 The value should be either "prime-field" or "characteristic-two-field",
34 which correspond to prime field Fp and binary field F2^m.
38 For a curve over Fp I<p> is the prime for the field. For a curve over F2^m I<p>
/openssl/doc/man3/
H A DBN_generate_prime.pod63 BN_generate_prime_ex2() generates a pseudo-random prime number of
67 The returned number is probably prime with a negligible error.
69 It's 2^-287 for a 512 bit prime, 2^-435 for a 1024 bit prime,
70 2^-648 for a 2048 bit prime, and lower than 2^-882 for primes larger
73 If B<add> is B<NULL> the returned prime number will have exact bit
85 potential prime number.
94 When a prime has been found, B<BN_GENCB_call(cb, 2, i)> is called.
103 The prime may have to fulfill additional requirements for use in
110 If B<safe> is true, it will be a safe prime (i.e. a prime p so
127 and BN_is_prime_fasttest() test if the number B<p> is prime.
[all …]
H A DDH_generate_parameters.pod49 B<prime_len> is the length in bits of the safe prime to be generated.
54 called as described in L<BN_generate_prime(3)> while a random prime
55 number is generated, and when a prime has been found, B<BN_GENCB_call(cb, 3, 0)>
75 The parameter B<p> has been determined to not being an odd prime.
77 prime.
83 suitable, unless B<p> is known to be a strong prime.
103 The parameter B<p> is not prime.
107 The parameter B<p> is not a safe prime and no B<q> value is present.
119 The parameter B<q> is not prime.
H A DRSA_generate_key.pod37 RSA_generate_key_ex() generates a 2-prime RSA key pair and stores it in the
40 RSA_generate_multi_prime_key() generates a multi-prime RSA key pair and stores
71 While a random prime number is generated, it is called as
76 When the n-th randomly generated prime is rejected as not
81 When a random p has been found with p-1 relatively prime to I<e>,
86 The process is then repeated for prime q and other primes (if any)
87 with I<BN_GENCB_call(cb, 3, i)> where I<i> indicates the i-th prime.
H A DRSA_get0_key.pod68 For multi-prime RSA (defined in RFC 8017), there are also one or more
70 and B<t>. B<r> is the additional prime besides B<p> and B<q>. B<d> and
99 For multi-prime RSA, RSA_get0_multi_prime_factors() and RSA_get0_multi_prime_params()
102 sets a collect of multi-prime 'triplet' members (prime, exponent and coefficient)
138 RSA_set0_multi_prime_params() always clears the original multi-prime
158 multi-prime RSA.
160 RSA_get_version() returns B<RSA_ASN1_VERSION_MULTI> for multi-prime RSA and
161 B<RSA_ASN1_VERSION_DEFAULT> for normal two-prime RSA, as defined in RFC 8017.
H A DDH_size.pod5 DH_size, DH_bits, DH_security_bits - get Diffie-Hellman prime size and
32 DH_size() returns the Diffie-Hellman prime size in bytes. It can be used
44 DH_size() returns the prime size of Diffie-Hellman in bytes, or -1 if
H A DDSA_generate_parameters.pod37 B<bits> is the length of the prime p to be generated.
71 (once for each witness that confirms that the candidate may be prime);
76 When a prime q has been found, B<BN_GENCB_call(cb, 2, 0)> and
90 (once for each witness that confirms that the candidate may be prime).
H A DDH_get0_pqg.pod63 optionally I<q> are associated with known safe prime groups. If it is a safe
64 prime group then the value of I<q> will be set to q = (p - 1) / 2 if I<q> is
102 length of the secret exponent (private key) in bits. For safe prime groups the optional length para…
H A DEVP_PKEY_get_field_type.pod20 for prime curves or B<NID_X9_62_characteristic_two_field> for binary curves;
H A DDH_new_by_nid.pod28 any named safe prime group. It returns the NID corresponding to the matching
H A DDH_get_1024_160.pod64 a BIGNUM for the specific NIST prime curve (e.g., P-256).
H A DEC_GROUP_new.pod80 The first form is those defined over the prime field Fp. The elements of Fp are
81 the integers 0 to p-1, where p is a prime number. This gives us a revised
129 over Fp I<p> is the prime for the field. For a curve over F2^m I<p> represents
H A DBN_add.pod94 prime, otherwise an error or an incorrect "result" will be returned.
125 not a prime), or NULL.
/openssl/crypto/rsa/
H A Drsa_gen.c261 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *tmp2, *prime; in rsa_multiprime_keygen() local
370 prime = rsa->p; in rsa_multiprime_keygen()
372 prime = rsa->q; in rsa_multiprime_keygen()
375 prime = pinfo->r; in rsa_multiprime_keygen()
377 BN_set_flags(prime, BN_FLG_CONSTTIME); in rsa_multiprime_keygen()
381 if (!BN_generate_prime_ex2(prime, bitsr[i] + adj, 0, NULL, NULL, in rsa_multiprime_keygen()
402 if (!BN_cmp(prime, prev_prime)) { in rsa_multiprime_keygen()
407 if (!BN_sub(r2, prime, BN_value_one())) in rsa_multiprime_keygen()
436 if (!BN_mul(r1, rsa->n, prime, ctx)) in rsa_multiprime_keygen()
442 tmp = BN_dup(prime); in rsa_multiprime_keygen()
[all …]
/openssl/doc/internal/man3/
H A Dossl_rsa_get0_all_params.pod40 if the B<RSA> object is a multi-prime RSA key.
45 if the B<RSA> object is a multi-prime RSA key.
50 if the B<RSA> object is a multi-prime RSA key.
/openssl/crypto/ec/
H A Dec_asn1.c55 ASN1_INTEGER *prime; member
131 ADB_ENTRY(NID_X9_62_prime_field, ASN1_SIMPLE(X9_62_FIELDID, p.prime, ASN1_INTEGER)),
218 field->p.prime = BN_to_ASN1_INTEGER(tmp, NULL); in ec_asn1_group2fieldid()
219 if (field->p.prime == NULL) { in ec_asn1_group2fieldid()
653 if (params->fieldID->p.prime == NULL) { in EC_GROUP_new_from_ecparameters()
657 p = ASN1_INTEGER_to_BN(params->fieldID->p.prime, NULL); in EC_GROUP_new_from_ecparameters()

Completed in 43 milliseconds

12