1/*	$NetBSD: ec.c,v 1.1.1.1 2011/04/13 18:14:49 elric Exp $	*/
2
3/*
4 * Copyright (c) 2009 Kungliga Tekniska H�gskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 *
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 *
19 * 3. Neither the name of the Institute nor the names of its contributors
20 *    may be used to endorse or promote products derived from this software
21 *    without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#include "ec.h"
37
38struct EC_POINT {
39    int inf;
40    mp_int x;
41    mp_int y;
42    mp_int z;
43};
44
45struct EC_GROUP {
46    size_t size;
47    mp_int prime;
48    mp_int order;
49    mp_int Gx;
50    mp_int Gy;
51};
52
53struct EC_KEY {
54    int type;
55    EC_GROUP *group;
56    EC_POINT *pubkey;
57    mp_int privkey;
58};
59
60
61unsigned long
62EC_GROUP_get_degree(EC_GROUP *)
63{
64}
65
66EC_GROUP *
67EC_KEY_get0_group(EC_KEY *)
68{
69}
70
71int
72EC_GROUP_get_order(EC_GROUP *, BIGNUM *, BN_CTX *)
73{
74}
75
76EC_KEY *
77o2i_ECPublicKey(EC_KEY **key, unsigned char **, size_t)
78{
79}
80
81void
82EC_KEY_free(EC_KEY *)
83{
84
85}
86
87EC_GROUP *
88EC_GROUP_new_by_curve_name(int nid)
89{
90}
91
92EC_KEY *
93EC_KEY_new_by_curve_name(EC_GROUP_ID nid)
94{
95    EC_KEY *key;
96
97    key = calloc(1, sizeof(*key));
98    return key;
99}
100
101void
102EC_POINT_free(EC_POINT *p)
103{
104    mp_clear_multi(&p->x, p->y, p->z, NULL);
105    free(p);
106}
107
108static int
109ec_point_mul(EC_POINT *res, const EC_GROUP *group, const mp_int *point)
110{
111}
112
113EC_POINT *
114EC_POINT_new(void)
115{
116    EC_POINT *p;
117
118    p = calloc(1, sizeof(*p));
119
120    if (mp_init_multi(&p->x, &p->y, &p->z, NULL) != 0) {
121	EC_POINT_free(p);
122	return NULL;
123    }
124
125    return p;
126}
127
128int
129EC_KEY_generate_key(EC_KEY *key)
130{
131    int ret = 0;
132
133    if (key->group == NULL)
134	return 0;
135
136    do {
137	random(key->privkey, key->group->size);
138    } while(mp_cmp(key->privkey, key->group->order) >= 0);
139
140    if (key->pubkey == NULL)
141	key->pubkey = EC_POINT_new();
142
143    if (ec_point_mul(&key->pubkey, key->group, key->privkey) != 1)
144	goto error;
145
146    ret = 1;
147 error:
148    ECPOINT_free(&base);
149
150    return ret;
151}
152
153void
154EC_KEY_set_group(EC_KEY *, EC_GROUP *)
155{
156
157}
158
159void
160EC_GROUP_free(EC_GROUP *)
161{
162}
163
164int
165EC_KEY_check_key(const EC_KEY *)
166{
167}
168
169const BIGNUM *
170EC_KEY_get0_private_key(const EC_KEY *key)
171{
172}
173
174int
175EC_KEY_set_private_key(EC_KEY *key, const BIGNUM *bn)
176{
177}
178