Module bingcd 

This module implements (a constant variant of) the Optimized Extended Binary GCD algorithm, which is described by Pornin as Algorithm 2 in “Optimized Binary GCD for Modular Inversion”. Ref: https://eprint.iacr.org/2020/972.pdf

Modules

compact 🔒

div_mod_2k 🔒

Compute x / 2^k mod q for some prime q.

extension 🔒

gcd 🔒

matrix 🔒

xgcd 🔒

The Binary Extended GCD algorithm.