Struct Gcd 

pub struct Gcd<'a> { /* private fields */ }

Given BinaryBundles a and b, output GCD(a, b).

Implementations

impl<'a> Gcd<'a>

pub fn new(upper_bound: usize) -> Self

Create a new Gcd circuit using a fixed upper bound.

Since the circuit needs to be oblivious, we cannot terminate the GCD algorithm by conditioning on the values of a or b as is the case in the “standard” version of GCD. Instead, we rely on an upper bound on the number of iterations we know the algorithm will terminate by. The Euclidean algorithm based on subtractions will take no more than N steps where N is the larger of the two numbers we are computing the GCD for.

Trait Implementations

impl<'a, F: FancyBinary> Circuit<F> for Gcd<'a>

where F::Item: 'a,

type Input = (&'a BinaryBundle<<F as Fancy>::Item>, &'a BinaryBundle<<F as Fancy>::Item>)

The input type of the circuit.

type Output = BinaryBundle<<F as Fancy>::Item>

The output type of the circuit.

fn execute( &self, backend: &mut F, inputs: Self::Input, channel: &mut Channel<'_>, ) -> Result<Self::Output>

Execute a circuit on a given Fancy backend using the provided inputs.

impl<'a> Default for Gcd<'a>

fn default() -> Gcd<'a>

Returns the “default value” for a type.