This module provides an (m,n)-information dispersal scheme that provides data redundancy while preserving secrecy. In other words, this module combines the best of 2 worlds: secret sharing algorithms with low-overhead information dispersal.

Function encode splits a given bytestring into n fragments with the following properties:

1. Any m of the n fragments are sufficient for reconstructing the original bytestring via decode, and
2. the knowledge of up to m-1 fragments does not leak any information about the original bytestring.

In more detail, suppose that we have some bytestring b that we want to (securely) disperse and parameter m, n. Running encode m n b does the following:

• Generate a randomly chosen key of 32 bytes, called key.
• Encrypt the bytestring b using key via AES.
• Generate n shares using the perfect secret sharing algorithm implemented in module Crypto.SecretSharing; see package http://hackage.haskell.org/package/secret-sharingsecret-sharing
• Generate n fragments of the encrypted data using the information dispersal algorithm in Data.IDA.
• Finally, we pair up these shares and fragments as a list of EncryptedFragments.

The size of each encrypted fragment is O(|b|/m + |key|). For sufficiently large bytestrings, the O(|b|/m) factor dominates and thus the scheme is space-optimal.

The secret sharing algorithm guarantess that the knowledge of up to m-1 of the fragments does not leak any information about the encryption key (and hence the encrypted data).