Home
last modified time | relevance | path

Searched full:modulus (Results 1 – 25 of 527) sorted by relevance

12345678910>>...22

/freebsd/share/man/man5/
H A Dmoduli.549 The file consists of newline-separated records, one per modulus,
54 The time that the modulus was last processed as YYYYMMDDHHMMSS.
56 Decimal number specifying the internal structure of the prime modulus.
99 that have been performed on the modulus.
103 The recommended generator for use with this modulus (hexadecimal).
104 .It modulus
105 The modulus itself in hexadecimal.
110 first estimates the size of the modulus required to produce enough
113 then randomly selects a modulus from
/freebsd/crypto/openssh/
H A Dmoduli.548 The file consists of newline-separated records, one per modulus,
53 The time that the modulus was last processed as YYYYMMDDHHMMSS.
55 Decimal number specifying the internal structure of the prime modulus.
98 that have been performed on the modulus.
102 The recommended generator for use with this modulus (hexadecimal).
103 .It modulus
104 The modulus itself in hexadecimal.
109 first estimates the size of the modulus required to produce enough
112 then randomly selects a modulus from
/freebsd/contrib/bearssl/inc/
H A Dbearssl_rsa.h60 * - the modulus (`n`);
66 * - the modulus (`n`);
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.
109 * RSA operations. Currently, the maximum modulus size is 4096 bits,
115 * SHA-1 requires a modulus of at least 361 bits). It is up to users
122 * modulus have a size multiple of 8 or 16.
158 * The structure references the modulus and the public exponent. Both
163 /** \brief Modulus. */
165 /** \brief Modulus length (in bytes). */
[all …]
/freebsd/crypto/openssh/regress/
H A Dssh2putty.sh29 modulus=`
30 $OPENSSL_BIN rsa -noout -modulus -in $KEYFILE | grep ^Modulus= |
31 sed 's/^Modulus=/0x/' | tr A-Z a-z
35 echo "rsa2@$PORT:$HOST $public_exponent,$modulus"
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/arm/
H A Ddivmodsi4.S1 //===-- divmodsi4.S - 32-bit signed integer divide and modulus ------------===//
10 // modulus) function for the ARM architecture. A naive digit-by-digit
46 // Set aside the sign of the quotient and modulus, and the address for the
47 // modulus.
58 // Apply the sign of quotient and modulus
/freebsd/contrib/bearssl/src/int/
H A Di15_decmod.c37 * 0x00000000 value is equal to the modulus in br_i15_decode_mod()
38 * 0x00000001 value is greater than the modulus in br_i15_decode_mod()
39 * 0xFFFFFFFF value is lower than the modulus in br_i15_decode_mod()
50 * complete modulus as well. We also add 4 such extra bytes beyond in br_i15_decode_mod()
51 * the modulus length because it then guarantees that no accumulated in br_i15_decode_mod()
H A Di31_decmod.c37 * 0x00000000 value is equal to the modulus in br_i31_decode_mod()
38 * 0x00000001 value is greater than the modulus in br_i31_decode_mod()
39 * 0xFFFFFFFF value is lower than the modulus in br_i31_decode_mod()
50 * complete modulus as well. We also add 4 such extra bytes beyond in br_i31_decode_mod()
51 * the modulus length because it then guarantees that no accumulated in br_i31_decode_mod()
H A Di32_decmod.c40 * equal to the modulus), 0x00000001 (value is greater than the in br_i32_decode_mod()
41 * modulus), or 0xFFFFFFFF (value is lower than the modulus). in br_i32_decode_mod()
/freebsd/contrib/telnet/libtelnet/
H A Dpk.c120 MINT *modulus = mp_xtom(HEXMODULUS); in common_key() local
125 mp_pow(public, secret, modulus, common); in common_key()
132 mp_mfree(modulus); in common_key()
160 MINT *modulus = mp_xtom(HEXMODULUS); in genkeys() local
174 mp_mdiv(sk, modulus, tmp, sk); in genkeys()
176 mp_pow(root, sk, modulus, pk); in genkeys()
185 mp_mfree(modulus); in genkeys()
/freebsd/crypto/openssl/doc/man3/
H A DEVP_PKEY_is_a.pod82 BIGNUM *modulus = NULL;
83 if (EVP_PKEY_get_bn_param(pkey, "n", &modulus))
84 /* do whatever with the modulus */
85 BN_free(modulus);
H A DRSA_size.pod5 RSA_size, RSA_bits, RSA_security_bits - get RSA modulus size or security bits
31 RSA_size() returns the RSA modulus size in bytes. It can be used to
42 RSA_size() returns the size of modulus in bytes.
H A DRSA_generate_key.pod31 EVP_RSA_gen() generates a new RSA key pair with modulus size I<bits>.
46 The modulus size will be of length I<bits>, the number of primes to form the
47 modulus will be I<primes>, and the public exponent will be I<e>. Key sizes
52 I<primes> depends on modulus bit length:
H A DBN_mod_mul_montgomery.pod33 using the same modulus.
37 BN_MONT_CTX_set() sets up the I<mont> structure from the modulus I<m>
52 Note that I<a> must be nonnegative and smaller than the modulus.
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_pss_sig_pad.c41 * The padded string is one bit smaller than the modulus; in br_rsa_pss_sig_pad()
42 * notably, if the modulus length is equal to 1 modulo 8, then in br_rsa_pss_sig_pad()
53 * Check that the modulus is large enough for the hash value in br_rsa_pss_sig_pad()
95 * modulus. in br_rsa_pss_sig_pad()
H A Drsa_i31_pub.c47 * Get the actual length of the modulus, and see if it fits within in br_rsa_i31_public()
71 * The modulus gets decoded into m[]. in br_rsa_i31_public()
80 * Decode the modulus. in br_rsa_i31_public()
H A Drsa_i15_pub.c48 * Get the actual length of the modulus, and see if it fits within in br_rsa_i15_public()
72 * The modulus gets decoded into m[]. in br_rsa_i15_public()
87 * Decode the modulus. in br_rsa_i15_public()
H A Drsa_i62_pub.c49 * Get the actual length of the modulus, and see if it fits within in br_rsa_i62_public()
73 * The modulus gets decoded into m[]. in br_rsa_i62_public()
80 * Decode the modulus. in br_rsa_i62_public()
/freebsd/include/rpcsvc/
H A Dkey_prot.x55 * PROOT and MODULUS define the way the Diffie-Hellman key is generated.
57 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
61 * (1) (PROOT ** 2) % MODULUS != 1
62 * (2) (PROOT ** p) % MODULUS != 1
/freebsd/contrib/ntp/util/
H A Dntp-keygen.mdoc.in621 .It Fl b Fl \-imbits Ns = Ar modulus
622 Set the number of bits in the identity modulus for generating identity keys to
623 .Ar modulus
625 The number of bits in the identity modulus defaults to 256, but can be set to
726 .It Fl m Fl \-modulus Ns = Ar bits
727 Set the number of bits in the prime modulus for generating files to
729 The modulus defaults to 512, but can be set from 256 to 2048 (32 to 256 octets).
1008 identity modulus bits.
1020 The number of bits in the identity modulus. The default is 512.
1085 .It Fl m Ar modulus , F
[all...]
H A Dntp-keygen.1ntp-keygenmdoc621 .It Fl b Fl \-imbits Ns = Ar modulus
622 Set the number of bits in the identity modulus for generating identity keys to
623 .Ar modulus
625 The number of bits in the identity modulus defaults to 256, but can be set to
726 .It Fl m Fl \-modulus Ns = Ar bits
727 Set the number of bits in the prime modulus for generating files to
729 The modulus defaults to 512, but can be set from 256 to 2048 (32 to 256 octets).
1008 identity modulus bits.
1020 The number of bits in the identity modulus. The default is 512.
1085 .It Fl m Ar modulus , F
[all...]
/freebsd/contrib/bearssl/src/ec/
H A Decdsa_i31_vrfy_raw.c90 * Get modulus; then decode the r and s values. They must be in br_ecdsa_i31_vrfy_raw()
91 * lower than the modulus, and s must not be null. in br_ecdsa_i31_vrfy_raw()
121 * Truncate the hash to the modulus length (in bits) and reduce in br_ecdsa_i31_vrfy_raw()
124 * value to the modulus bit length. in br_ecdsa_i31_vrfy_raw()
H A Decdsa_i15_vrfy_raw.c91 * Get modulus; then decode the r and s values. They must be in br_ecdsa_i15_vrfy_raw()
92 * lower than the modulus, and s must not be null. in br_ecdsa_i15_vrfy_raw()
122 * Truncate the hash to the modulus length (in bits) and reduce in br_ecdsa_i15_vrfy_raw()
125 * value to the modulus bit length. in br_ecdsa_i15_vrfy_raw()
H A Dec_p256_m31.c296 * Base field modulus for P-256.
315 * will be lower than twice the modulus.
344 * the modulus; the result will fulfil the same property.
389 * twice the modulus.
406 * The modulus is: in mul_f256()
473 * modulus once. Note that if cc is negative, then propagating in mul_f256()
474 * that carry must yield a value lower than the modulus, so in mul_f256()
475 * adding the modulus once will keep the final result under in mul_f256()
476 * twice the modulus. in mul_f256()
501 * twice the modulus.
[all …]
/freebsd/contrib/wpa/src/tls/
H A Drsa.c19 struct bignum *n; /* modulus (p * q) */
81 * modulus INTEGER, -- n in crypto_rsa_import_public_key()
177 * modulus INTEGER, -- n in crypto_rsa_import_private_key()
236 * crypto_rsa_get_modulus_len - Get the modulus length of the RSA key
238 * Returns: Modulus length of the key
273 /* Too large input value for the RSA key modulus */ in crypto_rsa_exptmod()
/freebsd/crypto/openssl/apps/
H A Drsa.c77 {"modulus", OPT_MODULUS, '-', "Print the RSA key modulus"},
133 int noout = 0, modulus = 0, pubin = 0, pubout = 0, ret = 1; in rsa_main() local
201 modulus = 1; in rsa_main()
279 if (modulus) { in rsa_main()
284 BIO_printf(out, "Modulus="); in rsa_main()

12345678910>>...22