1 /* $OpenBSD: dsa_asn1.c,v 1.20 2017/05/02 03:59:44 deraadt Exp $ */
2 /* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 2000-2005 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * licensing@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
62 #include <openssl/asn1.h>
63 #include <openssl/asn1t.h>
64 #include <openssl/dsa.h>
65 #include <openssl/err.h>
67 /* Override the default new methods */
69 sig_cb(int operation
, ASN1_VALUE
**pval
, const ASN1_ITEM
*it
, void *exarg
)
71 if (operation
== ASN1_OP_NEW_PRE
) {
74 sig
= malloc(sizeof(DSA_SIG
));
76 DSAerror(ERR_R_MALLOC_FAILURE
);
81 *pval
= (ASN1_VALUE
*)sig
;
87 static const ASN1_AUX DSA_SIG_aux
= {
95 static const ASN1_TEMPLATE DSA_SIG_seq_tt
[] = {
99 .offset
= offsetof(DSA_SIG
, r
),
106 .offset
= offsetof(DSA_SIG
, s
),
112 const ASN1_ITEM DSA_SIG_it
= {
113 .itype
= ASN1_ITYPE_SEQUENCE
,
114 .utype
= V_ASN1_SEQUENCE
,
115 .templates
= DSA_SIG_seq_tt
,
116 .tcount
= sizeof(DSA_SIG_seq_tt
) / sizeof(ASN1_TEMPLATE
),
117 .funcs
= &DSA_SIG_aux
,
118 .size
= sizeof(DSA_SIG
),
124 d2i_DSA_SIG(DSA_SIG
**a
, const unsigned char **in
, long len
)
126 return (DSA_SIG
*)ASN1_item_d2i((ASN1_VALUE
**)a
, in
, len
,
131 i2d_DSA_SIG(const DSA_SIG
*a
, unsigned char **out
)
133 return ASN1_item_i2d((ASN1_VALUE
*)a
, out
, &DSA_SIG_it
);
136 /* Override the default free and new methods */
138 dsa_cb(int operation
, ASN1_VALUE
**pval
, const ASN1_ITEM
*it
, void *exarg
)
140 if (operation
== ASN1_OP_NEW_PRE
) {
141 *pval
= (ASN1_VALUE
*)DSA_new();
145 } else if (operation
== ASN1_OP_FREE_PRE
) {
146 DSA_free((DSA
*)*pval
);
153 static const ASN1_AUX DSAPrivateKey_aux
= {
161 static const ASN1_TEMPLATE DSAPrivateKey_seq_tt
[] = {
165 .offset
= offsetof(DSA
, version
),
166 .field_name
= "version",
172 .offset
= offsetof(DSA
, p
),
179 .offset
= offsetof(DSA
, q
),
186 .offset
= offsetof(DSA
, g
),
193 .offset
= offsetof(DSA
, pub_key
),
194 .field_name
= "pub_key",
200 .offset
= offsetof(DSA
, priv_key
),
201 .field_name
= "priv_key",
206 const ASN1_ITEM DSAPrivateKey_it
= {
207 .itype
= ASN1_ITYPE_SEQUENCE
,
208 .utype
= V_ASN1_SEQUENCE
,
209 .templates
= DSAPrivateKey_seq_tt
,
210 .tcount
= sizeof(DSAPrivateKey_seq_tt
) / sizeof(ASN1_TEMPLATE
),
211 .funcs
= &DSAPrivateKey_aux
,
218 d2i_DSAPrivateKey(DSA
**a
, const unsigned char **in
, long len
)
220 return (DSA
*)ASN1_item_d2i((ASN1_VALUE
**)a
, in
, len
,
225 i2d_DSAPrivateKey(const DSA
*a
, unsigned char **out
)
227 return ASN1_item_i2d((ASN1_VALUE
*)a
, out
, &DSAPrivateKey_it
);
230 static const ASN1_AUX DSAparams_aux
= {
238 static const ASN1_TEMPLATE DSAparams_seq_tt
[] = {
242 .offset
= offsetof(DSA
, p
),
249 .offset
= offsetof(DSA
, q
),
256 .offset
= offsetof(DSA
, g
),
262 const ASN1_ITEM DSAparams_it
= {
263 .itype
= ASN1_ITYPE_SEQUENCE
,
264 .utype
= V_ASN1_SEQUENCE
,
265 .templates
= DSAparams_seq_tt
,
266 .tcount
= sizeof(DSAparams_seq_tt
) / sizeof(ASN1_TEMPLATE
),
267 .funcs
= &DSAparams_aux
,
274 d2i_DSAparams(DSA
**a
, const unsigned char **in
, long len
)
276 return (DSA
*)ASN1_item_d2i((ASN1_VALUE
**)a
, in
, len
,
281 i2d_DSAparams(const DSA
*a
, unsigned char **out
)
283 return ASN1_item_i2d((ASN1_VALUE
*)a
, out
, &DSAparams_it
);
287 d2i_DSAparams_bio(BIO
*bp
, DSA
**a
)
289 return ASN1_item_d2i_bio(&DSAparams_it
, bp
, a
);
293 i2d_DSAparams_bio(BIO
*bp
, DSA
*a
)
295 return ASN1_item_i2d_bio(&DSAparams_it
, bp
, a
);
299 d2i_DSAparams_fp(FILE *fp
, DSA
**a
)
301 return ASN1_item_d2i_fp(&DSAparams_it
, fp
, a
);
305 i2d_DSAparams_fp(FILE *fp
, DSA
*a
)
307 return ASN1_item_i2d_fp(&DSAparams_it
, fp
, a
);
311 * DSA public key is a bit trickier... its effectively a CHOICE type
312 * decided by a field called write_params which can either write out
313 * just the public key as an INTEGER or the parameters and public key
317 static const ASN1_TEMPLATE dsa_pub_internal_seq_tt
[] = {
321 .offset
= offsetof(DSA
, pub_key
),
322 .field_name
= "pub_key",
328 .offset
= offsetof(DSA
, p
),
335 .offset
= offsetof(DSA
, q
),
342 .offset
= offsetof(DSA
, g
),
348 const ASN1_ITEM dsa_pub_internal_it
= {
349 .itype
= ASN1_ITYPE_SEQUENCE
,
350 .utype
= V_ASN1_SEQUENCE
,
351 .templates
= dsa_pub_internal_seq_tt
,
352 .tcount
= sizeof(dsa_pub_internal_seq_tt
) / sizeof(ASN1_TEMPLATE
),
358 static const ASN1_AUX DSAPublicKey_aux
= {
366 static const ASN1_TEMPLATE DSAPublicKey_ch_tt
[] = {
370 .offset
= offsetof(DSA
, pub_key
),
371 .field_name
= "pub_key",
375 .flags
= 0 | ASN1_TFLG_COMBINE
,
379 .item
= &dsa_pub_internal_it
,
383 const ASN1_ITEM DSAPublicKey_it
= {
384 .itype
= ASN1_ITYPE_CHOICE
,
385 .utype
= offsetof(DSA
, write_params
),
386 .templates
= DSAPublicKey_ch_tt
,
387 .tcount
= sizeof(DSAPublicKey_ch_tt
) / sizeof(ASN1_TEMPLATE
),
388 .funcs
= &DSAPublicKey_aux
,
395 d2i_DSAPublicKey(DSA
**a
, const unsigned char **in
, long len
)
397 return (DSA
*)ASN1_item_d2i((ASN1_VALUE
**)a
, in
, len
,
402 i2d_DSAPublicKey(const DSA
*a
, unsigned char **out
)
404 return ASN1_item_i2d((ASN1_VALUE
*)a
, out
, &DSAPublicKey_it
);
408 DSAparams_dup(DSA
*dsa
)
410 return ASN1_item_dup(&DSAparams_it
, dsa
);
414 DSA_sign(int type
, const unsigned char *dgst
, int dlen
, unsigned char *sig
,
415 unsigned int *siglen
, DSA
*dsa
)
419 s
= DSA_do_sign(dgst
, dlen
, dsa
);
424 *siglen
= i2d_DSA_SIG(s
,&sig
);
430 * data has already been hashed (probably with SHA or SHA-1).
432 * 1: correct signature
433 * 0: incorrect signature
437 DSA_verify(int type
, const unsigned char *dgst
, int dgst_len
,
438 const unsigned char *sigbuf
, int siglen
, DSA
*dsa
)
441 unsigned char *der
= NULL
;
442 const unsigned char *p
= sigbuf
;
449 if (d2i_DSA_SIG(&s
, &p
, siglen
) == NULL
)
451 /* Ensure signature uses DER and doesn't have trailing garbage */
452 derlen
= i2d_DSA_SIG(s
, &der
);
453 if (derlen
!= siglen
|| memcmp(sigbuf
, der
, derlen
))
455 ret
= DSA_do_verify(dgst
, dgst_len
, s
, dsa
);
457 freezero(der
, derlen
);