/* Copyright (C) 1995-1998 Eric Young ([email protected]) * All rights reserved. * * This package is an SSL implementation written * by Eric Young ([email protected]). * The implementation was written so as to conform with Netscapes SSL. * * This library is free for commercial and non-commercial use as long as * the following conditions are aheared to. The following conditions * apply to all code found in this distribution, be it the RC4, RSA, * lhash, DES, etc., code; not just the SSL code. The SSL documentation * included with this distribution is covered by the same copyright terms * except that the holder is Tim Hudson ([email protected]). * * Copyright remains Eric Young's, and as such any Copyright notices in * the code are not to be removed. * If this package is used in a product, Eric Young should be given attribution * as the author of the parts of the library used. * This can be in the form of a textual message at program startup or * in documentation (online or textual) provided with the package. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * "This product includes cryptographic software written by * Eric Young ([email protected])" * The word 'cryptographic' can be left out if the rouines from the library * being used are not cryptographic related :-). * 4. If you include any Windows specific code (or a derivative thereof) from * the apps directory (application code) you must include an acknowledgement: * "This product includes software written by Tim Hudson ([email protected])" * * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * The licence and distribution terms for any publically available version or * derivative of this code cannot be changed. i.e. this code cannot simply be * copied and put under another distribution licence * [including the GNU Public Licence.] * * The DSS routines are based on patches supplied by * Steven Schoch <[email protected]>. */ #include <openssl/dsa.h> #include <string.h> #include <openssl/bn.h> #include <openssl/dh.h> #include <openssl/digest.h> #include <openssl/engine.h> #include <openssl/err.h> #include <openssl/ex_data.h> #include <openssl/mem.h> #include <openssl/rand.h> #include <openssl/sha.h> #include <openssl/thread.h> #include "internal.h" #include "../fipsmodule/bn/internal.h" #include "../fipsmodule/dh/internal.h" #include "../internal.h" // Primality test according to FIPS PUB 186[-1], Appendix 2.1: 50 rounds of // Miller-Rabin. #define DSS_prime_checks … static int dsa_sign_setup(const DSA *dsa, BN_CTX *ctx_in, BIGNUM **out_kinv, BIGNUM **out_r); static CRYPTO_EX_DATA_CLASS g_ex_data_class = …; DSA *DSA_new(void) { … } void DSA_free(DSA *dsa) { … } int DSA_up_ref(DSA *dsa) { … } unsigned DSA_bits(const DSA *dsa) { … } const BIGNUM *DSA_get0_pub_key(const DSA *dsa) { … } const BIGNUM *DSA_get0_priv_key(const DSA *dsa) { … } const BIGNUM *DSA_get0_p(const DSA *dsa) { … } const BIGNUM *DSA_get0_q(const DSA *dsa) { … } const BIGNUM *DSA_get0_g(const DSA *dsa) { … } void DSA_get0_key(const DSA *dsa, const BIGNUM **out_pub_key, const BIGNUM **out_priv_key) { … } void DSA_get0_pqg(const DSA *dsa, const BIGNUM **out_p, const BIGNUM **out_q, const BIGNUM **out_g) { … } int DSA_set0_key(DSA *dsa, BIGNUM *pub_key, BIGNUM *priv_key) { … } int DSA_set0_pqg(DSA *dsa, BIGNUM *p, BIGNUM *q, BIGNUM *g) { … } int DSA_generate_parameters_ex(DSA *dsa, unsigned bits, const uint8_t *seed_in, size_t seed_len, int *out_counter, unsigned long *out_h, BN_GENCB *cb) { … } DSA *DSAparams_dup(const DSA *dsa) { … } int DSA_generate_key(DSA *dsa) { … } DSA_SIG *DSA_SIG_new(void) { … } void DSA_SIG_free(DSA_SIG *sig) { … } void DSA_SIG_get0(const DSA_SIG *sig, const BIGNUM **out_r, const BIGNUM **out_s) { … } int DSA_SIG_set0(DSA_SIG *sig, BIGNUM *r, BIGNUM *s) { … } // mod_mul_consttime sets |r| to |a| * |b| modulo |mont->N|, treating |a| and // |b| as secret. This function internally uses Montgomery reduction, but // neither inputs nor outputs are in Montgomery form. static int mod_mul_consttime(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BN_MONT_CTX *mont, BN_CTX *ctx) { … } DSA_SIG *DSA_do_sign(const uint8_t *digest, size_t digest_len, const DSA *dsa) { … } int DSA_do_verify(const uint8_t *digest, size_t digest_len, const DSA_SIG *sig, const DSA *dsa) { … } int DSA_do_check_signature(int *out_valid, const uint8_t *digest, size_t digest_len, const DSA_SIG *sig, const DSA *dsa) { … } int DSA_sign(int type, const uint8_t *digest, size_t digest_len, uint8_t *out_sig, unsigned int *out_siglen, const DSA *dsa) { … } int DSA_verify(int type, const uint8_t *digest, size_t digest_len, const uint8_t *sig, size_t sig_len, const DSA *dsa) { … } int DSA_check_signature(int *out_valid, const uint8_t *digest, size_t digest_len, const uint8_t *sig, size_t sig_len, const DSA *dsa) { … } // der_len_len returns the number of bytes needed to represent a length of |len| // in DER. static size_t der_len_len(size_t len) { … } int DSA_size(const DSA *dsa) { … } static int dsa_sign_setup(const DSA *dsa, BN_CTX *ctx, BIGNUM **out_kinv, BIGNUM **out_r) { … } int DSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_unused *unused, CRYPTO_EX_dup *dup_unused, CRYPTO_EX_free *free_func) { … } int DSA_set_ex_data(DSA *dsa, int idx, void *arg) { … } void *DSA_get_ex_data(const DSA *dsa, int idx) { … } DH *DSA_dup_DH(const DSA *dsa) { … }