Blame view

Giac_maj/libtommath-0.39/bn_mp_expt_d.c 1.36 KB
6663b6c9   adorian   projet complet av...
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
  #include <tommath.h>
  #ifdef BN_MP_EXPT_D_C
  /* LibTomMath, multiple-precision integer library -- Tom St Denis
   *
   * LibTomMath is a library that provides multiple-precision
   * integer arithmetic as well as number theoretic functionality.
   *
   * The library was designed directly after the MPI library by
   * 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.
   *
   * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
   */
  
  /* calculate c = a**b  using a square-multiply algorithm */
  int mp_expt_d (mp_int * a, mp_digit b, mp_int * c)
  {
    int     res, x;
    mp_int  g;
  
    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++) {
      /* square */
      if ((res = mp_sqr (c, c)) != MP_OKAY) {
        mp_clear (&g);
        return res;
      }
  
      /* if the bit is set multiply */
      if ((b & (mp_digit) (((mp_digit)1) << (DIGIT_BIT - 1))) != 0) {
        if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
           mp_clear (&g);
           return res;
        }
      }
  
      /* shift to next bit */
      b <<= 1;
    }
  
    mp_clear (&g);
    return MP_OKAY;
  }
  #endif
  
  /* $Source: /cvs/libtom/libtommath/bn_mp_expt_d.c,v $ */
  /* $Revision: 1.3 $ */
  /* $Date: 2006/03/31 14:18:44 $ */