~mdw / catacomb / blob
? search:


676fe8ca3762f72333287898c5c235116f567fd3
[catacomb] / pub / ed25519.c
1 /* -*-c-*-
2 *
3 * The Ed25519 signature scheme
4 *
5 * (c) 2017 Straylight/Edgeware
6 */
7
8 /*----- Licensing notice --------------------------------------------------*
9 *
10 * This file is part of Catacomb.
11 *
12 * Catacomb is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU Library General Public License as
14 * published by the Free Software Foundation; either version 2 of the
15 * License, or (at your option) any later version.
16 *
17 * Catacomb is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU Library General Public License for more details.
21 *
22 * You should have received a copy of the GNU Library General Public
23 * License along with Catacomb; if not, write to the Free
24 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
25 * MA 02111-1307, USA.
26 */
27
28 /*----- Header files ------------------------------------------------------*/
29
30 #include <string.h>
31
32 #include "f25519.h"
33 #include "ed25519.h"
34 #include "scaf.h"
35 #include "scmul.h"
36 #include "sha512.h"
37
38 /*----- Key fetching ------------------------------------------------------*/
39
40 const key_fetchdef ed25519_pubfetch[] = {
41 { "pub", offsetof(ed25519_pub, pub), KENC_BINARY, 0 },
42 { 0, 0, 0, 0 }
43 };
44
45 static const key_fetchdef priv[] = {
46 { "priv", offsetof(ed25519_priv, priv), KENC_BINARY, 0 },
47 { 0, 0, 0, 0 }
48 };
49
50 const key_fetchdef ed25519_privfetch[] = {
51 { "pub", offsetof(ed25519_priv, pub), KENC_BINARY, 0 },
52 { "private", 0, KENC_STRUCT, priv },
53 { 0, 0, 0, 0 }
54 };
55
56 /*----- A number of magic numbers -----------------------------------------*/
57
58 #if SCAF_IMPL == 32
59 # define PIECEWD 24
60 static const scaf_piece l[] = {
61 0xf5d3ed, 0x631a5c, 0xd65812, 0xa2f79c, 0xdef9de, 0x000014,
62 0x000000, 0x000000, 0x000000, 0x000000, 0x001000
63 };
64 static const scaf_piece mu[] = {
65 0x1b3994, 0x0a2c13, 0x9ce5a3, 0x29a7ed, 0x5d0863, 0x210621,
66 0xffffeb, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x000fff
67 };
68 #endif
69
70 #if SCAF_IMPL == 16
71 # define PIECEWD 12
72 static const scaf_piece l[] = {
73 0x3ed, 0xf5d, 0xa5c, 0x631, 0x812, 0xd65,
74 0x79c, 0xa2f, 0x9de, 0xdef, 0x014, 0x000,
75 0x000, 0x000, 0x000, 0x000, 0x000, 0x000,
76 0x000, 0x000, 0x000, 0x001
77 };
78 static const scaf_piece mu[] = {
79 0x994, 0x1b3, 0xc13, 0x0a2, 0x5a3, 0x9ce,
80 0x7ed, 0x29a, 0x863, 0x5d0, 0x621, 0x210,
81 0xfeb, 0xfff, 0xfff, 0xfff, 0xfff, 0xfff,
82 0xfff, 0xfff, 0xfff, 0xfff, 0xfff
83 };
84 #endif
85
86 #define NPIECE SCAF_NPIECE(255, PIECEWD)
87
88 #if F25519_IMPL == 26
89 # define P p26
90 static const f25519_piece bx_pieces[] = {
91 -14297830, -7645148, 16144683, -16471763, 27570974,
92 -2696100, -26142465, 8378389, 20764389, 8758491
93 }, by_pieces[] = {
94 -26843541, -6710886, 13421773, -13421773, 26843546,
95 6710886, -13421773, 13421773, -26843546, -6710886
96 }, d_pieces[] = {
97 -10913610, 13857413, -15372611, 6949391, 114729,
98 -8787816, -6275908, -3247719, -18696448, -12055116
99 };
100 #endif
101 #if F25519_IMPL == 10
102 # define P p10
103 static const f25519_piece bx_pieces[] = {
104 282, 373, 242, 386, -467, 86, -423, 318, -437,
105 75, 236, -308, 421, 92, 439, -35, 400, 452,
106 82, -40, 160, 441, -51, 437, -365, 134
107 }, by_pieces[] = {
108 -405, 410, -410, 410, -410, -102, 205, -205, 205,
109 -205, 205, -410, 410, -410, 410, 102, -205, 205,
110 -205, 205, -205, 410, -410, 410, -410, -102
111 }, d_pieces[] = {
112 182, -418, 310, -216, -178, -133, 367, -315, -380,
113 -351, -182, -255, 2, 152, -390, -136, -52, -383,
114 -412, -398, -12, 448, -469, -196, 55, -184
115 };
116 #endif
117
118 static const f25519_piece bz_pieces[NPIECE] = { 1, 0, /* ... */ };
119 #define BX ((const f25519 *)bx_pieces)
120 #define BY ((const f25519 *)by_pieces)
121 #define BZ ((const f25519 *)bz_pieces)
122 #define D ((const f25519 *)d_pieces)
123
124 /*----- Point encoding and decoding ---------------------------------------*/
125
126 static void ptencode(octet q[32],
127 const f25519 *X, const f25519 *Y, const f25519 *Z)
128 {
129 f25519 x, y, t;
130 octet b[32];
131
132 f25519_inv(&t, Z); f25519_mul(&x, X, &t); f25519_mul(&y, Y, &t);
133 f25519_store(q, &y); f25519_store(b, &x); q[31] |= (b[0]&1u) << 7;
134 }
135
136 static int ptdecode(f25519 *X, f25519 *Y, f25519 *Z, const octet q[32])
137 {
138 octet b[32];
139 unsigned i, a;
140 f25519 t, u;
141 uint32 m;
142 int rc = 0;
143
144 /* Load the y-coordinate. */
145 memcpy(b, q, 32); b[31] &= 0x7fu; f25519_load(Y, b);
146
147 /* Check that the coordinate was in range. If we store it, we'll get a
148 * canonical version which we can compare against Q; be careful not to
149 * check the top bit.
150 */
151 f25519_store(b, Y);
152 for (i = a = 0; i < 31; i++) a |= b[i] ^ q[i];
153 a |= (b[31] ^ q[31])&0x7fu;
154 a = ((a - 1) >> 8)&0x01u; /* 0 |-> 1, non-0 |-> 0 */
155 rc |= (int)a - 1;
156
157 /* Decompress the x-coordinate. */
158 f25519_sqr(&t, Y); f25519_mul(&u, &t, D); t.P[0] -= 1; u.P[0] += 1;
159 rc |= f25519_quosqrt(X, &t, &u);
160 f25519_store(b, X); m = -(uint32)(((q[31] >> 7) ^ b[0])&0x1u);
161 f25519_condneg(X, X, m);
162
163 /* Set Z. */
164 f25519_set(Z, 1);
165
166 /* And we're done. */
167 return (rc);
168 }
169
170 /*----- Edwards curve arithmetic ------------------------------------------*/
171
172 static void ptadd(f25519 *X, f25519 *Y, f25519 *Z,
173 const f25519 *X0, const f25519 *Y0, const f25519 *Z0,
174 const f25519 *X1, const f25519 *Y1, const f25519 *Z1)
175 {
176 f25519 t0, t1, t2, t3;
177
178 /* Bernstein, Birkner, Joye, Lange, and Peters, `Twisted Edwards Curves',
179 * 2008-03-13, https://cr.yp.to/newelliptic/twisted-20080313.pdf shows the
180 * formulae as:
181 *
182 * A = Z1 Z2; B = A^2; C = X1 X2; D = Y1 Y2;
183 * E = d C D; F = B - E; G = B + E;
184 * X3 = A F ((X1 + Y1) (X2 + Y2) - C - D);
185 * Y3 = A G (D - a C); Z3 = F G.
186 *
187 * Note that a = -1, which things easier.
188 */
189
190 f25519_mul(&t0, Z0, Z1); /* t0 = A = Z0 Z1 */
191 f25519_add(&t1, X0, Y0); /* t1 = X0 + Y0 */
192 f25519_add(&t2, X1, Y1); /* t2 = X1 + Y1 */
193 f25519_mul(&t1, &t1, &t2); /* t1 = (X0 + Y0) (X1 + Y1) */
194 f25519_mul(&t2, X0, X1); /* t2 = C = X0 X1 */
195 f25519_mul(&t3, Y0, Y1); /* t3 = D = Y0 Y1 */
196 f25519_add(Y, &t2, &t3); /* Y = C + D = D - a C */
197 f25519_sub(X, &t1, Y); /* X = (X0 + Y0) (X1 + Y1) - C - D */
198 f25519_mul(X, X, &t0); /* X = A ((X0 + Y0) (X1 + Y1) - C - D) */
199 f25519_mul(Y, Y, &t0); /* Y = A (D - a C) */
200 f25519_sqr(&t0, &t0); /* t0 = B = A^2 */
201 f25519_mul(&t1, &t2, &t3); /* t1 = C D */
202 f25519_mul(&t1, &t1, D); /* t1 = E = d C D */
203 f25519_sub(&t2, &t0, &t1); /* t2 = F = B - E */
204 f25519_add(&t1, &t0, &t1); /* t1 = G = B + E */
205 f25519_mul(X, X, &t2); /* X = A F ((X0 + Y0) (X1 + Y1) - C - D) */
206 f25519_mul(Y, Y, &t1); /* Y = A G (D - a C) */
207 f25519_mul(Z, &t1, &t2); /* Z = F G */
208 }
209
210 static void ptdbl(f25519 *X, f25519 *Y, f25519 *Z,
211 const f25519 *X0, const f25519 *Y0, const f25519 *Z0)
212 {
213 f25519 t0, t1, t2;
214
215 /* Bernstein, Birkner, Joye, Lange, and Peters, `Twisted Edwards Curves',
216 * 2008-03-13, https://cr.yp.to/newelliptic/twisted-20080313.pdf shows the
217 * formulae as:
218 *
219 * B = (X1 + Y1)^2; C = X1^2; D = Y1^2; E = a C;
220 * F = E + D; H = Z1^2; J = F - 2 H;
221 * X3 = (B - C - D) J; Y3 = F (E - D); Z3 = F J.
222 *
223 * Note that a = -1, which things easier.
224 */
225
226 f25519_add(&t0, X0, Y0); /* t0 = X0 + Y0 */
227 f25519_sqr(&t0, &t0); /* t0 = B = (X0 + Y0)^2 */
228 f25519_sqr(&t1, X0); /* t1 = C = X0^2 */
229 f25519_sqr(&t2, Y0); /* t2 = D = Y0^2 */
230 f25519_add(Y, &t1, &t2); /* Y = C + D = -(E - D) */
231 f25519_sub(X, &t0, Y); /* X = B - C - D */
232 /* (E = a C = -C) */
233 f25519_sub(&t0, &t2, &t1); /* t0 = F = D - C = E + D */
234 f25519_sqr(&t1, Z0); /* t1 = H = Z0^2 */
235 f25519_add(&t1, &t1, &t1); /* t1 = 2 H */
236 f25519_sub(&t1, &t0, &t1); /* t1 = J = F - 2 H */
237 f25519_mul(X, X, &t1); /* X = (B - C - D) J */
238 f25519_mul(Y, Y, &t0); /* Y = -F (E - D) */
239 f25519_neg(Y, Y); /* Y = F (E - D) */
240 f25519_mul(Z, &t0, &t1); /* Z = F J */
241 }
242
243 static DEFINE_SCMUL(ptmul, f25519, 4, PIECEWD, NPIECE, ptadd, ptdbl)
244 static DEFINE_SCSIMMUL(ptsimmul, f25519, 2, PIECEWD, NPIECE, ptadd, ptdbl)
245
246 /*----- Key derivation utilities ------------------------------------------*/
247
248 static void unpack_key(scaf_piece a[NPIECE], octet h1[32],
249 const octet *k, size_t ksz)
250 {
251 sha512_ctx h;
252 octet b[SHA512_HASHSZ];
253
254 sha512_init(&h); sha512_hash(&h, k, ksz); sha512_done(&h, b);
255 b[0] &= 0xf8u; b[31] = (b[31]&0x3f) | 0x40;
256 scaf_load(a, b, 32, NPIECE, PIECEWD);
257 if (h1) memcpy(h1, b + 32, 32);
258 }
259
260 #define PREFIX_BUFSZ 290
261 static size_t prefix(octet b[PREFIX_BUFSZ],
262 int phflag, const octet *p, size_t psz)
263 {
264 if (phflag < 0) return (0);
265 memcpy(b, "SigEd25519 no Ed25519 collisions", 32);
266 b[32] = phflag;
267 assert(psz < ED25519_MAXPERSOSZ); b[33] = psz; memcpy(b + 34, p, psz);
268 return (psz + 34);
269 }
270
271 /*----- Main code ---------------------------------------------------------*/
272
273 /* --- @ed25519_pubkey@ --- *
274 *
275 * Arguments: @octet K[ED25519_PUBSZ]@ = where to put the public key
276 * @const void *k@ = private key
277 * @size_t ksz@ = length of private key
278 *
279 * Returns: ---
280 *
281 * Use: Derives the public key from a private key.
282 */
283
284 void ed25519_pubkey(octet K[ED25519_PUBSZ], const void *k, size_t ksz)
285 {
286 scaf_piece a[NPIECE];
287 f25519 AX, AY, AZ;
288
289 unpack_key(a, 0, k, ksz);
290 ptmul(&AX, &AY, &AZ, a, BX, BY, BZ);
291 ptencode(K, &AX, &AY, &AZ);
292 }
293
294 /* --- @ed25519_sign@, @ed25519ctx_sign@ --- *
295 *
296 * Arguments: @octet sig[ED25519_SIGSZ]@ = where to put the signature
297 * @const void *k@ = private key
298 * @size_t ksz@ = length of private key
299 * @const octet K[ED25519_PUBSZ]@ = public key
300 * @int phflag@ = whether the `message' has been hashed already
301 * @const void *p@ = personalization string
302 * @size_t psz@ = length of personalization string
303 * @const void *m@ = message to sign
304 * @size_t msz@ = length of message
305 *
306 * Returns: ---
307 *
308 * Use: Signs a message.
309 *
310 * In @ed25519ctx_sign@, if @phflag@ is @-1@ then you get plain
311 * old Ed25519: the personalization string pointer @p@ will be
312 * ignored. If @phflag > 0@ then the `message' @m@ should be a
313 * SHA512 hash of the actual message.
314 */
315
316 void ed25519ctx_sign(octet sig[ED25519_SIGSZ],
317 const void *k, size_t ksz, const octet K[ED25519_PUBSZ],
318 int phflag, const void *p, size_t psz,
319 const void *m, size_t msz)
320 {
321 sha512_ctx h;
322 scaf_piece a[NPIECE], r[NPIECE], t[NPIECE], scratch[3*NPIECE];
323 scaf_dblpiece tt[2*NPIECE];
324 f25519 RX, RY, RZ;
325 octet h1[32], pb[PREFIX_BUFSZ], rb[SHA512_HASHSZ];
326 unsigned i;
327
328 /* Get my private key. */
329 unpack_key(a, h1, k, ksz);
330
331 /* Determine the prefix string. */
332 psz = prefix(pb, phflag, p, psz);
333
334 /* Select the nonce and the vector part. */
335 sha512_init(&h);
336 sha512_hash(&h, pb, psz);
337 sha512_hash(&h, h1, 32);
338 sha512_hash(&h, m, msz);
339 sha512_done(&h, rb);
340 scaf_loaddbl(tt, rb, 64, 2*NPIECE, PIECEWD);
341 scaf_reduce(r, tt, l, mu, NPIECE, PIECEWD, scratch);
342 ptmul(&RX, &RY, &RZ, r, BX, BY, BZ);
343 ptencode(sig, &RX, &RY, &RZ);
344
345 /* Calculate the scalar part. */
346 sha512_init(&h);
347 sha512_hash(&h, pb, psz);
348 sha512_hash(&h, sig, 32);
349 sha512_hash(&h, K, 32);
350 sha512_hash(&h, m, msz);
351 sha512_done(&h, rb);
352 scaf_loaddbl(tt, rb, 64, 2*NPIECE, PIECEWD);
353 scaf_reduce(t, tt, l, mu, NPIECE, PIECEWD, scratch);
354 scaf_mul(tt, t, a, NPIECE);
355 for (i = 0; i < NPIECE; i++) tt[i] += r[i];
356 scaf_reduce(t, tt, l, mu, NPIECE, PIECEWD, scratch);
357 scaf_store(sig + 32, 32, t, NPIECE, PIECEWD);
358 }
359
360 void ed25519_sign(octet sig[ED25519_SIGSZ],
361 const void *k, size_t ksz, const octet K[ED25519_PUBSZ],
362 const void *m, size_t msz)
363 { ed25519ctx_sign(sig, k, ksz, K, -1, 0, 0, m, msz); }
364
365 /* --- @ed25519_verify@, @ed25519ctx_verify@ --- *
366 *
367 * Arguments: @const octet K[ED25519_PUBSZ]@ = public key
368 * @int phflag@ = whether the `message' has been hashed already
369 * @const void *p@ = personalization string
370 * @size_t psz@ = length of personalization string
371 * @const void *m@ = message to sign
372 * @size_t msz@ = length of message
373 * @const octet sig[ED25519_SIGSZ]@ = signature
374 *
375 * Returns: Zero if OK, negative on failure.
376 *
377 * Use: Verify a signature.
378 *
379 * In @ed25519ctx_verify@, if @phflag@ is @-1@ then you get
380 * plain old Ed25519: the personalization string pointer @p@
381 * will be ignored. If @phflag > 0@ then the `message' @m@
382 * should be a SHA512 hash of the actual message.
383 */
384
385 int ed25519ctx_verify(const octet K[ED25519_PUBSZ],
386 int phflag, const void *p, size_t psz,
387 const void *m, size_t msz,
388 const octet sig[ED25519_SIGSZ])
389 {
390 sha512_ctx h;
391 scaf_piece s[NPIECE], t[NPIECE], scratch[3*NPIECE];
392 scaf_dblpiece tt[2*NPIECE];
393 f25519 AX, AY, AZ, RX, RY, RZ;
394 octet b[PREFIX_BUFSZ];
395
396 /* Unpack the public key. Negate it: we're meant to subtract the term
397 * involving the public key point, and this is easier than negating the
398 * scalar.
399 */
400 if (ptdecode(&AX, &AY, &AZ, K)) return (-1);
401 f25519_neg(&AX, &AX);
402
403 /* Load the scalar and check that it's in range. The easy way is to store
404 * it again and see if the two match.
405 */
406 scaf_loaddbl(tt, sig + 32, 32, 2*NPIECE, PIECEWD);
407 scaf_reduce(s, tt, l, mu, NPIECE, PIECEWD, scratch);
408 scaf_store(b, 32, s, NPIECE, PIECEWD);
409 if (memcmp(b, sig + 32, 32) != 0) return (-1);
410
411 /* Check the signature. */
412 psz = prefix(b, phflag, p, psz);
413 sha512_init(&h);
414 sha512_hash(&h, b, psz);
415 sha512_hash(&h, sig, 32);
416 sha512_hash(&h, K, 32);
417 sha512_hash(&h, m, msz);
418 sha512_done(&h, b);
419 scaf_loaddbl(tt, b, 64, 2*NPIECE, PIECEWD);
420 scaf_reduce(t, tt, l, mu, NPIECE, PIECEWD, scratch);
421 ptsimmul(&RX, &RY, &RZ, s, BX, BY, BZ, t, &AX, &AY, &AZ);
422 ptencode(b, &RX, &RY, &RZ);
423 if (memcmp(b, sig, 32) != 0) return (-1);
424
425 /* All is good. */
426 return (0);
427 }
428
429 int ed25519_verify(const octet K[ED25519_PUBSZ],
430 const void *m, size_t msz,
431 const octet sig[ED25519_SIGSZ])
432 { return (ed25519ctx_verify(K, -1, 0, 0, m, msz, sig)); }
433
434 /*----- Test rig ----------------------------------------------------------*/
435
436 #ifdef TEST_RIG
437
438 #include <stdio.h>
439 #include <string.h>
440
441 #include <mLib/report.h>
442 #include <mLib/testrig.h>
443
444 #include "ct.h"
445
446 static int vrf_pubkey(dstr dv[])
447 {
448 dstr dpub = DSTR_INIT;
449 int ok = 1;
450
451 if (dv[1].len != ED25519_PUBSZ) die(1, "bad pub length");
452
453 ct_poison(dv[0].buf, dv[0].len);
454 dstr_ensure(&dpub, ED25519_PUBSZ); dpub.len = ED25519_PUBSZ;
455 ed25519_pubkey((octet *)dpub.buf, dv[0].buf, dv[0].len);
456 ct_remedy(dpub.buf, dpub.len);
457 if (memcmp(dpub.buf, dv[1].buf, ED25519_PUBSZ) != 0) {
458 ok = 0;
459 fprintf(stderr, "failed!");
460 fprintf(stderr, "\n\tpriv = "); type_hex.dump(&dv[0], stderr);
461 fprintf(stderr, "\n\tcalc = "); type_hex.dump(&dpub, stderr);
462 fprintf(stderr, "\n\twant = "); type_hex.dump(&dv[1], stderr);
463 fprintf(stderr, "\n");
464 }
465
466 dstr_destroy(&dpub);
467 return (ok);
468 }
469
470 static int vrf_sign(dstr *priv, int phflag, dstr *perso,
471 dstr *msg, dstr *want)
472 {
473 sha512_ctx h;
474 octet K[ED25519_PUBSZ];
475 dstr d = DSTR_INIT, dsig = DSTR_INIT, *m;
476 int ok = 1;
477
478 if (want->len != ED25519_SIGSZ) die(1, "bad result length");
479
480 ct_poison(priv->buf, priv->len);
481 dstr_ensure(&dsig, ED25519_SIGSZ); dsig.len = ED25519_SIGSZ;
482 if (phflag <= 0)
483 m = msg;
484 else {
485 dstr_ensure(&d, SHA512_HASHSZ); d.len = SHA512_HASHSZ;
486 sha512_init(&h);
487 sha512_hash(&h, msg->buf, msg->len);
488 sha512_done(&h, d.buf);
489 m = &d;
490 }
491 ed25519_pubkey(K, priv->buf, priv->len);
492 ed25519ctx_sign((octet *)dsig.buf, priv->buf, priv->len, K,
493 phflag, perso ? perso->buf : 0, perso ? perso->len : 0,
494 m->buf, m->len);
495 ct_remedy(dsig.buf, dsig.len);
496 if (memcmp(dsig.buf, want->buf, ED25519_SIGSZ) != 0) {
497 ok = 0;
498 fprintf(stderr, "failed!");
499 fprintf(stderr, "\n\tpriv = "); type_hex.dump(priv, stderr);
500 if (phflag >= 0) {
501 fprintf(stderr, "\n\t ph = %d", phflag);
502 fprintf(stderr, "\n\tpers = "); type_hex.dump(perso, stderr);
503 }
504 fprintf(stderr, "\n\t msg = "); type_hex.dump(msg, stderr);
505 if (phflag > 0)
506 { fprintf(stderr, "\n\thash = "); type_hex.dump(m, stderr); }
507 fprintf(stderr, "\n\tcalc = "); type_hex.dump(&dsig, stderr);
508 fprintf(stderr, "\n\twant = "); type_hex.dump(want, stderr);
509 fprintf(stderr, "\n");
510 }
511
512 dstr_destroy(&dsig);
513 return (ok);
514 }
515
516 static int vrf_sign_trad(dstr *dv)
517 { return (vrf_sign(&dv[0], -1, 0, &dv[1], &dv[2])); }
518
519 static int vrf_sign_ctx(dstr *dv)
520 { return (vrf_sign(&dv[0], *(int *)dv[1].buf, &dv[2], &dv[3], &dv[4])); }
521
522 static int vrf_verify(dstr *pub, int phflag, dstr *perso,
523 dstr *msg, dstr *sig, int rc_want)
524 {
525 sha512_ctx h;
526 int rc_calc;
527 dstr d = DSTR_INIT, *m;
528 int ok = 1;
529
530 if (pub->len != ED25519_PUBSZ) die(1, "bad pub length");
531 if (sig->len != ED25519_SIGSZ) die(1, "bad sig length");
532
533 if (phflag <= 0)
534 m = msg;
535 else {
536 dstr_ensure(&d, SHA512_HASHSZ); d.len = SHA512_HASHSZ;
537 sha512_init(&h);
538 sha512_hash(&h, msg->buf, msg->len);
539 sha512_done(&h, d.buf);
540 m = &d;
541 }
542 rc_calc = ed25519ctx_verify((const octet *)pub->buf,
543 phflag, perso ? perso->buf : 0,
544 perso ? perso->len : 0,
545 m->buf, m->len,
546 (const octet *)sig->buf);
547 if (!rc_want != !rc_calc) {
548 ok = 0;
549 fprintf(stderr, "failed!");
550 fprintf(stderr, "\n\t pub = "); type_hex.dump(pub, stderr);
551 if (phflag >= 0) {
552 fprintf(stderr, "\n\t ph = %d", phflag);
553 fprintf(stderr, "\n\tpers = "); type_hex.dump(perso, stderr);
554 }
555 fprintf(stderr, "\n\t msg = "); type_hex.dump(msg, stderr);
556 if (phflag > 0)
557 { fprintf(stderr, "\n\thash = "); type_hex.dump(m, stderr); }
558 fprintf(stderr, "\n\t sig = "); type_hex.dump(sig, stderr);
559 fprintf(stderr, "\n\tcalc = %d", rc_calc);
560 fprintf(stderr, "\n\twant = %d", rc_want);
561 fprintf(stderr, "\n");
562 }
563
564 return (ok);
565 }
566
567 static int vrf_verify_trad(dstr *dv)
568 { return (vrf_verify(&dv[0], -1, 0, &dv[1], &dv[2], *(int *)dv[3].buf)); }
569
570 static int vrf_verify_ctx(dstr *dv)
571 {
572 return (vrf_verify(&dv[0], *(int *)dv[1].buf, &dv[2],
573 &dv[3], &dv[4], *(int *)dv[5].buf));
574 }
575
576 static test_chunk tests[] = {
577 { "pubkey", vrf_pubkey,
578 { &type_hex, &type_hex } },
579 { "sign", vrf_sign_trad,
580 { &type_hex, &type_hex, &type_hex } },
581 { "verify", vrf_verify_trad,
582 { &type_hex, &type_hex, &type_hex, &type_int } },
583 { "sign-ctx", vrf_sign_ctx,
584 { &type_hex, &type_int, &type_hex, &type_hex, &type_hex } },
585 { "verify-ctx", vrf_verify_ctx,
586 { &type_hex, &type_int, &type_hex, &type_hex, &type_hex, &type_int } },
587 { 0, 0, { 0 } }
588 };
589
590 int main(int argc, char *argv[])
591 {
592 test_run(argc, argv, tests, SRCDIR "/t/ed25519");
593 return (0);
594 }
595
596 #endif
597
598 /*----- That's all, folks -------------------------------------------------*/
Catacomb cryptographic library