3 * $Id: gfshare.h,v 1.2 2000/06/17 11:05:27 mdw Exp $
5 * Secret sharing over %$\gf(2^8)$%
7 * (c) 2000 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.2 2000/06/17 11:05:27 mdw
34 * Add a commentary on the system.
36 * Revision 1.1 2000/06/17 10:56:30 mdw
37 * Fast but nonstandard secret sharing system.
41 /*----- Notes on the system -----------------------------------------------*
43 * This uses a variant of Shamir's secret sharing system. Shamir's original
44 * system used polynomials modulo a large prime. This implementation instead
45 * uses the field %$\gf(2^8)$%, represented by
47 * %$\gf(2)[x]/(x^8 + x^4 + x^3 + x^2 + 1)$%
49 * and shares each byte of the secret independently. It is therefore limited
50 * to 255 players, although this probably isn't a serious limitation in
53 * Share creation and reconstruction is extremely efficient. Contrast the
54 * performance of the straightforward implementation based on multiprecision
58 #ifndef CATACOMB_GFSHARE_H
59 #define CATACOMB_GFSHARE_H
65 /*----- Header files ------------------------------------------------------*/
67 #include <mLib/bits.h>
69 #ifndef CATACOMB_GRAND_H
73 /*----- Data structures ---------------------------------------------------*/
75 /* --- A secret sharing context --- */
77 typedef struct gfshare_pt
{
78 octet x
; /* %$x$%-coordinate of the share */
79 octet
*y
; /* Pointer to share payload */
82 typedef struct gfshare
{
83 unsigned t
; /* Threshold */
84 unsigned n
; /* The number of shares to make */
85 unsigned i
; /* Next free slot in vector */
86 size_t sz
; /* Size of the secret and shares */
87 octet
*s
; /* The secret */
88 gfshare_pt
*v
; /* Vector of share information */
91 #define GFSHARE_INIT(t, n, sz) { t, n, 0, sz, 0, 0 }
93 /*----- Functions provided ------------------------------------------------*/
95 /* --- @gfshare_create@ --- *
97 * Arguments: @gfshare *s@ = pointer to share context to initialize
98 * @unsigned t, n@ = threshold parameters for the system
99 * @size_t sz@ = size of the secret
103 * Use: Initializes a sharing context.
106 extern void gfshare_create(gfshare */
*s*/
, unsigned /*t*/, unsigned /*n*/,
109 /* --- @gfshare_destroy@ --- *
111 * Arguments: @gfshare *s@ = pointer to share context to destroy
115 * Use: Disposes of a sharing context. The allocations for the
116 * individual shares and the vector @v@ are freed; the secret is
120 extern void gfshare_destroy(gfshare */
*s*/
);
122 /* --- @gfshare_mkshares@ --- *
124 * Arguments: @gfshare *s@ = pointer to share context to fill in
125 * @grand *r@ = pointer to random number source
129 * Use: Generates @c->n@ secret shares, such that any @c->t@ of them
130 * may be used to recover the secret.
132 * The context structure is expected to be mostly filled in. In
133 * particular, @t@, @n@, @ssz@ and @s@ must be initialized. If
134 * @v@ is zero, a vector of appropriate size is allocated. You
135 * should use the macro @GFSHARE_INIT@ or @gfshare_create@ to
136 * construct sharing contexts.
139 extern void gfshare_mkshares(gfshare */
*s*/
, grand */
*r*/
);
141 /* --- @gfshare_add@ --- *
143 * Arguments: @gfshare *s@ = pointer to sharing context
144 * @unsigned x@ = which share number this is
145 * @const octet *y@ = the share value
147 * Returns: Number of shares required before recovery may be performed.
149 * Use: Adds a share to the context. The context must have been
150 * initialized with the correct threshold @t@.
153 extern unsigned gfshare_add(gfshare */
*s*/
,
154 unsigned /*x*/, const octet */
*y*/
);
156 /* --- @gfshare_combine@ --- *
158 * Arguments: @gfshare *s@ = pointer to share context
159 * @octet *buf@ = pointer to output buffer for the secret
163 * Use: Reconstructs a secret, given enough shares.
166 extern void gfshare_combine(gfshare */
*s*/
, octet */
*buf*/
);
168 /*----- That's all, folks -------------------------------------------------*/