| 1 |
/* |
| 2 |
* Copyright (c) 2006 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* 3. Neither the name of the Institute nor the names of its contributors |
| 18 |
* may be used to endorse or promote products derived from this software |
| 19 |
* without specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
| 22 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
| 25 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include <config.h> |
| 35 |
#include <roken.h> |
| 36 |
|
| 37 |
#include <dsa.h> |
| 38 |
|
| 39 |
/* |
| 40 |
* |
| 41 |
*/ |
| 42 |
|
| 43 |
DSA * |
| 44 |
DSA_new(void) |
| 45 |
{ |
| 46 |
DSA *dsa = calloc(1, sizeof(*dsa)); |
| 47 |
dsa->meth = rk_UNCONST(DSA_get_default_method()); |
| 48 |
dsa->references = 1; |
| 49 |
return dsa; |
| 50 |
} |
| 51 |
|
| 52 |
void |
| 53 |
DSA_free(DSA *dsa) |
| 54 |
{ |
| 55 |
if (dsa->references <= 0) |
| 56 |
abort(); |
| 57 |
|
| 58 |
if (--dsa->references > 0) |
| 59 |
return; |
| 60 |
|
| 61 |
(*dsa->meth->finish)(dsa); |
| 62 |
|
| 63 |
#define free_if(f) if (f) { BN_free(f); } |
| 64 |
free_if(dsa->p); |
| 65 |
free_if(dsa->q); |
| 66 |
free_if(dsa->g); |
| 67 |
free_if(dsa->pub_key); |
| 68 |
free_if(dsa->priv_key); |
| 69 |
free_if(dsa->kinv); |
| 70 |
free_if(dsa->r); |
| 71 |
#undef free_if |
| 72 |
|
| 73 |
memset(dsa, 0, sizeof(*dsa)); |
| 74 |
free(dsa); |
| 75 |
|
| 76 |
} |
| 77 |
|
| 78 |
int |
| 79 |
DSA_up_ref(DSA *dsa) |
| 80 |
{ |
| 81 |
return ++dsa->references; |
| 82 |
} |
| 83 |
|
| 84 |
/* |
| 85 |
* |
| 86 |
*/ |
| 87 |
|
| 88 |
static const DSA_METHOD dsa_null_method = { |
| 89 |
"hcrypto null DSA", |
| 90 |
NULL, |
| 91 |
NULL, |
| 92 |
NULL, |
| 93 |
NULL, |
| 94 |
NULL, |
| 95 |
NULL, |
| 96 |
NULL, |
| 97 |
0, |
| 98 |
NULL |
| 99 |
}; |
| 100 |
|
| 101 |
const DSA_METHOD * |
| 102 |
DSA_null_method(void) |
| 103 |
{ |
| 104 |
return &dsa_null_method; |
| 105 |
} |
| 106 |
|
| 107 |
|
| 108 |
const DSA_METHOD *dsa_default_mech = &dsa_null_method; |
| 109 |
|
| 110 |
void |
| 111 |
DSA_set_default_method(const DSA_METHOD *mech) |
| 112 |
{ |
| 113 |
dsa_default_mech = mech; |
| 114 |
} |
| 115 |
|
| 116 |
const DSA_METHOD * |
| 117 |
DSA_get_default_method(void) |
| 118 |
{ |
| 119 |
return dsa_default_mech; |
| 120 |
} |
| 121 |
|
| 122 |
int |
| 123 |
DSA_verify(int type, const unsigned char * digest, int digest_len, |
| 124 |
const unsigned char *sig, int sig_len, DSA *dsa) |
| 125 |
{ |
| 126 |
return -1; |
| 127 |
} |