3 * $Id: dh-gen.c,v 1.1 2000/02/12 18:21:02 mdw Exp $
5 * Generate Diffie-Hellman parameters
7 * (c) 1999 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.1 2000/02/12 18:21:02 mdw
34 * Overhaul of key management (again).
38 /*----- Header files ------------------------------------------------------*/
50 /*----- Main code ---------------------------------------------------------*/
54 * Arguments: @dh_param *dp@ = pointer to output parameter block
55 * @unsigned ql@ = length of %$q$% in bits, or zero
56 * @unsigned pl@ = length of %$p$% in bits
57 * @unsigned steps@ = number of steps to go
58 * @grand *r@ = random number source
59 * @pgen_proc *event@ = event handler function
60 * @void *ectx@ = argument for the event handler
62 * Returns: @PGEN_DONE@ if it worked, @PGEN_ABORT@ if it didn't.
64 * Use: Generates Diffie-Hellman parameters.
66 * The parameters are a prime %$q$%, relatively small, and a
67 * large prime %$p = kq + 1$% for some %$k$%, together with a
68 * generator %$g$% of the cyclic subgroup of order %$q$%. These
69 * are actually the same as the DSA parameter set, but the
70 * generation algorithm is different. Also, if @ql@ is zero,
71 * this algorithm forces %$k = 2$%, and chooses %$g = 4$%. Make
72 * sure you have something interesting to do if you choose this
76 int dh_gen(dh_param
*dp
, unsigned ql
, unsigned pl
, unsigned steps
, grand
*r
,
77 pgen_proc
*event
, void *ectx
)
79 /* --- If @ql@ is zero, do the time consuming safe-prime thing --- */
84 mp
*m
= mprand(MP_NEW
, pl
, r
, 3);
85 dp
->p
= pgen("p", MP_NEW
, m
, event
, ectx
, steps
, pgen_safestep
, &c
.c
,
86 rabin_iters(pl
), pgen_safetest
, &c
);
90 dp
->q
= mp_lsr(MP_NEW
, dp
->p
, 1);
95 /* --- Otherwise the job is much simpler --- *
97 * But doesn't look it...
109 /* --- Generate @q@ first --- */
112 m
= mprand(MP_NEW
, ql
, r
, 1);
113 dp
->q
= pgen("q", MP_NEW
, m
, event
, ectx
, steps
, pgen_filter
, &c
,
114 rabin_iters(ql
), pgen_test
, &rb
);
118 /* --- Now pick a suitable @p@ --- */
120 m
= mp_lsl(m
, dp
->q
, 1);
121 x
= mprand(MP_NEW
, pl
, r
, 0);
122 y
= MP_NEW
; mp_div(0, &y
, x
, m
);
124 x
= mp_add(x
, x
, MP_ONE
);
126 pfilt_create(&c
.f
, m
);
128 dp
->p
= pgen("p", MP_NEW
, x
, event
, ectx
, steps
, pgen_jump
, &j
,
129 rabin_iters(pl
), pgen_test
, &rb
);
135 /* --- And finally a suitable @g@ --- */
137 mpmont_create(&p
.mm
, dp
->p
);
138 mp_div(&m
, 0, dp
->p
, dp
->q
);
142 dp
->g
= pgen("g", MP_NEW
, MP_NEW
, event
, ectx
, 0, prim_step
, &i
,
144 mpmont_destroy(&p
.mm
);
150 /* --- Tidy up --- */
162 /*----- That's all, folks -------------------------------------------------*/