tree 37cf2929a45ab0f0f640e5440a4d89b6c09aab6a
parent 24db39fb2983ca83ab5c6ee37cb57a4f7f6f94e6
author Michael Brown <mcb30@ipxe.org> 1734361796 +0000
committer Michael Brown <mcb30@ipxe.org> 1734362017 +0000

[crypto] Calculate inverse of modulus on demand in bigint_montgomery()

Reduce the number of parameters passed to bigint_montgomery() by
calculating the inverse of the modulus modulo the element size on
demand.  Cache the result, since Montgomery reduction will be used
repeatedly with the same modulus value.

In all currently supported algorithms, the modulus is a public value
(or a fixed value defined by specification) and so this non-constant
timing does not leak any private information.

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