Searched refs:BN_mod_sqrt (Results 1 – 10 of 10) sorted by relevance
/openssl/doc/man3/ |
H A D | BN_add.pod | 6 BN_mod_sub, BN_mod_mul, BN_mod_sqr, BN_mod_sqrt, BN_exp, BN_mod_exp, BN_gcd - 39 BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 92 BN_mod_sqrt() returns the modular square root of I<a> such that 124 The BN_mod_sqrt() returns the result (possibly incorrect if I<p> is
|
/openssl/crypto/bn/ |
H A D | bn_sqrt.c | 13 BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) in BN_mod_sqrt() function
|
/openssl/crypto/ec/ |
H A D | ecp_oct.c | 105 if (!BN_mod_sqrt(y, tmp1, group->field, ctx)) { in ossl_ec_GFp_simple_set_compressed_coordinates()
|
/openssl/include/openssl/ |
H A D | bn.h | 356 BIGNUM *BN_mod_sqrt(BIGNUM *ret,
|
/openssl/util/ |
H A D | missingcrypto111.txt | 291 BN_mod_sqrt(3)
|
H A D | libcrypto.num | 3282 BN_mod_sqrt 3352 3_0_0 EXIST::FUNCTION:
|
/openssl/test/ |
H A D | bntest.c | 1757 if (!TEST_ptr_null(BN_mod_sqrt(ret, a, p, ctx))) in file_modsqrt() 1765 if (!TEST_ptr(BN_mod_sqrt(ret, a, p, ctx)) in file_modsqrt()
|
/openssl/test/recipes/10-test_bn_data/ |
H A D | bnmod.txt | 2868 # Negative testcases for BN_mod_sqrt()
|
/openssl/ |
H A D | NEWS.md | 488 * Fixed a bug in the BN_mod_sqrt() function that can cause it to loop forever
|
H A D | CHANGES.md | 1870 * Fixed a bug in the BN_mod_sqrt() function that can cause it to loop forever 1894 Also any other applications that use the BN_mod_sqrt() where the attacker 12790 * Change BN_mod_sqrt() so that it verifies that the input value 12792 BN_mod_sqrt would show GIGO behaviour.) 15426 * New function BN_mod_sqrt for computing square roots modulo a prime
|
Completed in 133 milliseconds