Crypto.SecretSharing.Internal

Documentation

data ByteShare

A share of an encoded byte.

Constructors

ByteShare

Fields

shareId :: !Int

the index of this share

reconstructionThreshold :: !Int

number of shares required for reconstruction

shareValue :: !Int

the value of p(shareId) where p(x) is the generated (secret) polynomial

Instances

Eq ByteShare

Show ByteShare

Generic ByteShare

Binary ByteShare

Typeable * ByteShare

type Rep ByteShare

data Share

A share of the encoded secret.

Constructors

Share

Fields

theShare :: ![ByteShare]

Instances

Eq Share

Show Share

Generic Share

Binary Share

Typeable * Share

type Rep Share

encode

Arguments

:: Int

m

-> Int

n

-> ByteString

the secret that we want to share

-> IO [Share]

Encodes a ByteString as a list of n shares, m of which are required for reconstruction. Lives in the IO to access a random source.

decode

Arguments

:: [Share]

list of at least m shares

-> ByteString

reconstructed secret

Reconstructs a (secret) bytestring from a list of (at least m) shares. Throws AssertionFailed if the number of shares is too small.

encodeByte :: Int -> Int -> Polyn -> FField -> Vector ByteShare

decodeByte :: [ByteShare] -> FField

groupInto :: Int -> [a] -> [[a]]

Groups a list into blocks of certain size. Running time: O(n)

newtype FField

A finite prime field. All computations are performed in this field.

Constructors

FField

Fields

number :: PrimeField (I (O (I (I (I (I (I (I (I (I Z))))))))))

Instances

Eq FField

Fractional FField

Num FField

Ord FField

Read FField

Show FField

Generic FField

FiniteField FField

Typeable * FField

type Rep FField

prime :: Int

The size of the finite field

type Polyn = [FField]

A polynomial over the finite field given as a list of coefficients.

evalPolynomial :: Polyn -> FField -> FField

Evaluates the polynomial at a given point.