Home
last modified time | relevance | path

Searched full:modular (Results 1 – 25 of 251) sorted by relevance

1234567891011

/freebsd/sys/dev/qat/qat_api/firmware/include/
H A Dicp_qat_fw_mmp.h151 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 768-bit numbers ,
165 * Input parameter list for Diffie-Hellman Modular exponentiation for 768-bit numbers ,
180 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 1024-bit numbers ,
194 * Input parameter list for Diffie-Hellman Modular exponentiation for 1024-bit numbers ,
209 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 1536-bit numbers ,
223 * Input parameter list for Diffie-Hellman Modular exponentiation for 1536-bit numbers ,
238 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 2048-bit numbers ,
252 * Input parameter list for Diffie-Hellman Modular exponentiation for 2048-bit numbers ,
267 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 3072-bit numbers ,
281 * Input parameter list for Diffie-Hellman Modular exponentiation for 3072-bit numbers ,
[all …]
H A Dicp_qat_fw_mmp_ids.h177 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
185 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 768-bit
193 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
201 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 1024-bit
209 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
217 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 1536-bit
225 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
233 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 2048-bit
241 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
249 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 3072-bit
[all …]
/freebsd/sys/dev/qat/qat_api/include/lac/
H A Dcpa_cy_ln.h63 * Modular Exponentiation Function Operation Data.
101 * Modular Inversion Function Operation Data.
148 /**< Total number of successful large number modular exponentiation
151 /**< Total number of large number modular exponentiation requests that
154 /**< Total number of large number modular exponentiation operations
157 /**< Total number of large number modular exponentiation operations
160 /**< Total number of successful large number modular inversion
163 /**< Total number of large number modular inversion requests that
166 /**< Total number of large number modular inversion operations
169 /**< Total number of large number modular inversion operations
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/DependencyScanning/
H A DModuleDepCollector.h37 /// Modular dependency that has already been built prior to the dependency scan.
131 /// A collection of prebuilt modular dependencies this module directly depends
161 /// Callback that records textual includes and direct modular includes/imports
163 /// transitive modular dependencies and passes everything to the
190 /// Adds direct modular dependencies that have already been built to the
198 /// Traverses the previously collected direct modular dependencies to discover
199 /// transitive modular dependencies and fills the parent \c ModuleDepCollector
216 /// Collects modular and non-modular dependencies of the main file by attaching
250 /// Non-modular file dependencies. This includes the main source file and
253 /// Direct and transitive modular dependencies of the main source file.
[all …]
/freebsd/lib/libcrypt/
H A Dcrypt.372 the Modular Crypt Format
100 .It Modular
103 then the Modular Crypt Format is used, as outlined below.
173 .Ss Modular crypt:
176 then the Modular Crypt Format is used.
/freebsd/contrib/bearssl/src/ec/
H A Decdsa_i31_vrfy_raw.c39 * order. This is needed so that modular reduction of the X in br_ecdsa_i31_vrfy_raw()
107 * Invert s. We do that with a modular exponentiation; we use in br_ecdsa_i31_vrfy_raw()
122 * it modulo the curve order. The modular reduction can be done in br_ecdsa_i31_vrfy_raw()
154 * The modular reduction can be done with subtractions because in br_ecdsa_i31_vrfy_raw()
H A Decdsa_i15_vrfy_raw.c39 * order. This is needed so that modular reduction of the X in br_ecdsa_i15_vrfy_raw()
108 * Invert s. We do that with a modular exponentiation; we use in br_ecdsa_i15_vrfy_raw()
123 * it modulo the curve order. The modular reduction can be done in br_ecdsa_i15_vrfy_raw()
155 * The modular reduction can be done with subtractions because in br_ecdsa_i15_vrfy_raw()
H A Decdsa_i15_sign_raw.c39 * order. This is needed so that modular reduction of the X in br_ecdsa_i15_sign_raw()
114 * the hash value (after truncation and modular reduction). in br_ecdsa_i15_sign_raw()
146 * then using a modular exponentiation. in br_ecdsa_i15_sign_raw()
H A Decdsa_i31_sign_raw.c39 * order. This is needed so that modular reduction of the X in br_ecdsa_i31_sign_raw()
113 * the hash value (after truncation and modular reduction). in br_ecdsa_i31_sign_raw()
145 * then using a modular exponentiation. in br_ecdsa_i31_sign_raw()
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_i31_pub.c29 * modular integer.
73 * The temporaries for modular exponentiation are in t[]. in br_rsa_i31_public()
97 * Compute the modular exponentiation. in br_rsa_i31_public()
H A Drsa_i15_pub.c29 * modular integer.
74 * The temporaries for modular exponentiations are in t[]. in br_rsa_i15_public()
104 * Compute the modular exponentiation. in br_rsa_i15_public()
H A Drsa_i62_pub.c31 * modular integer. But TLEN is expressed in 64-bit words.
97 * Compute the modular exponentiation. in br_rsa_i62_public()
/freebsd/crypto/openssl/crypto/ec/
H A Decp_sm2p256.c72 /* Modular div by 2: r = a / 2 mod p */
74 /* Modular div by 2: r = a / 2 mod n, where n = ord(p) */
76 /* Modular add: r = a + b mod p */
78 /* Modular sub: r = a - b mod p */
80 /* Modular sub: r = a - b mod n, where n = ord(p) */
82 /* Modular mul by 3: out = 3 * a mod p */
84 /* Modular mul: r = a * b mod p */
86 /* Modular sqr: r = a ^ 2 mod p */
170 /* Modular inverse |out| = |in|^(-1) mod |p|. */
/freebsd/sys/contrib/device-tree/Bindings/misc/
H A Dxlnx,tmr-inject.yaml7 title: Xilinx Triple Modular Redundancy(TMR) Inject IP
13 The Triple Modular Redundancy(TMR) Inject core provides functional fault
H A Dxlnx,tmr-manager.yaml7 title: Xilinx Triple Modular Redundancy(TMR) Manager IP
13 The Triple Modular Redundancy(TMR) Manager is responsible for handling the
/freebsd/sys/contrib/device-tree/Bindings/arm/
H A Dmicrochip,sparx5.yaml27 - description: The Sparx5 pcb125 board is a modular board,
28 which has both spi-nor and eMMC storage. The modular design
/freebsd/share/man/man4/
H A Dmod_cc.435 .Nd Modular congestion control
37 The modular congestion control framework allows the TCP implementation to
183 modular congestion control framework first appeared in
H A Dciss.4166 HP Modular Smart Array 20 (MSA20)
168 HP Modular Smart Array 500 (MSA500)
/freebsd/crypto/libecc/src/nn/
H A Dnn_mod_pow.c26 * Implements a left to right Montgomery Ladder for modular exponentiation.
73 /* Modular reduction */ in _nn_exp_monty_ladder_ltr()
313 * for odd numbers. We fallback to less efficient regular modular exponentiation. in nn_mod_pow()
317 /* mod is even: use the regular unoptimized modular exponentiation */ in nn_mod_pow()
/freebsd/crypto/libecc/src/fp/
H A Dfp_mul.c61 * x^(p-1) = 1 mod (p) means that x^(p-2) mod(p) is the modular
68 /* Use our lower layer Fermat modular inversion with precomputed in fp_inv()
/freebsd/sys/dev/hifn/
H A Dhifn7751reg.h362 #define HIFN_PUBOP_OP_MODADD 0x00140000 /* Modular ADD */
363 #define HIFN_PUBOP_OP_MODSUB 0x00180000 /* Modular SUB */
367 #define HIFN_PUBOP_OP_MODMULT 0x00280000 /* Modular MULT */
368 #define HIFN_PUBOP_OP_MODRED 0x002c0000 /* Modular Red */
369 #define HIFN_PUBOP_OP_MODEXP 0x00300000 /* Modular Exp */
/freebsd/secure/lib/libcrypto/man/man3/
H A DBN_add.3151 \&\fBBN_mod_sqrt()\fR returns the modular square root of \fIa\fR such that
177 For modular operations such as \fBBN_nnmod()\fR or \fBBN_mod_exp()\fR it is an error
/freebsd/contrib/bearssl/src/
H A Dinner.h750 * overflow (including raising some signal): with GCC, while modular
1092 * values. For modular integers, the announced bit length of any integer
1094 * on modular integers are "constant-time" (only the modulus length may
1247 * Convert a modular integer to Montgomery representation. The integer x[]
1253 * Convert a modular integer back from Montgomery representation. The
1262 * Compute a modular Montgomery multiplication. d[] is filled with the
1274 * Compute a modular exponentiation. x[] MUST be an integer modulo m[]
1310 * values. For modular integers, the announced bit length of any integer
1312 * on modular integers are "constant-time" (only the modulus length may
1443 * Compute a modular Montgomery multiplication. d[] is filled with the
[all …]
/freebsd/contrib/llvm-project/lld/
H A DREADME.md5 modular cross platform linker which is built as part of the LLVM compiler
/freebsd/crypto/openssl/crypto/bn/
H A Drsaz_exp_x2.c164 * Dual Montgomery modular exponentiation using prime moduli of the
179 * [out] res|i| - result of modular exponentiation: array of qword values
318 * Dual {1024,1536,2048}-bit w-ary modular exponentiation using prime moduli of
324 * [out] res - result of modular exponentiation: 2x{20,30,40} qword
544 * [1] Gueron, S. Efficient software implementations of modular exponentiation.

1234567891011