chiark / gitweb /
Implement efficient reduction for pleasant-looking primes.
[catacomb] / mpreduce-exp.h
1 /* -*-c-*-
2  *
3  * $Id: mpreduce-exp.h,v 1.1 2004/03/27 00:04:46 mdw Exp $
4  *
5  * Exponentiation operations for binary field reduction
6  *
7  * (c) 2004 Straylight/Edgeware
8  */
9
10 /*----- Licensing notice --------------------------------------------------* 
11  *
12  * This file is part of Catacomb.
13  *
14  * Catacomb is free software; you can redistribute it and/or modify
15  * it under the terms of the GNU Library General Public License as
16  * published by the Free Software Foundation; either version 2 of the
17  * License, or (at your option) any later version.
18  * 
19  * Catacomb is distributed in the hope that it will be useful,
20  * but WITHOUT ANY WARRANTY; without even the implied warranty of
21  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
22  * GNU Library General Public License for more details.
23  * 
24  * You should have received a copy of the GNU Library General Public
25  * License along with Catacomb; if not, write to the Free
26  * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
27  * MA 02111-1307, USA.
28  */
29
30 /*----- Revision history --------------------------------------------------* 
31  *
32  * $Log: mpreduce-exp.h,v $
33  * Revision 1.1  2004/03/27 00:04:46  mdw
34  * Implement efficient reduction for pleasant-looking primes.
35  *
36  * Revision 1.2  2004/03/21 22:52:06  mdw
37  * Merge and close elliptic curve branch.
38  *
39  * Revision 1.1.2.1  2004/03/21 22:39:46  mdw
40  * Elliptic curves on binary fields work.
41  *
42  */
43
44 #ifndef CATACOMB_MPREDUCE_EXP_H
45 #define CATACOMB_MPREDUCE_EXP_H
46
47 #ifdef __cplusplus
48   extern "C" {
49 #endif
50
51 /*----- Exponentiation definitions ----------------------------------------*/
52
53 #define EXP_TYPE mp *
54
55 #define EXP_COPY(d, x) d = MP_COPY(x)
56 #define EXP_DROP(x) MP_DROP(x)
57
58 #define EXP_MUL(a, x) do {                                              \
59   mp *t = mp_mul(spare, a, x);                                          \
60   spare = a;                                                            \
61   a = mpreduce_do(mr, t, t);                                            \
62 } while (0)
63
64 #define EXP_SQR(a) do {                                                 \
65   mp *t = mp_sqr(spare, a);                                             \
66   spare = a;                                                            \
67   a = mpreduce_do(mr, t, t);                                            \
68 } while (0)
69
70 #define EXP_FIX(x)
71
72 #define EXP_SETMUL(d, x, y) do {                                        \
73   d = mp_mul(MP_NEW, x, y);                                             \
74   d = mpreduce_do(mr, d, d);                                            \
75 } while (0)
76
77 #define EXP_SETSQR(d, x) do {                                           \
78   d = mp_sqr(MP_NEW, x);                                                \
79   d = mpreduce_do(mr, d, d);                                            \
80 } while (0)
81
82 #include "exp.h"
83
84 /*----- That's all, folks -------------------------------------------------*/
85
86 #ifdef __cplusplus
87   }
88 #endif
89
90 #endif