sysadmin/ipxe
1
0
Fork 0
mirror of https://github.com/ipxe/ipxe synced 2025-12-17 18:11:49 +03:00
Code Issues Packages Projects Releases Wiki Activity

[crypto] Add bigint_montgomery() to perform Montgomery reduction

Browse Source 
Montgomery reduction is substantially faster than direct reduction,
and is better suited for modular exponentiation operations.

Add bigint_montgomery() to perform the Montgomery reduction operation
(often referred to as "REDC"), along with some test vectors.

Signed-off-by: Michael Brown <mcb30@ipxe.org>
This commit is contained in:
Michael Brown
2024-11-27 13:25:18 +00:00
parent 96f385d7a4
commit 4f7dd7fbba
3 changed files with 174 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
src/include/ipxe/bigint.h
View File

@@ -253,6 +253,23 @@ FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
(inverse)->element, size ); \
} while ( 0 )
/**
* Perform Montgomery reduction (REDC) of a big integer product
*
* @v modulus Big integer modulus
* @v modinv Big integer inverse of the modulus modulo 2^k
* @v mont Big integer Montgomery product
* @v result Big integer to hold result
*
* Note that the Montgomery product will be overwritten.
*/
#define bigint_montgomery( modulus, modinv, mont, result ) do { \
unsigned int size = bigint_size (modulus); \
bigint_montgomery_raw ( (modulus)->element, (modinv)->element, \
(mont)->element, (result)->element, \
size ); \
} while ( 0 )
/**
* Perform modular multiplication of big integers
*
@@ -396,6 +413,10 @@ void bigint_reduce_raw ( bigint_element_t *modulus0, bigint_element_t *value0,
unsigned int size );
void bigint_mod_invert_raw ( const bigint_element_t *invertend0,
bigint_element_t *inverse0, unsigned int size );
void bigint_montgomery_raw ( const bigint_element_t *modulus0,
const bigint_element_t *modinv0,
bigint_element_t *mont0,
bigint_element_t *result0, unsigned int size );
void bigint_mod_multiply_raw ( const bigint_element_t *multiplicand0,
const bigint_element_t *multiplier0,
const bigint_element_t *modulus0,