blob: 15d9ba34d9d639f7c8552ad3b5db81fd58b4de50 [file] [log] [blame]
Jarno Lamsa18987a42019-04-24 15:40:43 +03001/* ec_dh.c - TinyCrypt implementation of EC-DH */
2
3/*
4 * Copyright (c) 2014, Kenneth MacKay
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are met:
9 * * Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25 * POSSIBILITY OF SUCH DAMAGE.
26 */
27
28/*
29 * Copyright (C) 2017 by Intel Corporation, All Rights Reserved.
30 *
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions are met:
33 *
34 * - Redistributions of source code must retain the above copyright notice,
35 * this list of conditions and the following disclaimer.
36 *
37 * - Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 *
41 * - Neither the name of Intel Corporation nor the names of its contributors
42 * may be used to endorse or promote products derived from this software
43 * without specific prior written permission.
44 *
45 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
46 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
49 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
50 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
51 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
52 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
53 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
54 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
55 * POSSIBILITY OF SUCH DAMAGE.
56 */
Jarno Lamsa18987a42019-04-24 15:40:43 +030057#include <tinycrypt/ecc.h>
58#include <tinycrypt/ecc_dh.h>
59#include <string.h>
60
61#if default_RNG_defined
62static uECC_RNG_Function g_rng_function = &default_CSPRNG;
63#else
64static uECC_RNG_Function g_rng_function = 0;
65#endif
66
67int uECC_make_key_with_d(uint8_t *public_key, uint8_t *private_key,
68 unsigned int *d, uECC_Curve curve)
69{
70
71 uECC_word_t _private[NUM_ECC_WORDS];
72 uECC_word_t _public[NUM_ECC_WORDS * 2];
73
74 /* This function is designed for test purposes-only (such as validating NIST
75 * test vectors) as it uses a provided value for d instead of generating
76 * it uniformly at random. */
77 memcpy (_private, d, NUM_ECC_BYTES);
78
79 /* Computing public-key from private: */
80 if (EccPoint_compute_public_key(_public, _private, curve)) {
81
82 /* Converting buffers to correct bit order: */
83 uECC_vli_nativeToBytes(private_key,
84 BITS_TO_BYTES(curve->num_n_bits),
85 _private);
86 uECC_vli_nativeToBytes(public_key,
87 curve->num_bytes,
88 _public);
89 uECC_vli_nativeToBytes(public_key + curve->num_bytes,
90 curve->num_bytes,
91 _public + curve->num_words);
92
93 /* erasing temporary buffer used to store secret: */
94 memset(_private, 0, NUM_ECC_BYTES);
95
96 return 1;
97 }
98 return 0;
99}
100
101int uECC_make_key(uint8_t *public_key, uint8_t *private_key, uECC_Curve curve)
102{
103
104 uECC_word_t _random[NUM_ECC_WORDS * 2];
105 uECC_word_t _private[NUM_ECC_WORDS];
106 uECC_word_t _public[NUM_ECC_WORDS * 2];
107 uECC_word_t tries;
108
109 for (tries = 0; tries < uECC_RNG_MAX_TRIES; ++tries) {
110 /* Generating _private uniformly at random: */
111 uECC_RNG_Function rng_function = uECC_get_rng();
112 if (!rng_function ||
113 !rng_function((uint8_t *)_random, 2 * NUM_ECC_WORDS*uECC_WORD_SIZE)) {
114 return 0;
115 }
116
117 /* computing modular reduction of _random (see FIPS 186.4 B.4.1): */
118 uECC_vli_mmod(_private, _random, curve->n, BITS_TO_WORDS(curve->num_n_bits));
119
120 /* Computing public-key from private: */
121 if (EccPoint_compute_public_key(_public, _private, curve)) {
122
123 /* Converting buffers to correct bit order: */
124 uECC_vli_nativeToBytes(private_key,
125 BITS_TO_BYTES(curve->num_n_bits),
126 _private);
127 uECC_vli_nativeToBytes(public_key,
128 curve->num_bytes,
129 _public);
130 uECC_vli_nativeToBytes(public_key + curve->num_bytes,
131 curve->num_bytes,
132 _public + curve->num_words);
133
134 /* erasing temporary buffer that stored secret: */
135 memset(_private, 0, NUM_ECC_BYTES);
136
137 return 1;
138 }
139 }
140 return 0;
141}
142
143int uECC_shared_secret(const uint8_t *public_key, const uint8_t *private_key,
144 uint8_t *secret, uECC_Curve curve)
145{
146
147 uECC_word_t _public[NUM_ECC_WORDS * 2];
148 uECC_word_t _private[NUM_ECC_WORDS];
149
150 uECC_word_t tmp[NUM_ECC_WORDS];
151 uECC_word_t *p2[2] = {_private, tmp};
152 uECC_word_t *initial_Z = 0;
153 uECC_word_t carry;
154 wordcount_t num_words = curve->num_words;
155 wordcount_t num_bytes = curve->num_bytes;
156 int r;
157
158 /* Converting buffers to correct bit order: */
159 uECC_vli_bytesToNative(_private,
160 private_key,
161 BITS_TO_BYTES(curve->num_n_bits));
162 uECC_vli_bytesToNative(_public,
163 public_key,
164 num_bytes);
165 uECC_vli_bytesToNative(_public + num_words,
166 public_key + num_bytes,
167 num_bytes);
168
169 /* Regularize the bitcount for the private key so that attackers cannot use a
170 * side channel attack to learn the number of leading zeros. */
171 carry = regularize_k(_private, _private, tmp, curve);
172
173 /* If an RNG function was specified, try to get a random initial Z value to
174 * improve protection against side-channel attacks. */
175 if (g_rng_function) {
176 if (!uECC_generate_random_int(p2[carry], curve->p, num_words)) {
177 r = 0;
178 goto clear_and_out;
179 }
180 initial_Z = p2[carry];
181 }
182
183 EccPoint_mult(_public, _public, p2[!carry], initial_Z, curve->num_n_bits + 1,
184 curve);
185
186 uECC_vli_nativeToBytes(secret, num_bytes, _public);
187 r = !EccPoint_isZero(_public, curve);
188
189clear_and_out:
190 /* erasing temporary buffer used to store secret: */
191 memset(p2, 0, sizeof(p2));
192 __asm__ __volatile__("" :: "g"(p2) : "memory");
193 memset(tmp, 0, sizeof(tmp));
194 __asm__ __volatile__("" :: "g"(tmp) : "memory");
195 memset(_private, 0, sizeof(_private));
196 __asm__ __volatile__("" :: "g"(_private) : "memory");
197
198 return r;
199}