Oops. Fix formatting. :-S
[u/mdw/catacomb] / g-ec.c
CommitLineData
34e4f738 1/* -*-c-*-
2 *
02d7884d 3 * $Id: g-ec.c,v 1.2 2004/04/03 03:32:05 mdw Exp $
34e4f738 4 *
5 * Abstraction for elliptic curve groups
6 *
7 * (c) 2004 Straylight/Edgeware
8 */
9
10/*----- Licensing notice --------------------------------------------------*
11 *
12 * This file is part of Catacomb.
13 *
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.
18 *
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.
23 *
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,
27 * MA 02111-1307, USA.
28 */
29
30/*----- Revision history --------------------------------------------------*
31 *
32 * $Log: g-ec.c,v $
02d7884d 33 * Revision 1.2 2004/04/03 03:32:05 mdw
34 * General robustification.
35 *
34e4f738 36 * Revision 1.1 2004/04/01 12:50:09 mdw
37 * Add cyclic group abstraction, with test code. Separate off exponentation
38 * functions for better static linking. Fix a buttload of bugs on the way.
39 * Generally ensure that negative exponents do inversion correctly. Add
40 * table of standard prime-field subgroups. (Binary field subgroups are
41 * currently unimplemented but easy to add if anyone ever finds a good one.)
42 *
43 */
44
45/*----- Header files ------------------------------------------------------*/
46
47#include <ctype.h>
48
49#include <mLib/sub.h>
50
51#define ge ec
52#include "group.h"
53
54/*----- Data structures ---------------------------------------------------*/
55
56typedef struct gctx {
57 group g;
58 ec id, gen;
59 ec_info ei;
60} gctx;
61
62/*----- Main code ---------------------------------------------------------*/
63
64/* --- Group operations --- */
65
66static void gdestroygroup(group *gg) {
67 gctx *g = (gctx *)gg;
68 EC_DESTROY(&g->gen);
69 ec_freeinfo(&g->ei);
70 DESTROY(g);
71}
72
73static ec *gcreate(group *gg)
74 { ec *x = CREATE(ec); EC_CREATE(x); return (x); }
75
76static void gcopy(group *gg, ec *d, ec *x) { EC_COPY(d, x); }
77
78static void gburn(group *gg, ec *x) { if (x->x) (x->x)->f |= MP_BURN; }
79
80static void gdestroy(group *gg, ec *x) { EC_DESTROY(x); DESTROY(x); }
81
82static int gsamep(group *gg, group *hh) {
83 gctx *g = (gctx *)gg, *h = (gctx *)hh;
84 return (ec_sameinfop(&g->ei, &h->ei));
85}
86
87static int geq(group *gg, ec *x, ec *y) {
88 gctx *g = (gctx *)gg; EC_FIX(g->ei.c, x, x); EC_FIX(g->ei.c, y, y);
89 return (EC_EQ(x, y));
90}
91
92static int gidentp(group *gg, ec *x) { return (EC_ATINF(x)); }
93
94static const char *gcheck(group *gg, grand *gr)
95 { gctx *g = (gctx *)gg; return (ec_checkinfo(&g->ei, gr)); }
96
97static void gmul(group *gg, ec *d, ec *x, ec *y)
98 { gctx *g = (gctx *)gg; EC_ADD(g->ei.c, d, x, y); }
99
100static void gsqr(group *gg, ec *d, ec *x)
101 { gctx *g = (gctx *)gg; EC_DBL(g->ei.c, d, x); }
102
103static void ginv(group *gg, ec *d, ec *x)
104 { gctx *g = (gctx *)gg; EC_NEG(g->ei.c, d, x); }
105
106static void gdiv(group *gg, ec *d, ec *x, ec *y)
107 { gctx *g = (gctx *)gg; EC_SUB(g->ei.c, d, x, y); }
108
109static void gexp(group *gg, ec *d, ec *x, mp *n)
110 { gctx *g = (gctx *)gg; ec_imul(g->ei.c, d, x, n); }
111
112static void gmexp(group *gg, ec *d, const group_expfactor *f, size_t n) {
113 gctx *g = (gctx *)gg; size_t i;
114 ec_mulfactor *ff = xmalloc(n * sizeof(ec_mulfactor));
115 for (i = 0; i < n; i++) { ff[i].base = *f[i].base; ff[i].exp = f[i].exp; }
116 ec_immul(g->ei.c, d, ff, n); xfree(ff);
117}
118
119static int gread(group *gg, ec *d, const mptext_ops *ops, void *p) {
120 gctx *g = (gctx *)gg;
121 ec t = EC_INIT;
122 int rc = -1;
123 int ch;
124
125 ch = ops->get(p);
126 if (tolower(ch) == 'i') {
127 if (tolower(ops->get(p)) != 'n' || tolower(ops->get(p)) != 'f')
128 return (-1);
129 EC_SETINF(d);
130 return (0);
131 }
132 ops->unget(ch, p);
133 if ((t.x = mp_read(MP_NEW, 0, ops, p)) == 0) goto done;
134 do ch = ops->get(p); while (ch == ',' || isspace(ch)); ops->unget(ch, p);
135 if ((t.y = mp_read(MP_NEW, 0, ops, p)) == 0) goto done;
136 EC_IN(g->ei.c, &t, &t);
137 if (EC_CHECK(g->ei.c, &t)) goto done;
138 EC_COPY(d, &t); rc = 0;
139 EC_DESTROY(&t);
140done:
141 return (rc);
142}
143
144static int gwrite(group *gg, ec *x, const mptext_ops *ops, void *p) {
145 gctx *g = (gctx *)gg; int rc = -1; ec t = EC_INIT; EC_OUT(g->ei.c, &t, x);
146 if (EC_ATINF(&t)) rc = ops->put("inf", 3, p);
147 else if (!ops->put("0x", 2, p) && !mp_write(t.x, 16, ops, p) &&
148 !ops->put(", 0x", 4, p) && !mp_write(t.y, 16, ops, p)) rc = 0;
149 EC_DESTROY(&t); return (rc);
150}
151
152static mp *gtoint(group *gg, mp *d, ec *x) {
153 gctx *g = (gctx *)gg; ec t = EC_INIT; mp *i; if (EC_ATINF(x)) i = 0;
154 else { EC_OUT(g->ei.c, &t, x); i = MP_COPY(t.x); EC_DESTROY(&t); }
155 mp_drop(d); return (i);
156}
157
158static int gfromint(group *gg, ec *d, mp *x) {
159 gctx *g = (gctx *)gg; ec t = EC_INIT;
160 if (!ec_find(g->ei.c, &t, x)) return (-1);
161 EC_IN(g->ei.c, d, &t); EC_DESTROY(&t); return (0);
162}
163
164static int gtoec(group *gg, ec *d, ec *x)
165 { gctx *g = (gctx *)gg; EC_OUT(g->ei.c, d, x); return (0); }
166
167static int gfromec(group *gg, ec *d, ec *x) {
168 gctx *g = (gctx *)gg; ec t = EC_INIT; int rc; EC_IN(g->ei.c, &t, x);
169 rc = EC_CHECK(g->ei.c, &t); if (!rc) EC_COPY(d, &t); EC_DESTROY(&t);
170 return (rc);
171}
172
173static int gtobuf(group *gg, buf *b, ec *x) {
174 gctx *g = (gctx *)gg; ec t = EC_INIT; int rc;
175 EC_OUT(g->ei.c, &t, x); rc = buf_putec(b, &t); EC_DESTROY(&t); return (rc);
176}
177
178static int gfrombuf(group *gg, buf *b, ec *d) {
179 gctx *g = (gctx *)gg; ec t = EC_INIT; int rc;
180 if (buf_getec(b, &t)) return (-1);
181 EC_IN(g->ei.c, &t, &t); rc = EC_CHECK(g->ei.c, &t);
182 if (!rc) EC_COPY(d, &t); EC_DESTROY(&t); return (rc);
183}
184
185/* --- @group_ec@ --- *
186 *
187 * Arguments: @const ec_info *ei@ = elliptic curve parameters
188 *
189 * Returns: A pointer to the group.
190 *
191 * Use: Constructs an abstract group interface for an elliptic curve
192 * group. Group elements are @ec@ structures. The contents of
193 * the @ec_info@ structure becomes the property of the @group@
194 * object; you can (and should) free the structure itself, but
195 * calling @ec_freeinfo@ on it is not allowed.
196 */
197
198static const group_ops gops = {
199 GTY_EC,
200 gdestroygroup, gcreate, gcopy, gburn, gdestroy,
201 gsamep, geq, gidentp,
202 gcheck,
203 gmul, gsqr, ginv, gdiv, gexp, gmexp,
204 gread, gwrite,
205 gtoint, gfromint, gtoec, gfromec, gtobuf, gfrombuf
206};
207
208group *group_ec(const ec_info *ei)
209{
210 gctx *g = CREATE(gctx);
211
212 g->g.ops = &gops;
213 g->g.nbits = ei->c->f->nbits * 2;
214 g->g.noctets = ei->c->f->noctets * 2;
215 g->ei = *ei;
216 EC_CREATE(&g->id);
217 g->g.i = &g->id;
218 EC_CREATE(&g->gen);
02d7884d 219 g->g.g = &g->gen;
34e4f738 220 EC_IN(g->ei.c, &g->gen, &ei->g);
221 g->g.r = ei->r;
222 g->g.h = ei->h;
223 return (&g->g);
224}
225
226/*----- That's all, folks -------------------------------------------------*/