mirror of
https://github.com/Cisco-Talos/clamav.git
synced 2025-10-19 10:23:17 +00:00
375ecf678c
Update the vendored TomsFastMath (TFM) library to v0.13.1. Resolves: https://bugzilla.clamav.net/show_bug.cgi?id=11992 I removed compatibility macro's from when libTomMath was used. This required removing a bunch of faux-error handling because the fast-math equivalent functions return void, and cannot fail. The previous version used had named the header "bignum_fast.h" instead of "tfm.h" and had customizations in that header to enable TFM_CHECK all the time, and also TFM_NO_ASM if __GNUC__ not defined or if the system isn't 64bit architecture. This update uses tfm.h as-is, and has CMake define TFM_CHECK and TFM_NO_ASM as needed. I've kept bignum.h as an interface to including tfm.h so that in the future we can more easily add support for system-installed TomsFastMath instead of the vendored one, taking inspiration from Debian's patch to support system-TomsFastMath. See: https://salsa.debian.org/clamav-team/clamav/-/blob/unstable/debian/patches/add-support-for-system-tomsfastmath.patch
43 lines
995 B
C
43 lines
995 B
C
/* TomsFastMath, a fast ISO C bignum library.
|
|
*
|
|
* This project is meant to fill in where LibTomMath
|
|
* falls short. That is speed ;-)
|
|
*
|
|
* This project is public domain and free for all purposes.
|
|
*
|
|
* Tom St Denis, tomstdenis@gmail.com
|
|
*/
|
|
#include <tfm_private.h>
|
|
|
|
/* computes a = B**n mod b without division or multiplication useful for
|
|
* normalizing numbers in a Montgomery system.
|
|
*/
|
|
void fp_montgomery_calc_normalization(fp_int *a, fp_int *b)
|
|
{
|
|
int x, bits;
|
|
|
|
/* how many bits of last digit does b use */
|
|
bits = fp_count_bits (b) % DIGIT_BIT;
|
|
if (!bits) bits = DIGIT_BIT;
|
|
|
|
/* compute A = B^(n-1) * 2^(bits-1) */
|
|
if (b->used > 1) {
|
|
fp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1);
|
|
} else {
|
|
fp_set(a, 1);
|
|
bits = 1;
|
|
}
|
|
|
|
/* now compute C = A * B mod b */
|
|
for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
|
|
fp_mul_2 (a, a);
|
|
if (fp_cmp_mag (a, b) != FP_LT) {
|
|
s_fp_sub (a, b, a);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/* $Source$ */
|
|
/* $Revision$ */
|
|
/* $Date$ */
|