27 lines
832 B
C
27 lines
832 B
C
/* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an
|
|
unpublished work protected as such under copyright law. This work
|
|
contains proprietary, confidential, and trade secret information of
|
|
RSA Data Security, Inc. Use, disclosure or reproduction without the
|
|
express written authorization of RSA Data Security, Inc. is
|
|
prohibited.
|
|
*/
|
|
|
|
#include "global.h"
|
|
#include "bigmath.h"
|
|
|
|
/* BigModMpyx (a, b, c, d, dInv, n) -- a = (b * c) mod d !! EXPRESS.
|
|
-- assumes a, b, c, d of length n, dInv of length n+2.
|
|
-- assumes dInv previously computed by BigInv.
|
|
*/
|
|
void BigModMpyx (a, b, c, d, dInv, n)
|
|
UINT2 *a, *b, *c, *d, *dInv;
|
|
unsigned int n;
|
|
{
|
|
UINT2 prod[2 * MAX_RSA_MODULUS_WORDS];
|
|
|
|
BigPmpy (prod, b, c, n);
|
|
BigModx (a, prod, d, dInv, n);
|
|
|
|
T_memset ((POINTER)prod, 0, sizeof (prod));
|
|
}
|