tommath/bn_mp_expt_d.c

58 lines
1.3 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#ifdef BN_MP_EXPT_D_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2006-04-06 15:49:59 -04:00
* Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
2003-02-28 11:08:34 -05:00
*/
2003-05-29 09:35:26 -04:00
/* calculate c = a**b using a square-multiply algorithm */
2003-12-24 13:59:22 -05:00
int mp_expt_d (mp_int * a, mp_digit b, mp_int * c)
2003-02-28 11:08:34 -05:00
{
2003-02-28 11:09:08 -05:00
int res, x;
mp_int g;
2003-02-28 11:08:34 -05:00
if ((res = mp_init_copy (&g, a)) != MP_OKAY) {
return res;
}
/* set initial result */
mp_set (c, 1);
for (x = 0; x < (int) DIGIT_BIT; x++) {
2003-03-29 13:16:01 -05:00
/* square */
2003-02-28 11:08:34 -05:00
if ((res = mp_sqr (c, c)) != MP_OKAY) {
mp_clear (&g);
return res;
}
2003-05-17 08:33:54 -04:00
/* if the bit is set multiply */
if ((b & (mp_digit) (((mp_digit)1) << (DIGIT_BIT - 1))) != 0) {
2003-02-28 11:08:34 -05:00
if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
2003-05-17 08:33:54 -04:00
mp_clear (&g);
return res;
2003-02-28 11:08:34 -05:00
}
}
2003-03-29 13:16:01 -05:00
/* shift to next bit */
2003-02-28 11:08:34 -05:00
b <<= 1;
}
mp_clear (&g);
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */