Skip to main content
Module div_mod_2k
crypto_
bigint
0.7.3
In crypto_
bigint::
modular::
bingcd
crypto_bigint
::
modular
::
bingcd
Module
div_
mod_
2k
Copy item path
Source
Expand description
Compute
x / 2^k mod q
for some prime
q
.