arcium-primitives 0.6.0

Arcium primitives
Documentation
1
2
3
4
5
6
use crate::{algebra::field::Bit, sharing::BitShare, types::HeapArray};

/// `N`-bit integer represented as a Boolean vector.
pub type IntegerRing<N> = HeapArray<Bit, N>;
/// Additive share of an `N`-bit integer (per-bit binary shares).
pub type IntegerRingShare<N> = HeapArray<BitShare, N>;