Struct asmuth_bloom_secret_sharing::AsmuthBloomShare

pub struct AsmuthBloomShare { /* fields omitted */ }

Generator of shared secrects

Methods

impl AsmuthBloomShare

fn new(max_bits: u16, shares: u16, threshold: u16, error_level: f64) -> Self

Creates new object for generating shared secrects max_bits - secret always has to be smaller than this limit, minimum is 8, above 800 can cause performance issues shares - total number of shares to generate threshhold - minimum number of shared secrects need to recover original secret error_level - probablity that one of geneated moduli is not prime add there some small number like 1e-9 -see below

Asmuth-Bloom scheme depends on the Chinese Reminder Theorem, which requires that moduli are pairwise coprime. To assure that we generate them as prime numbers, but since they are big we use probabilistic Miller Rabin test. Problem can arise only when they are two false primes with GCD bigger the 1.

fn create_share(&mut self, secret: &[u8]) -> Result<ABSharedSecret, Error>

creates shared secrets