| 1 |
/* Copyright (C) 1995-1998 Eric Young ([email protected]) |
| 2 |
* All rights reserved. |
| 3 |
* |
| 4 |
* This package is an SSL implementation written |
| 5 |
* by Eric Young ([email protected]). |
| 6 |
* The implementation was written so as to conform with Netscapes SSL. |
| 7 |
* |
| 8 |
* This library is free for commercial and non-commercial use as long as |
| 9 |
* the following conditions are aheared to. The following conditions |
| 10 |
* apply to all code found in this distribution, be it the RC4, RSA, |
| 11 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 12 |
* included with this distribution is covered by the same copyright terms |
| 13 |
* except that the holder is Tim Hudson ([email protected]). |
| 14 |
* |
| 15 |
* Copyright remains Eric Young's, and as such any Copyright notices in |
| 16 |
* the code are not to be removed. |
| 17 |
* If this package is used in a product, Eric Young should be given attribution |
| 18 |
* as the author of the parts of the library used. |
| 19 |
* This can be in the form of a textual message at program startup or |
| 20 |
* in documentation (online or textual) provided with the package. |
| 21 |
* |
| 22 |
* Redistribution and use in source and binary forms, with or without |
| 23 |
* modification, are permitted provided that the following conditions |
| 24 |
* are met: |
| 25 |
* 1. Redistributions of source code must retain the copyright |
| 26 |
* notice, this list of conditions and the following disclaimer. |
| 27 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 28 |
* notice, this list of conditions and the following disclaimer in the |
| 29 |
* documentation and/or other materials provided with the distribution. |
| 30 |
* 3. All advertising materials mentioning features or use of this software |
| 31 |
* must display the following acknowledgement: |
| 32 |
* "This product includes cryptographic software written by |
| 33 |
* Eric Young ([email protected])" |
| 34 |
* The word 'cryptographic' can be left out if the rouines from the library |
| 35 |
* being used are not cryptographic related :-). |
| 36 |
* 4. If you include any Windows specific code (or a derivative thereof) from |
| 37 |
* the apps directory (application code) you must include an acknowledgement: |
| 38 |
* "This product includes software written by Tim Hudson ([email protected])" |
| 39 |
* |
| 40 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 41 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 42 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 43 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 44 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 45 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 46 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 47 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 48 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 49 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 50 |
* SUCH DAMAGE. |
| 51 |
* |
| 52 |
* The licence and distribution terms for any publically available version or |
| 53 |
* derivative of this code cannot be changed. i.e. this code cannot simply be |
| 54 |
* copied and put under another distribution licence |
| 55 |
* [including the GNU Public Licence.] */ |
| 56 |
|
| 57 |
#include <openssl/asn1.h> |
| 58 |
|
| 59 |
#include <openssl/asn1t.h> |
| 60 |
#include <openssl/bn.h> |
| 61 |
|
| 62 |
/* |
| 63 |
* Custom primitive type for BIGNUM handling. This reads in an ASN1_INTEGER |
| 64 |
* as a BIGNUM directly. Currently it ignores the sign which isn't a problem |
| 65 |
* since all BIGNUMs used are non negative and anything that looks negative |
| 66 |
* is normally due to an encoding error. |
| 67 |
*/ |
| 68 |
|
| 69 |
#define BN_SENSITIVE 1 |
| 70 |
|
| 71 |
static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it); |
| 72 |
static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it); |
| 73 |
|
| 74 |
static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, |
| 75 |
const ASN1_ITEM *it); |
| 76 |
static int bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
| 77 |
int utype, char *free_cont, const ASN1_ITEM *it); |
| 78 |
|
| 79 |
static const ASN1_PRIMITIVE_FUNCS bignum_pf = { |
| 80 |
NULL, 0, |
| 81 |
bn_new, |
| 82 |
bn_free, |
| 83 |
0, |
| 84 |
bn_c2i, |
| 85 |
bn_i2c, |
| 86 |
NULL /* prim_print */ , |
| 87 |
}; |
| 88 |
|
| 89 |
ASN1_ITEM_start(BIGNUM) |
| 90 |
ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &bignum_pf, 0, "BIGNUM" |
| 91 |
ASN1_ITEM_end(BIGNUM) |
| 92 |
|
| 93 |
ASN1_ITEM_start(CBIGNUM) |
| 94 |
ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &bignum_pf, BN_SENSITIVE, "BIGNUM" |
| 95 |
ASN1_ITEM_end(CBIGNUM) |
| 96 |
|
| 97 |
static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) |
| 98 |
{ |
| 99 |
*pval = (ASN1_VALUE *)BN_new(); |
| 100 |
if (*pval) |
| 101 |
return 1; |
| 102 |
else |
| 103 |
return 0; |
| 104 |
} |
| 105 |
|
| 106 |
static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
| 107 |
{ |
| 108 |
if (!*pval) |
| 109 |
return; |
| 110 |
if (it->size & BN_SENSITIVE) |
| 111 |
BN_clear_free((BIGNUM *)*pval); |
| 112 |
else |
| 113 |
BN_free((BIGNUM *)*pval); |
| 114 |
*pval = NULL; |
| 115 |
} |
| 116 |
|
| 117 |
static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, |
| 118 |
const ASN1_ITEM *it) |
| 119 |
{ |
| 120 |
BIGNUM *bn; |
| 121 |
int pad; |
| 122 |
if (!*pval) |
| 123 |
return -1; |
| 124 |
bn = (BIGNUM *)*pval; |
| 125 |
/* If MSB set in an octet we need a padding byte */ |
| 126 |
if (BN_num_bits(bn) & 0x7) |
| 127 |
pad = 0; |
| 128 |
else |
| 129 |
pad = 1; |
| 130 |
if (cont) { |
| 131 |
if (pad) |
| 132 |
*cont++ = 0; |
| 133 |
BN_bn2bin(bn, cont); |
| 134 |
} |
| 135 |
return pad + BN_num_bytes(bn); |
| 136 |
} |
| 137 |
|
| 138 |
static int bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
| 139 |
int utype, char *free_cont, const ASN1_ITEM *it) |
| 140 |
{ |
| 141 |
BIGNUM *bn; |
| 142 |
if (!*pval) { |
| 143 |
if (!bn_new(pval, it)) { |
| 144 |
return 0; |
| 145 |
} |
| 146 |
} |
| 147 |
bn = (BIGNUM *)*pval; |
| 148 |
if (!BN_bin2bn(cont, len, bn)) { |
| 149 |
bn_free(pval, it); |
| 150 |
return 0; |
| 151 |
} |
| 152 |
return 1; |
| 153 |
} |