Home
last modified time | relevance | path

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

/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
/openssl/test/
H A Dbntest.c2968 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; in test_mod_exp() local
2974 || !TEST_true(BN_dec2bn(&modulo, test->mod))) in test_mod_exp()
2977 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1)) in test_mod_exp()
2993 BN_free(modulo); in test_mod_exp()
3002 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; in test_mod_exp_consttime() local
3008 || !TEST_true(BN_dec2bn(&modulo, test->mod))) in test_mod_exp_consttime()
3013 BN_set_flags(modulo, BN_FLG_CONSTTIME); in test_mod_exp_consttime()
3015 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1)) in test_mod_exp_consttime()
3031 BN_free(modulo); in test_mod_exp_consttime()
/openssl/crypto/
H A DREADME-sparse_array.md15 SA_BLOCK_MASK Specifies a bit mask to perform modulo block size
/openssl/test/recipes/30-test_evp_data/
H A Devpmac_poly1305.txt47 # What happens if addition of s overflows modulo 2^128?
/openssl/crypto/aes/asm/
H A Dbsaes-armv8.pl1268 // x4 -> initial value of 128-bit counter (stored big-endian) which increments, modulo 2^32, for …
/openssl/
H A DCHANGES.md13884 * New function BN_mod_sqrt for computing square roots modulo a prime
13961 be reduced modulo `m`.

Completed in 90 milliseconds