Annotation of src/usr.bin/ssh/dh.c, Revision 1.10
1.1 provos 1: /*
2: * Copyright (c) 2000 Niels Provos. All rights reserved.
3: *
4: * Redistribution and use in source and binary forms, with or without
5: * modification, are permitted provided that the following conditions
6: * are met:
7: * 1. Redistributions of source code must retain the above copyright
8: * notice, this list of conditions and the following disclaimer.
9: * 2. Redistributions in binary form must reproduce the above copyright
10: * notice, this list of conditions and the following disclaimer in the
11: * documentation and/or other materials provided with the distribution.
12: *
13: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
15: * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
16: * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
17: * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
18: * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
19: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
20: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
21: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
22: * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
23: */
24:
25: #include "includes.h"
1.10 ! provos 26: RCSID("$OpenBSD: dh.c,v 1.9 2001/03/27 17:46:49 provos Exp $");
1.1 provos 27:
28: #include "xmalloc.h"
29:
30: #include <openssl/bn.h>
31: #include <openssl/dh.h>
32: #include <openssl/evp.h>
33:
34: #include "buffer.h"
1.6 markus 35: #include "cipher.h"
1.1 provos 36: #include "kex.h"
37: #include "dh.h"
1.5 markus 38: #include "pathnames.h"
1.6 markus 39: #include "log.h"
40: #include "misc.h"
1.1 provos 41:
42: int
43: parse_prime(int linenum, char *line, struct dhgroup *dhg)
44: {
45: char *cp, *arg;
46: char *strsize, *gen, *prime;
47:
48: cp = line;
49: arg = strdelim(&cp);
50: /* Ignore leading whitespace */
51: if (*arg == '\0')
52: arg = strdelim(&cp);
53: if (!*arg || *arg == '#')
54: return 0;
55:
56: /* time */
57: if (cp == NULL || *arg == '\0')
58: goto fail;
59: arg = strsep(&cp, " "); /* type */
60: if (cp == NULL || *arg == '\0')
61: goto fail;
62: arg = strsep(&cp, " "); /* tests */
63: if (cp == NULL || *arg == '\0')
64: goto fail;
65: arg = strsep(&cp, " "); /* tries */
66: if (cp == NULL || *arg == '\0')
67: goto fail;
68: strsize = strsep(&cp, " "); /* size */
69: if (cp == NULL || *strsize == '\0' ||
70: (dhg->size = atoi(strsize)) == 0)
71: goto fail;
1.9 provos 72: /* The whole group is one bit larger */
73: dhg->size++;
1.1 provos 74: gen = strsep(&cp, " "); /* gen */
75: if (cp == NULL || *gen == '\0')
76: goto fail;
77: prime = strsep(&cp, " "); /* prime */
78: if (cp != NULL || *prime == '\0')
79: goto fail;
80:
81: dhg->g = BN_new();
82: dhg->p = BN_new();
1.10 ! provos 83: if (BN_hex2bn(&dhg->g, gen) < 0)
! 84: goto failclean;
! 85:
! 86: if (BN_hex2bn(&dhg->p, prime) < 0)
! 87: goto failclean;
! 88:
! 89: if (BN_num_bits(dhg->p) != dhg->size)
! 90: goto failclean;
1.1 provos 91:
92: return (1);
1.10 ! provos 93:
! 94: failclean:
! 95: BN_free(dhg->g);
! 96: BN_free(dhg->p);
1.1 provos 97: fail:
1.7 millert 98: error("Bad prime description in line %d", linenum);
1.1 provos 99: return (0);
100: }
101:
102: DH *
1.9 provos 103: choose_dh(int min, int wantbits, int max)
1.1 provos 104: {
105: FILE *f;
106: char line[1024];
107: int best, bestcount, which;
108: int linenum;
109: struct dhgroup dhg;
110:
1.5 markus 111: f = fopen(_PATH_DH_PRIMES, "r");
1.1 provos 112: if (!f) {
1.5 markus 113: log("WARNING: %s does not exist, using old prime", _PATH_DH_PRIMES);
1.1 provos 114: return (dh_new_group1());
115: }
116:
117: linenum = 0;
118: best = bestcount = 0;
119: while (fgets(line, sizeof(line), f)) {
120: linenum++;
121: if (!parse_prime(linenum, line, &dhg))
122: continue;
123: BN_free(dhg.g);
124: BN_free(dhg.p);
125:
1.9 provos 126: if (dhg.size > max || dhg.size < min)
127: continue;
128:
129: if ((dhg.size > wantbits && dhg.size < best) ||
130: (dhg.size > best && best < wantbits)) {
1.1 provos 131: best = dhg.size;
132: bestcount = 0;
133: }
134: if (dhg.size == best)
135: bestcount++;
136: }
137: fclose (f);
138:
139: if (bestcount == 0) {
1.9 provos 140: log("WARNING: no suitable primes in %s", _PATH_DH_PRIMES);
141: return (NULL);
1.1 provos 142: }
143:
1.5 markus 144: f = fopen(_PATH_DH_PRIMES, "r");
1.1 provos 145: if (!f) {
1.8 stevesk 146: fatal("WARNING: %s disappeared, giving up", _PATH_DH_PRIMES);
1.1 provos 147: }
148:
149: linenum = 0;
150: which = arc4random() % bestcount;
151: while (fgets(line, sizeof(line), f)) {
152: if (!parse_prime(linenum, line, &dhg))
1.9 provos 153: continue;
154: if (dhg.size > max || dhg.size < min)
1.1 provos 155: continue;
156: if (dhg.size != best)
157: continue;
158: if (linenum++ != which) {
159: BN_free(dhg.g);
160: BN_free(dhg.p);
161: continue;
162: }
163: break;
164: }
165: fclose(f);
166:
167: return (dh_new_group(dhg.g, dhg.p));
168: }
![[BACK]](/icons/back.gif){kind=icon}
Return to dh.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / ssh