| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86Schedule.td | 140 // Integer multiplication
141 defm WriteIMul8 : X86SchedWritePair; // Integer 8-bit multiplication.
142 defm WriteIMul16 : X86SchedWritePair; // Integer 16-bit multiplication.
143 defm WriteIMul16Imm : X86SchedWritePair; // Integer 16-bit multiplication by immediate.
144 defm WriteIMul16Reg : X86SchedWritePair; // Integer 16-bit multiplication by register.
145 defm WriteIMul32 : X86SchedWritePair; // Integer 32-bit multiplication.
146 defm WriteIMul32Imm : X86SchedWritePair; // Integer 32-bit multiplication by immediate.
147 defm WriteIMul32Reg : X86SchedWritePair; // Integer 32-bit multiplication by register.
148 defm WriteIMul64 : X86SchedWritePair; // Integer 64-bit multiplication.
149 defm WriteIMul64Imm : X86SchedWritePair; // Integer 64-bit multiplication b
[all...] |
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | EC_POINT_add.pod | 52 …multiplication). Alternatively, both B<q> and B<m> may be NULL, and B<n> non-NULL, in which case t…
53 When performing a single fixed or variable point multiplication, the underlying implementation uses…
57 When performing a fixed point multiplication (B<n> is non-NULL and B<num> is 0) or a variable point…
60 … EC_GROUP_precompute_mult stores multiples of the generator for faster point multiplication, whilst
|
| H A D | BN_mod_exp_mont.pod | 29 using Montgomery multiplication. I<in_mont> is a Montgomery context and can be
34 (C<rr=a^p % m>) using Montgomery multiplication. It is a variant of
42 power modulo I<m2> (C<rr2=a2^p2 % m2>) using Montgomery multiplication. For some
|
| /freebsd/sys/dev/qat/qat_api/include/lac/ |
| H A D | cpa_cy_ec.h | 66 * 1. Montgomery 25519 Curve | scalar point Multiplication
72 * 2. Montgomery 25519 Curve | generator point Multiplication
77 * 3. Twisted Edwards 25519 Curve | scalar point Multiplication
87 * 4. Twisted Edwards 25519 Curve | generator point Multiplication
95 * 5. Montgomery 448 Curve | scalar point Multiplication
101 * 6. Montgomery 448 Curve | generator point Multiplication
106 * 7. Edwards 448 Curve | scalar point Multiplication
116 * 8. Edwards 448 Curve | generator point Multiplication
172 * Enumeration listing curve types to use with generic multiplication
177 * EC Point multiplication and other operations depend on the type of
[all …]
|
| H A D | cpa_cy_ecdh.h | 75 * ECDH Point Multiplication Operation Data.
131 /**< set to CPA_TRUE to do a verification before the multiplication */
147 /**< Total number of ECDH Point Multiplication operation requests. */
149 /**< Total number of ECDH Point Multiplication operation requests that had
152 /**< Total number of ECDH Point Multiplication operation requests that
155 /**< Total number of ECDH Point Multiplication operation requests that could
158 /**< Total number of ECDH Point Multiplication or Point Verify operation
195 * @param[in] multiplyStatus Status of the point multiplication and the
222 * ECDH Point Multiplication.
225 * This function performs ECDH Point Multiplication as defined in
[all …]
|
| H A D | cpa_cy_ecsm2.h | 163 * SM2 Point Multiplication Operation Data.
203 * SM2 Generator Multiplication Operation Data.
530 /**< Total number of ECSM2 Point Multiplication operation requests. */
532 /**< Total number of ECSM2 Point Multiplication operation requests that
535 /**< Total number of ECSM2 Point Multiplication operation requests that
538 /**< Total number of ECSM2 Point Multiplication operation requests that
541 /**< Total number of ECSM2 Point Multiplication or Point Verify operation
546 /**< Total number of ECSM2 Generator Multiplication operation requests. */
548 /**< Total number of ECSM2 Generator Multiplication operation requests that
551 /**< Total number of ECSM2 Generator Multiplication operation requests that
[all …]
|
| /freebsd/contrib/bearssl/inc/ |
| H A D | bearssl_ec.h | 97 * For all point multiplication functions, the following holds:
324 * the multiplication result is written over it. The multiplier
457 * This implementation uses custom code relying on multiplication of
459 * defined only on platforms that offer the 64x64->128 multiplication
475 * This implementation uses custom code relying on multiplication of
477 * defined only on platforms that offer the 64x64->128 multiplication
498 * - `order()` returns 2^255-1, since the point multiplication algorithm
512 * - `order()` returns 2^255-1, since the point multiplication algorithm
521 * This implementation uses custom code relying on multiplication of
526 * - `order()` returns 2^255-1, since the point multiplication algorithm
[all …]
|
| /freebsd/contrib/libucl/src/ |
| H A D | mum.h | 25 input data by 64x64-bit multiplication and mixing hi- and low-parts
26 of the multiplication result by using an addition and then mix it
29 multiplication. When all primes are used once, the state is
115 multiplication. If we use a generic code we actually call a in _mum()
116 function doing 128x128->128 bit multiplication. The function is in _mum()
126 /* Implementation of 64x64->128-bit multiplication by four 32x32->64 in _mum()
127 bit multiplication. */ in _mum()
229 64x64->128-bit multiplication. AVX2 currently only have a in _mum_hash_aligned()
230 vector insn for 4 32x32->64-bit multiplication. */ in _mum_hash_aligned()
|
| /freebsd/secure/lib/libcrypto/man/man3/ |
| H A D | EC_POINT_add.3 | 189 …multiplication). Alternatively, both \fBq\fR and \fBm\fR may be \s-1NULL,\s0 and \fBn\fR non-NULL,…
190 When performing a single fixed or variable point multiplication, the underlying implementation uses…
194 When performing a fixed point multiplication (\fBn\fR is non-NULL and \fBnum\fR is 0) or a variable…
197 … EC_GROUP_precompute_mult stores multiples of the generator for faster point multiplication, whilst
|
| /freebsd/crypto/libecc/src/ecdh/ |
| H A D | ecccdh.c | 79 /* Use blinding when computing point scalar multiplication */ in ecccdh_init_pub_key()
190 /* Perform a cofactor multiplication if necessary. in ecccdh_derive_secret()
192 * scalar multiplication here. in ecccdh_derive_secret()
199 * This would be rejected in any case by the check post scalar multiplication below, but we in ecccdh_derive_secret()
205 /* Compute the shared secret using scalar multiplication */ in ecccdh_derive_secret()
212 /* NOTE: scalar multiplication primitive checks that the resulting point is on in ecccdh_derive_secret()
|
| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | amxcomplexintrin.h | 21 /// Perform matrix multiplication of two tiles containing complex elements and
26 /// of (row of \a a, column of \a b), it performs a set of multiplication
65 /// Perform matrix multiplication of two tiles containing complex elements and
70 /// of (row of \a a, column of \a b), it performs a set of multiplication
122 /// Perform matrix multiplication of two tiles containing complex elements and
145 /// Perform matrix multiplication of two tiles containing complex elements and
|
| H A D | __wmmintrin_pclmul.h | 18 /// operands using the immediate-value operand. The multiplication is a
19 /// carry-less multiplication, and the 128-bit integer product is stored in
43 /// multiplication of the selected 64-bit values.
|
| /freebsd/sys/contrib/openzfs/module/icp/asm-x86_64/modes/ |
| H A D | gcm_pclmulqdq.S | 34 * Galois Field Multiplication implementation.
37 * carry-less multiplication. More information about PCLMULQDQ can be
40 * carry-less-multiplication-and-its-usage-for-computing-the-gcm-mode/
113 * Perform a carry-less multiplication (that is, use XOR instead of the
179 // of the carry-less multiplication of
182 // We shift the result of the multiplication by one bit position
|
| /freebsd/sys/gnu/dev/bwn/phy_n/ |
| H A D | if_bwn_phy_n_regs.h | 597 #define BWN_NPHY_RSSIMC_0I_RSSI_X BWN_PHY_N(0x1A4) /* RSSI multiplication coefficient 0 I RSSI X */
598 #define BWN_NPHY_RSSIMC_0I_RSSI_Y BWN_PHY_N(0x1A5) /* RSSI multiplication coefficient 0 I RSSI Y */
599 #define BWN_NPHY_RSSIMC_0I_RSSI_Z BWN_PHY_N(0x1A6) /* RSSI multiplication coefficient 0 I RSSI Z */
600 #define BWN_NPHY_RSSIMC_0I_TBD BWN_PHY_N(0x1A7) /* RSSI multiplication coefficient 0 I TBD */
601 #define BWN_NPHY_RSSIMC_0I_PWRDET BWN_PHY_N(0x1A8) /* RSSI multiplication coefficient 0 I power de…
602 #define BWN_NPHY_RSSIMC_0I_TSSI BWN_PHY_N(0x1A9) /* RSSI multiplication coefficient 0 I TSSI */
603 #define BWN_NPHY_RSSIMC_0Q_RSSI_X BWN_PHY_N(0x1AA) /* RSSI multiplication coefficient 0 Q RSSI X */
604 #define BWN_NPHY_RSSIMC_0Q_RSSI_Y BWN_PHY_N(0x1AB) /* RSSI multiplication coefficient 0 Q RSSI Y */
605 #define BWN_NPHY_RSSIMC_0Q_RSSI_Z BWN_PHY_N(0x1AC) /* RSSI multiplication coefficient 0 Q RSSI Z */
606 #define BWN_NPHY_RSSIMC_0Q_TBD BWN_PHY_N(0x1AD) /* RSSI multiplication coefficient 0 Q TBD */
[all …]
|
| /freebsd/crypto/libecc/src/nn/ |
| H A D | nn_mul.c | 31 * a direct writing of the naive multiplication algorithm one has
35 * word multiplication are actually performed by an helper macro
65 * be large enough for what multiplication may in _nn_mul_low()
73 * Compute the result of the multiplication of in _nn_mul_low()
|
| /freebsd/crypto/openssl/crypto/ec/ |
| H A D | ecp_nistputil.c | 143 * multiplication: the use of signed rather than unsigned digits means that
149 * Signed digits for multiplication were introduced by Booth ("A signed binary
150 * multiplication technique", Quart. Journ. Mech. and Applied Math., vol. IV,
151 * pt. 2 (1951), pp. 236-240), in that case for multiplication of integers.
187 * To prevent leaking information through side channels in point multiplication,
|
| /freebsd/sys/dev/qat/qat_api/firmware/include/ |
| H A D | icp_qat_fw_mmp.h | 46 * Input parameter list for ECC P384 Variable Point Multiplication [k]P ,
60 * Input parameter list for ECC P384 Generator Point Multiplication [k]G ,
87 * Input parameter list for ECC P256 Variable Point Multiplication [k]P ,
101 * Input parameter list for ECC P256 Generator Point Multiplication [k]G ,
2416 * Input parameter list for MATHS GF2 Point Multiplication ,
2452 * Input parameter list for MATHS GF2 Point Multiplication ,
2488 * Input parameter list for ECC GF2 Point Multiplication for curves B-571/K-571 ,
2710 * Input parameter list for ECC GFP Point Multiplication ,
2746 * Input parameter list for ECC GFP Point Multiplication ,
2782 * Input parameter list for ECC GFP Point Multiplication ,
[all …]
|
| /freebsd/contrib/bearssl/src/ |
| H A D | config.h | 75 * which is slower and larger than the normal multiplication, but should
77 * multiplication opcode takes a variable number of cycles to complete.
85 * larger than the normal multiplication, but should ensure
87 * basic multiplication is not constant-time.
|
| /freebsd/contrib/bc/manuals/ |
| H A D | algorithms.md | 15 ### Multiplication subsection in Algorithms
24 Brute force multiplication is used below `BC_NUM_KARATSUBA_LEN` digits. It is
27 is a "break even" point in the number of digits where brute force multiplication
46 Subtraction was used instead of multiplication for two reasons:
52 Using multiplication would make division have the even worse algorithmic
285 The algorithm is a simple multiplication loop.
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/builtins/ |
| H A D | multf3.c | 1 //===-- lib/multf3.c - Quad-precision multiplication --------------*- C -*-===//
9 // This file implements quad-precision soft-float multiplication
|
| H A D | fp_mul_impl.inc | 1 //===---- lib/fp_mul_impl.inc - floating point multiplication -----*- C -*-===//
9 // This file implements soft-float multiplication with the IEEE-754 default
79 // Perform a basic multiplication on the significands. One of them must be
|
| H A D | muldf3.c | 1 //===-- lib/muldf3.c - Double-precision multiplication ------------*- C -*-===//
9 // This file implements double-precision soft-float multiplication
|
| H A D | mulsf3.c | 1 //===-- lib/mulsf3.c - Single-precision multiplication ------------*- C -*-===//
9 // This file implements single-precision soft-float multiplication
|
| /freebsd/share/doc/psd/15.yacc/ |
| H A D | ss6 | 119 strength as multiplication, or even higher, while binary minus has a lower strength than
120 multiplication.
126 For example, to make unary minus have the same precedence as multiplication the rules might resembl…
|
| /freebsd/contrib/bearssl/src/hash/ |
| H A D | ghash_ctmul32.c | 29 * 32 bits for each multiplication result. This is meant primarily for
30 * the ARM Cortex M0 and M0+, whose multiplication opcode does not yield
46 * Multiplication in GF(2)[X], truncated to its low 32 bits.
100 * that we have to do the multiplication twice, with the in br_ghash_ctmul32()
149 * We are using Karatsuba: the 128x128 multiplication is in br_ghash_ctmul32()
|