Struct AlgebraicAttack 

pub struct AlgebraicAttack {
    pub order: usize,
    pub degree: usize,
    pub anf_terms: usize,
    pub anf: Vec<bool>,
    pub truth_table: usize,
}

The certified result of an algebraic-recurrence attack: a low-degree nonlinear feedback register that regenerates a byte string, recovered by [describe::detect_algebraic_recurrence]. This is the OPEN rung — where maximal order complexity can only measure a nonlinear register (its 2^order truth table), the algebraic attack recovers it as a sparse ANF and thereby compresses it, when the feedback has low degree. The anf is a re-checkable witness (replay it with the seed).

Fields

order: usize

The register length L — how many past bits the feedback reads.

degree: usize

The ANF degree bound d the recovery used.

anf_terms: usize

The number of active ANF coefficients — the description size, O(Lᵈ).

anf: Vec<bool>

The recovered ANF over monomials(order, degree) — the witness (algebraic_generate replays it).

truth_table: usize

2^order — the truth-table size maximal order complexity would need for the same register.

Trait Implementations

impl Clone for AlgebraicAttack

fn clone(&self) -> AlgebraicAttack

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AlgebraicAttack

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for AlgebraicAttack

fn eq(&self, other: &AlgebraicAttack) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for AlgebraicAttack

impl StructuralPartialEq for AlgebraicAttack