3 * $Id: gfshare.h,v 1.1 2000/06/17 10:56:30 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.1 2000/06/17 10:56:30 mdw
34 * Fast but nonstandard secret sharing system.
38 #ifndef CATACOMB_GFSHARE_H
39 #define CATACOMB_GFSHARE_H
45 /*----- Header files ------------------------------------------------------*/
47 #include <mLib/bits.h>
49 #ifndef CATACOMB_GRAND_H
53 /*----- Data structures ---------------------------------------------------*/
55 /* --- A secret sharing context --- */
57 typedef struct gfshare_pt
{
58 octet x
; /* %$x$%-coordinate of the share */
59 octet
*y
; /* Pointer to share payload */
62 typedef struct gfshare
{
63 unsigned t
; /* Threshold */
64 unsigned n
; /* The number of shares to make */
65 unsigned i
; /* Next free slot in vector */
66 size_t sz
; /* Size of the secret and shares */
67 octet
*s
; /* The secret */
68 gfshare_pt
*v
; /* Vector of share information */
71 #define GFSHARE_INIT(t, n, sz) { t, n, 0, sz, 0, 0 }
73 /*----- Functions provided ------------------------------------------------*/
75 /* --- @gfshare_create@ --- *
77 * Arguments: @gfshare *s@ = pointer to share context to initialize
78 * @unsigned t, n@ = threshold parameters for the system
79 * @size_t sz@ = size of the secret
83 * Use: Initializes a sharing context.
86 extern void gfshare_create(gfshare */
*s*/
, unsigned /*t*/, unsigned /*n*/,
89 /* --- @gfshare_destroy@ --- *
91 * Arguments: @gfshare *s@ = pointer to share context to destroy
95 * Use: Disposes of a sharing context. The allocations for the
96 * individual shares and the vector @v@ are freed; the secret is
100 extern void gfshare_destroy(gfshare */
*s*/
);
102 /* --- @gfshare_mkshares@ --- *
104 * Arguments: @gfshare *s@ = pointer to share context to fill in
105 * @grand *r@ = pointer to random number source
109 * Use: Generates @c->n@ secret shares, such that any @c->t@ of them
110 * may be used to recover the secret.
112 * The context structure is expected to be mostly filled in. In
113 * particular, @t@, @n@, @ssz@ and @s@ must be initialized. If
114 * @v@ is zero, a vector of appropriate size is allocated. You
115 * should use the macro @GFSHARE_INIT@ or @gfshare_create@ to
116 * construct sharing contexts.
119 extern void gfshare_mkshares(gfshare */
*s*/
, grand */
*r*/
);
121 /* --- @gfshare_add@ --- *
123 * Arguments: @gfshare *s@ = pointer to sharing context
124 * @unsigned x@ = which share number this is
125 * @const octet *y@ = the share value
127 * Returns: Number of shares required before recovery may be performed.
129 * Use: Adds a share to the context. The context must have been
130 * initialized with the correct threshold @t@.
133 extern unsigned gfshare_add(gfshare */
*s*/
,
134 unsigned /*x*/, const octet */
*y*/
);
136 /* --- @gfshare_combine@ --- *
138 * Arguments: @gfshare *s@ = pointer to share context
139 * @octet *buf@ = pointer to output buffer for the secret
143 * Use: Reconstructs a secret, given enough shares.
146 extern void gfshare_combine(gfshare */
*s*/
, octet */
*buf*/
);
148 /*----- That's all, folks -------------------------------------------------*/