Enum NPrimeMethod 

pub enum NPrimeMethod {
    TrialSearch,
    ExtendedEuclidean,
    HenselsLifting,
    Newton,
}

Methods for computing N’ in Montgomery parameter computation

Variants

TrialSearch

Trial search - O(R) complexity, simple but slow for large R. Only works when R fits in the type (R > N, smallest power of 2).

ExtendedEuclidean

Extended Euclidean Algorithm - O(log R) complexity. Only works when R fits in the type (R > N, smallest power of 2).

HenselsLifting

Hensel’s lifting - O(log R) complexity, optimized for R = 2^k. Only works when R fits in the type (R > N, smallest power of 2).

Newton

Newton’s method - O(log W) complexity, works with R = 2^W (full type width). Uses wrapping arithmetic so R never needs to be represented explicitly. This is the method used internally by the wide-REDC path; other methods are accepted for API compatibility but all use Newton internally.

Trait Implementations

impl Clone for NPrimeMethod

fn clone(&self) -> NPrimeMethod

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NPrimeMethod

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

Formats the value using the given formatter.

impl Default for NPrimeMethod

fn default() -> NPrimeMethod

Returns the “default value” for a type.

impl PartialEq for NPrimeMethod

fn eq(&self, other: &NPrimeMethod) -> 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 Copy for NPrimeMethod

impl Eq for NPrimeMethod

impl StructuralPartialEq for NPrimeMethod