Searched refs:BN_kronecker (Results 1 - 7 of 7) sorted by relevance
/openbsd-current/lib/libcrypto/bn/ |
H A D | bn_kron.c | 66 BN_kronecker(const BIGNUM *A, const BIGNUM *B, BN_CTX *ctx) function 195 LCRYPTO_ALIAS(BN_kronecker); variable
|
H A D | bn_mod_sqrt.c | 212 switch (BN_kronecker(n, p, ctx)) { 655 * BN_kronecker() is O(log^2(n)). This is small compared to the cost 659 if ((kronecker = BN_kronecker(a_mod_p, p, ctx)) == -2)
|
H A D | bn_bpsw.c | 272 if ((jacobi_symbol = BN_kronecker(D, n, ctx)) == -2)
|
H A D | bn.h | 408 int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */
|
/openbsd-current/lib/libcrypto/hidden/openssl/ |
H A D | bn.h | 115 LCRYPTO_USED(BN_kronecker); variable
|
/openbsd-current/lib/libcrypto/man/ |
H A D | Makefile | 74 BN_kronecker.3 \
|
/openbsd-current/regress/lib/libcrypto/bn/ |
H A D | bn_test.c | 267 message(out, "BN_kronecker"); 1478 * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In 1479 * this case we know that if b is prime, then BN_kronecker(a, b, ctx) is 1484 * is prime but whether BN_kronecker works.) 1526 kronecker = BN_kronecker(a, b, ctx); 1529 /* we actually need BN_kronecker(a, |b|) */
|
Completed in 146 milliseconds