Files
ipxe/src/tests
Michael Brown 3f4f843920 [crypto] Eliminate temporary carry space for big integer multiplication
An n-bit multiplication product may be added to up to two n-bit
integers without exceeding the range of a (2n)-bit integer:

  (2^n - 1)*(2^n - 1) + (2^n - 1) + (2^n - 1) = 2^(2n) - 1

Exploit this to perform big integer multiplication in constant time
without requiring the caller to provide temporary carry space.

Signed-off-by: Michael Brown <mcb30@ipxe.org>
2024-09-27 13:51:24 +01:00
..
2016-07-29 01:12:58 +01:00
2016-07-29 01:12:58 +01:00
2016-05-05 23:42:57 +01:00
2016-07-29 01:12:58 +01:00
2016-07-29 01:13:27 +01:00
2015-04-12 17:01:10 +01:00
2024-05-31 10:11:22 +01:00