| commit | 2bf16c6ffca1e294bb8233d19c9c36e43b31f041 | [log] [tgz] |
|---|---|---|
| author | Michael Brown <mcb30@ipxe.org> | Tue Oct 15 13:50:51 2024 +0100 |
| committer | Michael Brown <mcb30@ipxe.org> | Tue Oct 15 13:50:51 2024 +0100 |
| tree | d685c77f9e63e709ec80b84439e17f16ee5b5a40 | |
| parent | f78c5a763cc7bb2e2b7b437e7cc74a3efb876960 [diff] |
[crypto] Separate out bigint_reduce() from bigint_mod_multiply() Faster modular multiplication algorithms such as Montgomery multiplication will still require the ability to perform a single direct modular reduction. Neaten up the implementation of direct reduction and split it out into a separate bigint_reduce() function, complete with its own unit tests. Signed-off-by: Michael Brown <mcb30@ipxe.org>