diff options
Diffstat (limited to 'src/lib/libssl/src/crypto/bn/bn.h')
-rw-r--r-- | src/lib/libssl/src/crypto/bn/bn.h | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/src/lib/libssl/src/crypto/bn/bn.h b/src/lib/libssl/src/crypto/bn/bn.h index a0bc47837d..f34248ec4f 100644 --- a/src/lib/libssl/src/crypto/bn/bn.h +++ b/src/lib/libssl/src/crypto/bn/bn.h | |||
@@ -558,6 +558,17 @@ int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb); | |||
558 | int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, | 558 | int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, |
559 | int do_trial_division, BN_GENCB *cb); | 559 | int do_trial_division, BN_GENCB *cb); |
560 | 560 | ||
561 | int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx); | ||
562 | |||
563 | int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, | ||
564 | const BIGNUM *Xp, const BIGNUM *Xp1, const BIGNUM *Xp2, | ||
565 | const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb); | ||
566 | int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, | ||
567 | BIGNUM *Xp1, BIGNUM *Xp2, | ||
568 | const BIGNUM *Xp, | ||
569 | const BIGNUM *e, BN_CTX *ctx, | ||
570 | BN_GENCB *cb); | ||
571 | |||
561 | BN_MONT_CTX *BN_MONT_CTX_new(void ); | 572 | BN_MONT_CTX *BN_MONT_CTX_new(void ); |
562 | void BN_MONT_CTX_init(BN_MONT_CTX *ctx); | 573 | void BN_MONT_CTX_init(BN_MONT_CTX *ctx); |
563 | int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b, | 574 | int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b, |
@@ -612,6 +623,8 @@ int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |||
612 | int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, | 623 | int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, |
613 | BN_RECP_CTX *recp, BN_CTX *ctx); | 624 | BN_RECP_CTX *recp, BN_CTX *ctx); |
614 | 625 | ||
626 | #ifndef OPENSSL_NO_EC2M | ||
627 | |||
615 | /* Functions for arithmetic over binary polynomials represented by BIGNUMs. | 628 | /* Functions for arithmetic over binary polynomials represented by BIGNUMs. |
616 | * | 629 | * |
617 | * The BIGNUM::neg property of BIGNUMs representing binary polynomials is | 630 | * The BIGNUM::neg property of BIGNUMs representing binary polynomials is |
@@ -663,6 +676,8 @@ int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a, | |||
663 | int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max); | 676 | int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max); |
664 | int BN_GF2m_arr2poly(const int p[], BIGNUM *a); | 677 | int BN_GF2m_arr2poly(const int p[], BIGNUM *a); |
665 | 678 | ||
679 | #endif | ||
680 | |||
666 | /* faster mod functions for the 'NIST primes' | 681 | /* faster mod functions for the 'NIST primes' |
667 | * 0 <= a < p^2 */ | 682 | * 0 <= a < p^2 */ |
668 | int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | 683 | int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); |