| /freebsd/sys/dev/qat/qat_api/firmware/include/ |
| H A D | icp_qat_fw_mmp.h | 153 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 768-bit numbers ,
167 * Input parameter list for Diffie-Hellman Modular exponentiation for 768-bit numbers ,
182 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 1024-bit numbers ,
196 * Input parameter list for Diffie-Hellman Modular exponentiation for 1024-bit numbers ,
211 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 1536-bit numbers ,
225 * Input parameter list for Diffie-Hellman Modular exponentiation for 1536-bit numbers ,
240 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 2048-bit numbers ,
254 * Input parameter list for Diffie-Hellman Modular exponentiation for 2048-bit numbers ,
269 * Input parameter list for Diffie-Hellman Modular exponentiation base 2 for 3072-bit numbers ,
283 * Input parameter list for Diffie-Hellman Modular exponentiation for 3072-bit numbers ,
[all …]
|
| H A D | icp_qat_fw_mmp_ids.h | 178 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
186 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 768-bit
194 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
202 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 1024-bit
210 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
218 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 1536-bit
226 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
234 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 2048-bit
242 /**< Functionality ID for Diffie-Hellman Modular exponentiation base 2 for
250 /**< Functionality ID for Diffie-Hellman Modular exponentiation for 3072-bit
[all …]
|
| /freebsd/sys/dev/qat/qat_api/include/lac/ |
| H A D | cpa_cy_ln.h | 96 * Modular Exponentiation Function Operation Data.
134 * Modular Inversion Function Operation Data.
181 /**< Total number of successful large number modular exponentiation
184 /**< Total number of large number modular exponentiation requests that
187 /**< Total number of large number modular exponentiation operations
190 /**< Total number of large number modular exponentiation operations
193 /**< Total number of successful large number modular inversion
196 /**< Total number of large number modular inversion requests that
199 /**< Total number of large number modular inversion operations
202 /**< Total number of large number modular inversion operations
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/DependencyScanning/ |
| H A D | ModuleDepCollector.h | 37 /// 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 D | crypt.3 | 72 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 D | ecdsa_i31_vrfy_raw.c | 39 * 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 D | ecdsa_i15_vrfy_raw.c | 39 * 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 D | ecdsa_i15_sign_raw.c | 39 * 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 D | ecdsa_i31_sign_raw.c | 39 * 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 D | rsa_i31_pub.c | 29 * 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 D | rsa_i15_pub.c | 29 * 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 D | rsa_i62_pub.c | 31 * modular integer. But TLEN is expressed in 64-bit words.
97 * Compute the modular exponentiation. in br_rsa_i62_public()
|
| /freebsd/sys/contrib/device-tree/Bindings/misc/ |
| H A D | xlnx,tmr-inject.yaml | 7 title: Xilinx Triple Modular Redundancy(TMR) Inject IP
13 The Triple Modular Redundancy(TMR) Inject core provides functional fault
|
| H A D | xlnx,tmr-manager.yaml | 7 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 D | microchip,sparx5.yaml | 27 - 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 D | mod_cc.4 | 35 .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 D | ciss.4 | 166 HP Modular Smart Array 20 (MSA20)
168 HP Modular Smart Array 500 (MSA500)
|
| /freebsd/crypto/openssl/crypto/bn/ |
| H A D | rsaz_exp_x2.c | 91 * Dual Montgomery modular exponentiation using prime moduli of the
103 * [out] res|i| - result of modular exponentiation: array of qword values
239 * Dual 1024-bit w-ary modular exponentiation using prime moduli of the same
245 * [out] res - result of modular exponentiation: 2x20 qword
419 * Implementations of Modular Exponentiation" (by Shay Gueron) paper for details.
|
| /freebsd/sys/dev/hifn/ |
| H A D | hifn7751reg.h | 362 #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/contrib/llvm-project/lld/ |
| H A D | README.md | 5 modular cross platform linker which is built as part of the LLVM compiler
|
| /freebsd/contrib/bearssl/src/ |
| H A D | inner.h | 750 * 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/bearssl/src/symcipher/ |
| H A D | poly1305_i15.c | 31 * tricky situations with carry propagation and modular reduction.
93 * Add the accumulator to the decoded block (modular in poly1305_inner()
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | BN_add.pod | 92 BN_mod_sqrt() returns the modular square root of I<a> such that
119 For modular operations such as BN_nnmod() or BN_mod_exp() it is an error
|
| /freebsd/sys/modules/em/ |
| H A D | Makefile | 13 # undefined when using modular driver if not needed
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | selinux | 6 0 lelong 0xf97cff8f SE Linux modular policy
|