3 * The Ed25519 signature scheme
5 * (c) 2017 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of Catacomb.
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.
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.
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,
28 /*----- Header files ------------------------------------------------------*/
37 /*----- Key fetching ------------------------------------------------------*/
39 const key_fetchdef ed25519_pubfetch
[] = {
40 { "pub", offsetof(ed25519_pub
, pub
), KENC_BINARY
, 0 },
44 static const key_fetchdef priv
[] = {
45 { "priv", offsetof(ed25519_priv
, priv
), KENC_BINARY
, 0 },
49 const key_fetchdef ed25519_privfetch
[] = {
50 { "pub", offsetof(ed25519_priv
, pub
), KENC_BINARY
, 0 },
51 { "private", 0, KENC_STRUCT
, priv
},
55 /*----- A number of magic numbers -----------------------------------------*/
59 static const scaf_piece l
[] = {
60 0xf5d3ed, 0x631a5c, 0xd65812, 0xa2f79c, 0xdef9de, 0x000014,
61 0x000000, 0x000000, 0x000000, 0x000000, 0x001000
63 static const scaf_piece mu
[] = {
64 0x1b3994, 0x0a2c13, 0x9ce5a3, 0x29a7ed, 0x5d0863, 0x210621,
65 0xffffeb, 0xffffff, 0xffffff, 0xffffff, 0xffffff, 0x000fff
71 static const scaf_piece l
[] = {
72 0x3ed, 0xf5d, 0xa5c, 0x631, 0x812, 0xd65,
73 0x79c, 0xa2f, 0x9de, 0xdef, 0x014, 0x000,
74 0x000, 0x000, 0x000, 0x000, 0x000, 0x000,
75 0x000, 0x000, 0x000, 0x001
77 static const scaf_piece mu
[] = {
78 0x994, 0x1b3, 0xc13, 0x0a2, 0x5a3, 0x9ce,
79 0x7ed, 0x29a, 0x863, 0x5d0, 0x621, 0x210,
80 0xfeb, 0xfff, 0xfff, 0xfff, 0xfff, 0xfff,
81 0xfff, 0xfff, 0xfff, 0xfff, 0xfff
85 #define NPIECE SCAF_NPIECE(255, PIECEWD)
89 static const f25519_piece bx_pieces
[] = {
90 -14297830, -7645148, 16144683, -16471763, 27570974,
91 -2696100, -26142465, 8378389, 20764389, 8758491
93 -26843560, -6710886, 13421773, -13421773, 26843546,
94 6710886, -13421773, 13421773, -26843546, 26843546
96 -10913629, 13857413, -15372611, 6949391, 114729,
97 -8787816, -6275908, -3247719, -18696448, 21499316
100 #if F25519_IMPL == 10
102 static const f25519_piece bx_pieces
[] = {
103 282, 373, 242, 386, -467, 86, -423, 318, -437,
104 75, 236, -308, 421, 92, 439, -35, 400, 452,
105 82, -40, 160, 441, -51, 437, -365, 134
107 -424, 410, -410, 410, -410, -102, 205, -205, 205,
108 -205, 205, -410, 410, -410, 410, 102, -205, 205,
109 -205, 205, -205, 410, -410, 410, -410, 410
111 163, -418, 310, -216, -178, -133, 367, -315, -380,
112 -351, -182, -255, 2, 152, -390, -136, -52, -383,
113 -412, -398, -12, 448, -469, -196, 55, 328
117 static const f25519_piece bz_pieces
[NPIECE
] = { 1, 0, /* ... */ };
118 #define BX ((const f25519 *)bx_pieces)
119 #define BY ((const f25519 *)by_pieces)
120 #define BZ ((const f25519 *)bz_pieces)
121 #define D ((const f25519 *)d_pieces)
123 /*----- Point encoding and decoding ---------------------------------------*/
125 static void ptencode(octet q
[32],
126 const f25519
*X
, const f25519
*Y
, const f25519
*Z
)
131 f25519_inv(&t
, Z
); f25519_mul(&x
, X
, &t
); f25519_mul(&y
, Y
, &t
);
132 f25519_store(q
, &y
); f25519_store(b
, &x
); q
[31] |= (b
[0]&1u) << 7;
135 static int ptdecode(f25519
*X
, f25519
*Y
, f25519
*Z
, const octet q
[32])
142 memcpy(b
, q
, 32); b
[31] &= 0x7fu
; f25519_load(Y
, b
);
143 f25519_sqr(&t
, Y
); f25519_mul(&u
, &t
, D
); t
.P
[0] -= 1; u
.P
[0] += 1;
144 rc
= f25519_quosqrt(X
, &t
, &u
);
145 f25519_store(b
, X
); m
= -(((q
[31] >> 7) ^ b
[0])&0x1u
);
146 f25519_condneg(X
, X
, m
);
151 /*----- Edwards curve arithmetic ------------------------------------------*/
153 static void ptadd(f25519
*X
, f25519
*Y
, f25519
*Z
,
154 const f25519
*X0
, const f25519
*Y0
, const f25519
*Z0
,
155 const f25519
*X1
, const f25519
*Y1
, const f25519
*Z1
)
157 f25519 t0
, t1
, t2
, t3
, t4
, t5
;
159 /* Bernstein, Birkner, Joye, Lange, and Peters, `Twisted Edwards Curves',
160 * 2008-03-13, https://cr.yp.to/newelliptic/twisted-20080313.pdf shows the
163 * A = Z1 Z2; B = A^2; C = X1 X2; D = Y1 Y2;
164 * E = d C D; F = B - E; G = B + E;
165 * X3 = A F ((X1 + Y1) (X2 + Y2) - C - D);
166 * Y3 = A G (D - a C); Z3 = F G.
168 * Note that a = -1, which things easier.
171 f25519_mul(&t0
, Z0
, Z1
); /* t0 = A = Z0 Z1 */
172 f25519_sqr(&t1
, &t0
); /* t1 = B = A^2 */
173 f25519_mul(&t2
, X0
, X1
); /* t2 = C = X0 X1 */
174 f25519_mul(&t3
, Y0
, Y1
); /* t3 = D = Y0 Y1 */
175 f25519_mul(&t4
, &t2
, &t3
); /* t4 = C D */
176 f25519_mul(&t4
, &t4
, D
); /* t4 = E = d C D */
177 f25519_sub(&t5
, &t1
, &t4
); /* t5 = F = B - E */
178 f25519_add(&t4
, &t1
, &t4
); /* t4 = G = B + E */
179 f25519_add(&t1
, &t2
, &t3
); /* t1 = C + D */
180 f25519_add(&t2
, X0
, Y0
); /* t2 = X0 + Y0 */
181 f25519_add(&t3
, X1
, Y1
); /* t3 = X1 + Y1 */
182 f25519_mul(X
, &t0
, &t5
); /* X = A F */
183 f25519_mul(Y
, &t0
, &t4
); /* Y = A G */
184 f25519_mul(Z
, &t5
, &t4
); /* Z = F G */
185 f25519_mul(Y
, Y
, &t1
); /* Y = A G (C + D) = A G (D - a C) */
186 f25519_mul(&t0
, &t2
, &t3
); /* t0 = (X0 + Y0) (X1 + Y1) */
187 f25519_sub(&t0
, &t0
, &t1
); /* t0 = (X0 + Y0) (X1 + Y1) - C - D */
188 f25519_mul(X
, X
, &t0
); /* X = A F ((X0 + Y0) (X1 + Y1) - C - D) */
191 static void ptdbl(f25519
*X
, f25519
*Y
, f25519
*Z
,
192 const f25519
*X0
, const f25519
*Y0
, const f25519
*Z0
)
196 /* Bernstein, Birkner, Joye, Lange, and Peters, `Twisted Edwards Curves',
197 * 2008-03-13, https://cr.yp.to/newelliptic/twisted-20080313.pdf shows the
200 * B = (X1 + Y1)^2; C = X1^2; D = Y1^2; E = a C;
201 * F = E + D; H = Z1^2; J = F - 2 H;
202 * X3 = (B - C - D) J; Y3 = F (E - D); Z3 = F J.
204 * Note that a = -1, which things easier.
207 f25519_add(&t0
, X0
, Y0
); /* t0 = X0 + Y0 */
208 f25519_sqr(&t0
, &t0
); /* t0 = B = (X0 + Y0)^2 */
209 f25519_sqr(&t1
, X0
); /* t1 = C = X0^2 */
210 f25519_sqr(&t2
, Y0
); /* t2 = D = Y0^2 */
211 f25519_add(Y
, &t1
, &t2
); /* Y = C + D = -(E - D) */
212 f25519_sub(X
, &t0
, Y
); /* X = B - C - D */
214 f25519_sub(&t0
, &t2
, &t1
); /* t0 = F = D - C = E + D */
215 f25519_sqr(&t1
, Z0
); /* t1 = H = Z0^2 */
216 f25519_mulconst(&t1
, &t1
, 2); /* t1 = 2 H */
217 f25519_sub(&t1
, &t0
, &t1
); /* t1 = J = F - 2 H */
218 f25519_mul(X
, X
, &t1
); /* X = (B - C - D) J */
219 f25519_mul(Y
, Y
, &t0
); /* Y = -F (E - D) */
220 f25519_neg(Y
, Y
); /* Y = F (E - D) */
221 f25519_mul(Z
, &t0
, &t1
); /* Z = F J */
224 static void ptmul(f25519
*X
, f25519
*Y
, f25519
*Z
,
225 const scaf_piece n
[NPIECE
],
226 const f25519
*X0
, const f25519
*Y0
, const f25519
*Z0
)
228 /* We assume that the window width divides the scalar piece width. */
230 #define WINLIM (1 << WINWD)
231 #define WINMASK (WINLIM - 1)
232 #define TABSZ (WINLIM/2 + 1)
234 f25519 VX
[TABSZ
], VY
[TABSZ
], VZ
[TABSZ
];
235 f25519 TX
, TY
, TZ
, UX
, UY
, UZ
;
240 /* Build a table of small multiples. */
241 f25519_set(&VX
[0], 0); f25519_set(&VY
[0], 1); f25519_set(&VZ
[0], 1);
242 VX
[1] = *X0
; VY
[1] = *Y0
; VZ
[1] = *Z0
;
243 ptdbl(&VX
[2], &VY
[2], &VZ
[2], &VX
[1], &VY
[1], &VZ
[1]);
244 for (i
= 3; i
< TABSZ
; i
+= 2) {
245 ptadd(&VX
[i
], &VY
[i
], &VZ
[i
],
246 &VX
[i
- 1], &VY
[i
- 1], &VZ
[i
- 1], X0
, Y0
, Z0
);
247 ptdbl(&VX
[i
+ 1], &VY
[i
+ 1], &VZ
[i
+ 1],
248 &VX
[(i
+ 1)/2], &VY
[(i
+ 1)/2], &VZ
[(i
+ 1)/2]);
251 /* Now do the multiplication. We lag a window behind the cursor position
252 * because of the scalar recoding we do.
254 f25519_set(&TX
, 0); f25519_set(&TY
, 1); f25519_set(&TZ
, 1);
255 for (i
= NPIECE
, w
= 0, m_neg
= 0; i
--; ) {
258 /* Work through each window in the scalar piece. */
259 for (j
= 0; j
< PIECEWD
; j
+= WINWD
) {
261 /* Shift along by a window. */
262 for (k
= 0; k
< WINWD
; k
++) ptdbl(&TX
, &TY
, &TZ
, &TX
, &TY
, &TZ
);
264 /* Peek at the next window of four bits. If the top bit is set we lend
265 * a bit leftwards, into w. It's too late for this to affect the sign
266 * now, but if we negated earlier then the addition would be wrong.
268 w
+= (ni
>> (PIECEWD
- 1))&0x1u
;
269 w
= ((WINLIM
- w
)&m_neg
) | (w
&~m_neg
);
271 /* Collect the entry from the table, and add or subtract. */
272 f25519_pickn(&UX
, VX
, TABSZ
, w
);
273 f25519_pickn(&UY
, VY
, TABSZ
, w
);
274 f25519_pickn(&UZ
, VZ
, TABSZ
, w
);
275 f25519_condneg(&UX
, &UX
, m_neg
);
276 ptadd(&TX
, &TY
, &TZ
, &TX
, &TY
, &TZ
, &UX
, &UY
, &UZ
);
278 /* Move the next window into the delay slot. If its top bit is set,
279 * then negate it and set m_neg.
281 w
= (ni
>> (PIECEWD
- WINWD
))&WINMASK
;
282 m_neg
= -(uint32
)((w
>> (WINWD
- 1))&0x1u
);
287 /* Do the final window. Just fix the sign and go. */
288 for (k
= 0; k
< WINWD
; k
++) ptdbl(&TX
, &TY
, &TZ
, &TX
, &TY
, &TZ
);
289 w
= ((WINLIM
- w
)&m_neg
) | (w
&~m_neg
);
290 f25519_pickn(&UX
, VX
, TABSZ
, w
);
291 f25519_pickn(&UY
, VY
, TABSZ
, w
);
292 f25519_pickn(&UZ
, VZ
, TABSZ
, w
);
293 f25519_condneg(&UX
, &UX
, m_neg
);
294 ptadd(X
, Y
, Z
, &TX
, &TY
, &TZ
, &UX
, &UY
, &UZ
);
302 static void ptsimmul(f25519
*X
, f25519
*Y
, f25519
*Z
,
303 const scaf_piece n0
[NPIECE
],
304 const f25519
*X0
, const f25519
*Y0
, const f25519
*Z0
,
305 const scaf_piece n1
[NPIECE
],
306 const f25519
*X1
, const f25519
*Y1
, const f25519
*Z1
)
308 /* We assume that the window width divides the scalar piece width. */
310 #define WINLIM (1 << WINWD)
311 #define WINMASK (WINLIM - 1)
312 #define TABSZ (1 << 2*WINWD)
314 f25519 VX
[TABSZ
], VY
[TABSZ
], VZ
[TABSZ
];
315 f25519 TX
, TY
, TZ
, UX
, UY
, UZ
;
316 unsigned i
, j
, k
, w
, ni0
, ni1
;
318 /* Build a table of small linear combinations. */
319 f25519_set(&VX
[0], 0); f25519_set(&VY
[0], 1); f25519_set(&VZ
[0], 1);
320 VX
[1] = *X0
; VX
[WINLIM
] = *X1
;
321 VY
[1] = *Y0
; VY
[WINLIM
] = *Y1
;
322 VZ
[1] = *Z0
; VZ
[WINLIM
] = *Z1
;
323 for (i
= 2; i
< WINLIM
; i
<<= 1) {
324 ptdbl(&VX
[i
], &VY
[i
], &VZ
[i
],
325 &VX
[i
/2], &VY
[i
/2], &VZ
[i
/2]);
326 ptdbl(&VX
[i
*WINLIM
], &VY
[i
*WINLIM
], &VZ
[i
*WINLIM
],
327 &VX
[i
*WINLIM
/2], &VY
[i
*WINLIM
/2], &VZ
[i
*WINLIM
/2]);
329 for (i
= 2; i
< TABSZ
; i
<<= 1) {
330 for (j
= 1; j
< i
; j
++)
331 ptadd(&VX
[i
+ j
], &VY
[i
+ j
], &VZ
[i
+ j
],
332 &VX
[i
], &VY
[i
], &VZ
[i
], &VX
[j
], &VY
[j
], &VZ
[j
]);
335 /* Do the multiplication. */
336 f25519_set(&TX
, 0); f25519_set(&TY
, 1); f25519_set(&TZ
, 1);
337 for (i
= NPIECE
; i
--; ) {
338 ni0
= n0
[i
]; ni1
= n1
[i
];
340 /* Work through each window in the scalar pieces. */
341 for (j
= 0; j
< PIECEWD
; j
+= WINWD
) {
343 /* Shift along by a window. */
344 for (k
= 0; k
< WINWD
; k
++) ptdbl(&TX
, &TY
, &TZ
, &TX
, &TY
, &TZ
);
346 /* Collect the next window from the scalars. */
347 w
= ((ni0
>> (PIECEWD
- WINWD
))&WINMASK
) |
348 ((ni1
>> (PIECEWD
- 2*WINWD
))&(WINMASK
<< WINWD
));
349 ni0
<<= WINWD
; ni1
<<= WINWD
;
351 /* Collect the entry from the table, and add. */
352 f25519_pickn(&UX
, VX
, TABSZ
, w
);
353 f25519_pickn(&UY
, VY
, TABSZ
, w
);
354 f25519_pickn(&UZ
, VZ
, TABSZ
, w
);
355 ptadd(&TX
, &TY
, &TZ
, &TX
, &TY
, &TZ
, &UX
, &UY
, &UZ
);
360 *X
= TX
; *Y
= TY
; *Z
= TZ
;
363 /*----- Key derivation utilities ------------------------------------------*/
365 static void unpack_key(scaf_piece a
[NPIECE
], octet h1
[32],
366 const octet
*k
, size_t ksz
)
369 octet b
[SHA512_HASHSZ
];
371 sha512_init(&h
); sha512_hash(&h
, k
, ksz
); sha512_done(&h
, b
);
372 b
[0] &= 0xf8u
; b
[31] = (b
[31]&0x3f) | 0x40;
373 scaf_load(a
, b
, 32, NPIECE
, PIECEWD
);
374 memcpy(h1
, b
+ 32, 32);
377 /*----- Main code ---------------------------------------------------------*/
379 /* --- @ed25519_pubkey@ --- *
381 * Arguments: @octet K[ED25519_PUBSZ]@ = where to put the public key
382 * @const void *k@ = private key
383 * @size_t ksz@ = length of private key
387 * Use: Derives the public key from a private key.
390 void ed25519_pubkey(octet K
[ED25519_PUBSZ
], const void *k
, size_t ksz
)
392 scaf_piece a
[NPIECE
];
396 unpack_key(a
, h1
, k
, ksz
);
397 ptmul(&AX
, &AY
, &AZ
, a
, BX
, BY
, BZ
);
398 ptencode(K
, &AX
, &AY
, &AZ
);
401 /* --- @ed25519_sign@ --- *
403 * Arguments: @octet sig[ED25519_SIGSZ]@ = where to put the signature
404 * @const void *k@ = private key
405 * @size_t ksz@ = length of private key
406 * @const octet K[ED25519_PUBSZ]@ = public key
407 * @const void *m@ = message to sign
408 * @size_t msz@ = length of message
412 * Use: Signs a message.
415 void ed25519_sign(octet sig
[ED25519_SIGSZ
],
416 const void *k
, size_t ksz
,
417 const octet K
[ED25519_PUBSZ
],
418 const void *m
, size_t msz
)
421 scaf_piece a
[NPIECE
], r
[NPIECE
], t
[NPIECE
], scratch
[3*NPIECE
+ 1];
422 scaf_dblpiece tt
[2*NPIECE
];
424 octet h1
[32], b
[SHA512_HASHSZ
];
427 /* Get my private key. */
428 unpack_key(a
, h1
, k
, ksz
);
430 /* Select the nonce and the vector part. */
432 sha512_hash(&h
, h1
, 32);
433 sha512_hash(&h
, m
, msz
);
435 scaf_loaddbl(tt
, b
, 64, 2*NPIECE
, PIECEWD
);
436 scaf_reduce(r
, tt
, l
, mu
, NPIECE
, PIECEWD
, scratch
);
437 ptmul(&RX
, &RY
, &RZ
, r
, BX
, BY
, BZ
);
438 ptencode(sig
, &RX
, &RY
, &RZ
);
440 /* Calculate the scalar part. */
442 sha512_hash(&h
, sig
, 32);
443 sha512_hash(&h
, K
, 32);
444 sha512_hash(&h
, m
, msz
);
446 scaf_loaddbl(tt
, b
, 64, 2*NPIECE
, PIECEWD
);
447 scaf_reduce(t
, tt
, l
, mu
, NPIECE
, PIECEWD
, scratch
);
448 scaf_mul(tt
, t
, a
, NPIECE
);
449 for (i
= 0; i
< NPIECE
; i
++) tt
[i
] += r
[i
];
450 scaf_reduce(t
, tt
, l
, mu
, NPIECE
, PIECEWD
, scratch
);
451 scaf_store(sig
+ 32, 32, t
, NPIECE
, PIECEWD
);
454 /* --- @ed25519_verify@ --- *
456 * Arguments: @const octet K[ED25519_PUBSZ]@ = public key
457 * @const void *m@ = message to sign
458 * @size_t msz@ = length of message
459 * @const octet sig[ED25519_SIGSZ]@ = signature
461 * Returns: Zero if OK, negative on failure.
463 * Use: Verify a signature.
466 int ed25519_verify(const octet K
[ED25519_PUBSZ
],
467 const void *m
, size_t msz
,
468 const octet sig
[ED25519_SIGSZ
])
471 scaf_piece s
[NPIECE
], t
[NPIECE
], scratch
[3*NPIECE
+ 1];
472 scaf_dblpiece tt
[2*NPIECE
];
473 f25519 AX
, AY
, AZ
, RX
, RY
, RZ
;
474 octet b
[SHA512_HASHSZ
];
476 /* Unpack the public key. Negate it: we're meant to subtract the term
477 * involving the public key point, and this is easier than negating the
480 if (ptdecode(&AX
, &AY
, &AZ
, K
)) return (-1);
481 f25519_neg(&AX
, &AX
);
483 /* Check the signature. */
485 sha512_hash(&h
, sig
, 32);
486 sha512_hash(&h
, K
, 32);
487 sha512_hash(&h
, m
, msz
);
489 scaf_load(s
, sig
+ 32, 32, NPIECE
, PIECEWD
);
490 scaf_loaddbl(tt
, b
, 64, 2*NPIECE
, PIECEWD
);
491 scaf_reduce(t
, tt
, l
, mu
, NPIECE
, PIECEWD
, scratch
);
492 ptsimmul(&RX
, &RY
, &RZ
, s
, BX
, BY
, BZ
, t
, &AX
, &AY
, &AZ
);
493 ptencode(b
, &RX
, &RY
, &RZ
);
494 if (memcmp(b
, sig
, 32) != 0) return (-1);
500 /*----- Test rig ----------------------------------------------------------*/
507 #include <mLib/report.h>
508 #include <mLib/testrig.h>
510 static int vrf_pubkey(dstr dv
[])
512 dstr dpub
= DSTR_INIT
;
515 if (dv
[1].len
!= 32) die(1, "bad pub length");
517 dstr_ensure(&dpub
, 32); dpub
.len
= 32;
518 ed25519_pubkey((octet
*)dpub
.buf
, dv
[0].buf
, dv
[0].len
);
519 if (memcmp(dpub
.buf
, dv
[1].buf
, 64) != 0) {
521 fprintf(stderr
, "failed!");
522 fprintf(stderr
, "\n\tpriv = "); type_hex
.dump(&dv
[0], stderr
);
523 fprintf(stderr
, "\n\tcalc = "); type_hex
.dump(&dpub
, stderr
);
524 fprintf(stderr
, "\n\twant = "); type_hex
.dump(&dv
[1], stderr
);
525 fprintf(stderr
, "\n");
532 static int vrf_sign(dstr dv
[])
534 octet K
[ED25519_PUBSZ
];
535 dstr dsig
= DSTR_INIT
;
538 if (dv
[2].len
!= 64) die(1, "bad result length");
540 dstr_ensure(&dsig
, 64); dsig
.len
= 64;
541 ed25519_pubkey(K
, dv
[0].buf
, dv
[0].len
);
542 ed25519_sign((octet
*)dsig
.buf
, dv
[0].buf
, dv
[0].len
, K
,
543 dv
[1].buf
, dv
[1].len
);
544 if (memcmp(dsig
.buf
, dv
[2].buf
, 64) != 0) {
546 fprintf(stderr
, "failed!");
547 fprintf(stderr
, "\n\tpriv = "); type_hex
.dump(&dv
[0], stderr
);
548 fprintf(stderr
, "\n\t msg = "); type_hex
.dump(&dv
[1], stderr
);
549 fprintf(stderr
, "\n\tcalc = "); type_hex
.dump(&dsig
, stderr
);
550 fprintf(stderr
, "\n\twant = "); type_hex
.dump(&dv
[2], stderr
);
551 fprintf(stderr
, "\n");
558 static int vrf_verify(dstr dv
[])
560 int rc_want
, rc_calc
;
563 if (dv
[0].len
!= 32) die(1, "bad pub length");
564 if (dv
[2].len
!= 64) die(1, "bad sig length");
565 rc_want
= *(int *)dv
[3].buf
;
567 rc_calc
= ed25519_verify((const octet
*)dv
[0].buf
,
568 dv
[1].buf
, dv
[1].len
,
569 (const octet
*)dv
[2].buf
);
570 if (!rc_want
!= !rc_calc
) {
572 fprintf(stderr
, "failed!");
573 fprintf(stderr
, "\n\t pub = "); type_hex
.dump(&dv
[0], stderr
);
574 fprintf(stderr
, "\n\t msg = "); type_hex
.dump(&dv
[1], stderr
);
575 fprintf(stderr
, "\n\t sig = "); type_hex
.dump(&dv
[2], stderr
);
576 fprintf(stderr
, "\n\tcalc = %d", rc_calc
);
577 fprintf(stderr
, "\n\twant = %d", rc_want
);
578 fprintf(stderr
, "\n");
584 static test_chunk tests
[] = {
585 { "pubkey", vrf_pubkey
, { &type_hex
, &type_hex
} },
586 { "sign", vrf_sign
, { &type_hex
, &type_hex
, &type_hex
} },
587 { "verify", vrf_verify
, { &type_hex
, &type_hex
, &type_hex
, &type_int
} },
591 int main(int argc
, char *argv
[])
593 test_run(argc
, argv
, tests
, SRCDIR
"/t/ed25519");
599 /*----- That's all, folks -------------------------------------------------*/