Skip to main content

ladder

logicaffeine_proof::elliptic

Function ladder 

Source 
pub fn ladder(
    k: u64,
    x: &BigInt,
    z: &BigInt,
    a24: &BigInt,
    n: &BigInt,
) -> (BigInt, BigInt)
Expand description

Scalar multiplication k·(X:Z) on a Montgomery curve mod n by the Montgomery ladder — a uniform sequence of one double and one differential-add per bit, maintaining the invariant R1 − R0 = P.