tree ada42236cae9c3c4af021eba46065a936729b85d
parent c69f9589cc7543baba08dbabdb5c30104fadaa34
author Michael Brown <mcb30@ipxe.org> 1729523384 +0100
committer Michael Brown <mcb30@ipxe.org> 1729527893 +0100

[crypto] Add bigint_mod_invert() to calculate inverse modulo a power of two

Montgomery multiplication requires calculating the inverse of the
modulus modulo a larger power of two.

Add bigint_mod_invert() to calculate the inverse of any (odd) big
integer modulo an arbitrary power of two, using a lightly modified
version of the algorithm presented in "A New Algorithm for Inversion
mod p^k (Koç, 2017)".

The power of two is taken to be 2^k, where k is the number of bits
available in the big integer representation of the invertend.  The
inverse modulo any smaller power of two may be obtained simply by
masking off the relevant bits in the inverse.

Signed-off-by: Michael Brown <mcb30@ipxe.org>