Home
last modified time | relevance | path

Searched refs:modulo (Results 1 – 25 of 46) sorted by relevance

12

/freebsd-14.2/crypto/openssl/doc/man3/
H A DBN_mod_exp_mont.pod28 BN_mod_exp_mont() computes I<a> to the I<p>-th power modulo I<m> (C<rr=a^p % m>)
33 BN_mod_exp_mont_consttime() computes I<a> to the I<p>-th power modulo I<m>
41 the I<p1>-th power modulo I<m1> (C<rr1=a1^p1 % m1>) and I<a2> to the I<p2>-th
42 power modulo I<m2> (C<rr2=a2^p2 % m2>) using Montgomery multiplication. For some
H A DBN_mod_inverse.pod5 BN_mod_inverse - compute inverse modulo n
16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
H A DBN_add.pod73 BN_nnmod() reduces I<a> modulo I<m> and places the nonnegative
76 BN_mod_add() adds I<a> to I<b> modulo I<m> and places the nonnegative
79 BN_mod_sub() subtracts I<b> from I<a> modulo I<m> and places the
89 BN_mod_sqr() takes the square of I<a> modulo B<m> and places the
102 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
H A DBN_mod_mul_montgomery.pod69 The inputs must be reduced modulo B<m>, otherwise the result will be
/freebsd-14.2/contrib/unifdef/tests/
H A Dif7.c65 #error FOOB modulo FOO is not 0
/freebsd-14.2/contrib/file/magic/Magdir/
H A Dcompress64 # size of the original (uncompressed) input data modulo 2^32
66 >>>-4 ulelong x \b, original size modulo 2^32 %u
96 # size of the original (uncompressed) input data modulo 2^32
97 >>-4 ulelong x \b, original size modulo 2^32 %u
127 # size of the original (uncompressed) input data modulo 2^32
128 #>-4 ulelong x \b, original size modulo 2^32 %u
H A Dpgp-binary-keys151 # will be identical to v4 data structures modulo the version number.
H A Dmap79 # Checksum, sum of all bytes modulo 256 should be 0
/freebsd-14.2/lib/libc/softfloat/bits32/
H A Dsoftfloat-macros266 value formed by concatenating `b0' and `b1'. Addition is modulo 2^64, so
287 modulo 2^96, so any carry out is lost. The result is broken into three
325 64-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo
345 is modulo 2^96, so any borrow out (carry out) is lost. The result is broken
/freebsd-14.2/crypto/openssl/test/
H A Dbntest.c2827 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; in test_mod_exp() local
2833 || !TEST_true(BN_dec2bn(&modulo, test->mod))) in test_mod_exp()
2836 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1)) in test_mod_exp()
2852 BN_free(modulo); in test_mod_exp()
2861 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; in test_mod_exp_consttime() local
2867 || !TEST_true(BN_dec2bn(&modulo, test->mod))) in test_mod_exp_consttime()
2872 BN_set_flags(modulo, BN_FLG_CONSTTIME); in test_mod_exp_consttime()
2874 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1)) in test_mod_exp_consttime()
2890 BN_free(modulo); in test_mod_exp_consttime()
/freebsd-14.2/sys/contrib/zlib/doc/
H A Drfc1950.txt327 are done modulo 65521. s1 is initialized to 1, s2 to zero. The
484 The modulo on unsigned long accumulators can be delayed for 5552
485 bytes, so the modulo operation time is negligible. If the bytes
525 % modulo operator: a % b is the remainder of a divided by b.
H A Drfc1952.txt429 data modulo 2^32.
/freebsd-14.2/contrib/llvm-project/lld/docs/ELF/
H A Dlinker_script.rst94 > The value of sh_addr must be congruent to 0, modulo the value of sh_addralign.
98 sh_addr=0 (modulo sh_addralign).
/freebsd-14.2/lib/libc/softfloat/bits64/
H A Dsoftfloat-macros341 value formed by concatenating `b0' and `b1'. Addition is modulo 2^128, so
362 modulo 2^192, so any carry out is lost. The result is broken into three
400 128-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo
420 Subtraction is modulo 2^192, so any borrow out (carry out) is lost. The
/freebsd-14.2/crypto/openssl/crypto/
H A DREADME-sparse_array.md15 SA_BLOCK_MASK Specifies a bit mask to perform modulo block size
/freebsd-14.2/crypto/openssl/test/recipes/30-test_evp_data/
H A Devpmac_poly1305.txt47 # What happens if addition of s overflows modulo 2^128?
/freebsd-14.2/
H A D.cirrus.yml149 # tools/build/options/makeman (modulo the date which always updates)
/freebsd-14.2/sys/crypto/openssl/arm/
H A Dchacha-armv4.S87 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
209 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
853 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
1091 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
1300 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
H A Dghashv8-armx.S120 @ as loop is modulo-scheduled
/freebsd-14.2/contrib/llvm-project/lldb/bindings/python/
H A Dpython-extensions.swig449 def __ipow__(self, other, modulo):
450 result = self.__pow__(self, other, modulo)
/freebsd-14.2/contrib/llvm-project/llvm/lib/Support/
H A DAPInt.cpp1250 APInt APInt::multiplicativeInverse(const APInt& modulo) const { in multiplicativeInverse()
1251 assert(ult(modulo) && "This APInt must be smaller than the modulo"); in multiplicativeInverse()
1261 APInt r[2] = { modulo, *this }; in multiplicativeInverse()
1287 t[i] += modulo; in multiplicativeInverse()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPInt.h1737 APInt multiplicativeInverse(const APInt &modulo) const;
/freebsd-14.2/sys/contrib/openzfs/module/icp/asm-x86_64/modes/
H A Daesni-gcm-x86_64.S23 # in the context parallelized AES-NI CTR and modulo-scheduled
/freebsd-14.2/lib/libc++/
H A DMakefile899 MAT_HEADERS+= modulo.h
/freebsd-14.2/usr.sbin/cron/doc/
H A DMAIL140 to start on and N with slashes). I took modulo the day of year as a

12