williamr@2: /* crypto/dsa/dsa.h */ williamr@2: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) williamr@2: * All rights reserved. williamr@2: * williamr@2: * This package is an SSL implementation written williamr@2: * by Eric Young (eay@cryptsoft.com). williamr@2: * The implementation was written so as to conform with Netscapes SSL. williamr@2: * williamr@2: * This library is free for commercial and non-commercial use as long as williamr@2: * the following conditions are aheared to. The following conditions williamr@2: * apply to all code found in this distribution, be it the RC4, RSA, williamr@2: * lhash, DES, etc., code; not just the SSL code. The SSL documentation williamr@2: * included with this distribution is covered by the same copyright terms williamr@2: * except that the holder is Tim Hudson (tjh@cryptsoft.com). williamr@2: * williamr@2: * Copyright remains Eric Young's, and as such any Copyright notices in williamr@2: * the code are not to be removed. williamr@2: * If this package is used in a product, Eric Young should be given attribution williamr@2: * as the author of the parts of the library used. williamr@2: * This can be in the form of a textual message at program startup or williamr@2: * in documentation (online or textual) provided with the package. williamr@2: * williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 3. All advertising materials mentioning features or use of this software williamr@2: * must display the following acknowledgement: williamr@2: * "This product includes cryptographic software written by williamr@2: * Eric Young (eay@cryptsoft.com)" williamr@2: * The word 'cryptographic' can be left out if the rouines from the library williamr@2: * being used are not cryptographic related :-). williamr@2: * 4. If you include any Windows specific code (or a derivative thereof) from williamr@2: * the apps directory (application code) you must include an acknowledgement: williamr@2: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@2: * The licence and distribution terms for any publically available version or williamr@2: * derivative of this code cannot be changed. i.e. this code cannot simply be williamr@2: * copied and put under another distribution licence williamr@2: * [including the GNU Public Licence.] williamr@2: */ williamr@2: /* williamr@2: © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. williamr@2: */ williamr@2: williamr@2: /* williamr@2: * The DSS routines are based on patches supplied by williamr@2: * Steven Schoch . He basically did the williamr@2: * work and I have just tweaked them a little to fit into my williamr@2: * stylistic vision for SSLeay :-) */ williamr@2: williamr@2: #ifndef HEADER_DSA_H williamr@2: #define HEADER_DSA_H williamr@2: williamr@2: #if (defined(__SYMBIAN32__) && !defined(SYMBIAN)) williamr@2: #define SYMBIAN williamr@2: #endif williamr@2: williamr@2: #ifdef SYMBIAN williamr@2: #include williamr@2: #endif williamr@2: #include williamr@2: williamr@2: #ifdef OPENSSL_NO_DSA williamr@2: #error DSA is disabled. williamr@2: #endif williamr@2: williamr@2: #ifndef OPENSSL_NO_BIO williamr@2: #include williamr@2: #endif williamr@2: #include williamr@2: #include williamr@2: williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: #include williamr@2: #ifndef OPENSSL_NO_DH williamr@2: # include williamr@2: #endif williamr@2: #endif williamr@2: #ifndef OPENSSL_DSA_MAX_MODULUS_BITS williamr@2: # define OPENSSL_DSA_MAX_MODULUS_BITS 10000 williamr@2: #endif williamr@2: williamr@2: #define DSA_FLAG_CACHE_MONT_P 0x01 williamr@2: #define DSA_FLAG_NO_EXP_CONSTTIME 0x02 /* new with 0.9.7h; the built-in DSA williamr@2: * implementation now uses constant time williamr@2: * modular exponentiation for secret exponents williamr@2: * by default. This flag causes the williamr@2: * faster variable sliding window method to williamr@2: * be used for all exponents. williamr@2: */ williamr@2: williamr@2: #ifdef __cplusplus williamr@2: extern "C" { williamr@2: #endif williamr@2: williamr@2: /* Already defined in ossl_typ.h */ williamr@2: /* typedef struct dsa_st DSA; */ williamr@2: /* typedef struct dsa_method DSA_METHOD; */ williamr@2: williamr@2: typedef struct DSA_SIG_st williamr@2: { williamr@2: BIGNUM *r; williamr@2: BIGNUM *s; williamr@2: } DSA_SIG; williamr@2: williamr@2: struct dsa_method williamr@2: { williamr@2: const char *name; williamr@2: DSA_SIG * (*dsa_do_sign)(const unsigned char *dgst, int dlen, DSA *dsa); williamr@2: int (*dsa_sign_setup)(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, williamr@2: BIGNUM **rp); williamr@2: int (*dsa_do_verify)(const unsigned char *dgst, int dgst_len, williamr@2: DSA_SIG *sig, DSA *dsa); williamr@2: int (*dsa_mod_exp)(DSA *dsa, BIGNUM *rr, BIGNUM *a1, BIGNUM *p1, williamr@2: BIGNUM *a2, BIGNUM *p2, BIGNUM *m, BN_CTX *ctx, williamr@2: BN_MONT_CTX *in_mont); williamr@2: int (*bn_mod_exp)(DSA *dsa, BIGNUM *r, BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx, williamr@2: BN_MONT_CTX *m_ctx); /* Can be null */ williamr@2: int (*init)(DSA *dsa); williamr@2: int (*finish)(DSA *dsa); williamr@2: int flags; williamr@2: char *app_data; williamr@2: /* If this is non-NULL, it is used to generate DSA parameters */ williamr@2: int (*dsa_paramgen)(DSA *dsa, int bits, williamr@2: unsigned char *seed, int seed_len, williamr@2: int *counter_ret, unsigned long *h_ret, williamr@2: BN_GENCB *cb); williamr@2: /* If this is non-NULL, it is used to generate DSA keys */ williamr@2: int (*dsa_keygen)(DSA *dsa); williamr@2: }; williamr@2: williamr@2: struct dsa_st williamr@2: { williamr@2: /* This first variable is used to pick up errors where williamr@2: * a DSA is passed instead of of a EVP_PKEY */ williamr@2: int pad; williamr@2: long version; williamr@2: int write_params; williamr@2: BIGNUM *p; williamr@2: BIGNUM *q; /* == 20 */ williamr@2: BIGNUM *g; williamr@2: williamr@2: BIGNUM *pub_key; /* y public key */ williamr@2: BIGNUM *priv_key; /* x private key */ williamr@2: williamr@2: BIGNUM *kinv; /* Signing pre-calc */ williamr@2: BIGNUM *r; /* Signing pre-calc */ williamr@2: williamr@2: int flags; williamr@2: /* Normally used to cache montgomery values */ williamr@2: BN_MONT_CTX *method_mont_p; williamr@2: int references; williamr@2: CRYPTO_EX_DATA ex_data; williamr@2: const DSA_METHOD *meth; williamr@2: /* functional reference if 'meth' is ENGINE-provided */ williamr@2: ENGINE *engine; williamr@2: }; williamr@2: williamr@2: #define DSAparams_dup(x) ASN1_dup_of_const(DSA,i2d_DSAparams,d2i_DSAparams,x) williamr@2: #define d2i_DSAparams_fp(fp,x) (DSA *)ASN1_d2i_fp((char *(*)())DSA_new, \ williamr@2: (char *(*)())d2i_DSAparams,(fp),(unsigned char **)(x)) williamr@2: #define i2d_DSAparams_fp(fp,x) ASN1_i2d_fp(i2d_DSAparams,(fp), \ williamr@2: (unsigned char *)(x)) williamr@2: #define d2i_DSAparams_bio(bp,x) ASN1_d2i_bio_of(DSA,DSA_new,d2i_DSAparams,bp,x) williamr@2: #define i2d_DSAparams_bio(bp,x) ASN1_i2d_bio_of_const(DSA,i2d_DSAparams,bp,x) williamr@2: williamr@2: williamr@2: IMPORT_C DSA_SIG * DSA_SIG_new(void); williamr@2: IMPORT_C void DSA_SIG_free(DSA_SIG *a); williamr@2: IMPORT_C int i2d_DSA_SIG(const DSA_SIG *a, unsigned char **pp); williamr@2: IMPORT_C DSA_SIG * d2i_DSA_SIG(DSA_SIG **v, const unsigned char **pp, long length); williamr@2: williamr@2: IMPORT_C DSA_SIG * DSA_do_sign(const unsigned char *dgst,int dlen,DSA *dsa); williamr@2: IMPORT_C int DSA_do_verify(const unsigned char *dgst,int dgst_len, williamr@2: DSA_SIG *sig,DSA *dsa); williamr@2: williamr@2: IMPORT_C const DSA_METHOD *DSA_OpenSSL(void); williamr@2: williamr@2: IMPORT_C void DSA_set_default_method(const DSA_METHOD *); williamr@2: IMPORT_C const DSA_METHOD *DSA_get_default_method(void); williamr@2: IMPORT_C int DSA_set_method(DSA *dsa, const DSA_METHOD *); williamr@2: williamr@2: IMPORT_C DSA * DSA_new(void); williamr@2: IMPORT_C DSA * DSA_new_method(ENGINE *engine); williamr@2: IMPORT_C void DSA_free (DSA *r); williamr@2: /* "up" the DSA object's reference count */ williamr@2: IMPORT_C int DSA_up_ref(DSA *r); williamr@2: IMPORT_C int DSA_size(const DSA *); williamr@2: /* next 4 return -1 on error */ williamr@2: IMPORT_C int DSA_sign_setup( DSA *dsa,BN_CTX *ctx_in,BIGNUM **kinvp,BIGNUM **rp); williamr@2: IMPORT_C int DSA_sign(int type,const unsigned char *dgst,int dlen, williamr@2: unsigned char *sig, unsigned int *siglen, DSA *dsa); williamr@2: IMPORT_C int DSA_verify(int type,const unsigned char *dgst,int dgst_len, williamr@2: const unsigned char *sigbuf, int siglen, DSA *dsa); williamr@2: IMPORT_C int DSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func, williamr@2: CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func); williamr@2: IMPORT_C int DSA_set_ex_data(DSA *d, int idx, void *arg); williamr@2: IMPORT_C void *DSA_get_ex_data(DSA *d, int idx); williamr@2: williamr@2: IMPORT_C DSA * d2i_DSAPublicKey(DSA **a, const unsigned char **pp, long length); williamr@2: IMPORT_C DSA * d2i_DSAPrivateKey(DSA **a, const unsigned char **pp, long length); williamr@2: IMPORT_C DSA * d2i_DSAparams(DSA **a, const unsigned char **pp, long length); williamr@2: williamr@2: /* Deprecated version */ williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: IMPORT_C DSA * DSA_generate_parameters(int bits, williamr@2: unsigned char *seed,int seed_len, williamr@2: int *counter_ret, unsigned long *h_ret,void williamr@2: (*callback)(int, int, void *),void *cb_arg); williamr@2: #endif /* !defined(OPENSSL_NO_DEPRECATED) */ williamr@2: williamr@2: /* New version */ williamr@2: IMPORT_C int DSA_generate_parameters_ex(DSA *dsa, int bits, williamr@2: unsigned char *seed,int seed_len, williamr@2: int *counter_ret, unsigned long *h_ret, BN_GENCB *cb); williamr@2: williamr@2: IMPORT_C int DSA_generate_key(DSA *a); williamr@2: IMPORT_C int i2d_DSAPublicKey(const DSA *a, unsigned char **pp); williamr@2: IMPORT_C int i2d_DSAPrivateKey(const DSA *a, unsigned char **pp); williamr@2: IMPORT_C int i2d_DSAparams(const DSA *a,unsigned char **pp); williamr@2: williamr@2: #ifndef OPENSSL_NO_BIO williamr@2: IMPORT_C int DSAparams_print(BIO *bp, const DSA *x); williamr@2: IMPORT_C int DSA_print(BIO *bp, const DSA *x, int off); williamr@2: #endif williamr@2: #ifndef OPENSSL_NO_FP_API williamr@2: IMPORT_C int DSAparams_print_fp(FILE *fp, const DSA *x); williamr@2: IMPORT_C int DSA_print_fp(FILE *bp, const DSA *x, int off); williamr@2: #endif williamr@2: williamr@2: #define DSS_prime_checks 50 williamr@2: /* Primality test according to FIPS PUB 186[-1], Appendix 2.1: williamr@2: * 50 rounds of Rabin-Miller */ williamr@2: #define DSA_is_prime(n, callback, cb_arg) \ williamr@2: BN_is_prime(n, DSS_prime_checks, callback, NULL, cb_arg) williamr@2: williamr@2: #ifndef OPENSSL_NO_DH williamr@2: /* Convert DSA structure (key or just parameters) into DH structure williamr@2: * (be careful to avoid small subgroup attacks when using this!) */ williamr@2: IMPORT_C DH *DSA_dup_DH(const DSA *r); williamr@2: #endif williamr@2: williamr@2: /* BEGIN ERROR CODES */ williamr@2: /* The following lines are auto generated by the script mkerr.pl. Any changes williamr@2: * made after this point may be overwritten when the script is next run. williamr@2: */ williamr@2: IMPORT_C void ERR_load_DSA_strings(void); williamr@2: williamr@2: /* Error codes for the DSA functions. */ williamr@2: williamr@2: /* Function codes. */ williamr@2: #define DSA_F_D2I_DSA_SIG 110 williamr@2: #define DSA_F_DSAPARAMS_PRINT 100 williamr@2: #define DSA_F_DSAPARAMS_PRINT_FP 101 williamr@2: #define DSA_F_DSA_DO_SIGN 112 williamr@2: #define DSA_F_DSA_DO_VERIFY 113 williamr@2: #define DSA_F_DSA_NEW_METHOD 103 williamr@2: #define DSA_F_DSA_PRINT 104 williamr@2: #define DSA_F_DSA_PRINT_FP 105 williamr@2: #define DSA_F_DSA_SIGN 106 williamr@2: #define DSA_F_DSA_SIGN_SETUP 107 williamr@2: #define DSA_F_DSA_SIG_NEW 109 williamr@2: #define DSA_F_DSA_VERIFY 108 williamr@2: #define DSA_F_I2D_DSA_SIG 111 williamr@2: #define DSA_F_SIG_CB 114 williamr@2: williamr@2: /* Reason codes. */ williamr@2: #define DSA_R_BAD_Q_VALUE 102 williamr@2: #define DSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE 100 williamr@2: #define DSA_R_MISSING_PARAMETERS 101 williamr@2: #define DSA_R_MODULUS_TOO_LARGE 103 williamr@2: #ifdef __cplusplus williamr@2: } williamr@2: #endif williamr@2: #endif