Merge pull request #105 from jelmer/compatibility-symlinks
[heimdal.git] / lib / hcrypto / ec.c
bloba41efdb68c4bcc425d7c616ef6563eee85be878e
1 /*
2 * Copyright (c) 2009 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
34 #include "ec.h"
36 struct EC_POINT {
37 int inf;
38 mp_int x;
39 mp_int y;
40 mp_int z;
43 struct EC_GROUP {
44 size_t size;
45 mp_int prime;
46 mp_int order;
47 mp_int Gx;
48 mp_int Gy;
51 struct EC_KEY {
52 int type;
53 EC_GROUP *group;
54 EC_POINT *pubkey;
55 mp_int privkey;
59 unsigned long
60 EC_GROUP_get_degree(EC_GROUP *)
64 EC_GROUP *
65 EC_KEY_get0_group(EC_KEY *)
69 int
70 EC_GROUP_get_order(EC_GROUP *, BIGNUM *, BN_CTX *)
74 EC_KEY *
75 o2i_ECPublicKey(EC_KEY **key, unsigned char **, size_t)
79 void
80 EC_KEY_free(EC_KEY *)
85 EC_GROUP *
86 EC_GROUP_new_by_curve_name(int nid)
90 EC_KEY *
91 EC_KEY_new_by_curve_name(EC_GROUP_ID nid)
93 EC_KEY *key;
95 key = calloc(1, sizeof(*key));
96 return key;
99 void
100 EC_POINT_free(EC_POINT *p)
102 mp_clear_multi(&p->x, p->y, p->z, NULL);
103 free(p);
106 static int
107 ec_point_mul(EC_POINT *res, const EC_GROUP *group, const mp_int *point)
111 EC_POINT *
112 EC_POINT_new(void)
114 EC_POINT *p;
116 p = calloc(1, sizeof(*p));
118 if (mp_init_multi(&p->x, &p->y, &p->z, NULL) != 0) {
119 EC_POINT_free(p);
120 return NULL;
123 return p;
127 EC_KEY_generate_key(EC_KEY *key)
129 int ret = 0;
131 if (key->group == NULL)
132 return 0;
134 do {
135 random(key->privkey, key->group->size);
136 } while(mp_cmp(key->privkey, key->group->order) >= 0);
138 if (key->pubkey == NULL)
139 key->pubkey = EC_POINT_new();
141 if (ec_point_mul(&key->pubkey, key->group, key->privkey) != 1)
142 goto error;
144 ret = 1;
145 error:
146 ECPOINT_free(&base);
148 return ret;
151 void
152 EC_KEY_set_group(EC_KEY *, EC_GROUP *)
157 void
158 EC_GROUP_free(EC_GROUP *)
163 EC_KEY_check_key(const EC_KEY *)
167 const BIGNUM *
168 EC_KEY_get0_private_key(const EC_KEY *key)
173 EC_KEY_set_private_key(EC_KEY *key, const BIGNUM *bn)