version 1.3, 2000/08/22 05:04:05 |
version 1.4, 2001/10/09 01:36:11 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/engine/gf2n.c,v 1.2 2000/08/21 08:31:27 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/gf2n.c,v 1.3 2000/08/22 05:04:05 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 54 extern int lm_lazy; |
|
Line 54 extern int lm_lazy; |
|
|
|
GEN_UP2 current_mod_gf2n; |
GEN_UP2 current_mod_gf2n; |
|
|
void setmod_gf2n(p) |
void setmod_gf2n(P p) |
P p; |
|
{ |
{ |
if ( !current_mod_gf2n ) { |
if ( !current_mod_gf2n ) { |
current_mod_gf2n = (GEN_UP2)MALLOC(sizeof(struct oGEN_UP2)); |
current_mod_gf2n = (GEN_UP2)MALLOC(sizeof(struct oGEN_UP2)); |
|
|
ptoup2_sparse(p,¤t_mod_gf2n->sparse); |
ptoup2_sparse(p,¤t_mod_gf2n->sparse); |
} |
} |
|
|
void getmod_gf2n(p) |
void getmod_gf2n(UP2 *p) |
UP2 *p; |
|
{ |
{ |
if ( current_mod_gf2n ) |
if ( current_mod_gf2n ) |
*p = current_mod_gf2n->dense; |
*p = current_mod_gf2n->dense; |
|
|
*p = 0; |
*p = 0; |
} |
} |
|
|
void simpgf2n(n,r) |
void simpgf2n(GF2N n,GF2N *r) |
GF2N n; |
|
GF2N *r; |
|
{ |
{ |
UP2 rem; |
UP2 rem; |
|
|
|
|
} |
} |
} |
} |
|
|
void ptogf2n(q,l) |
void ptogf2n(Obj q,GF2N *l) |
Obj q; |
|
GF2N *l; |
|
{ |
{ |
UP2 q1; |
UP2 q1; |
|
|
|
|
error("ptogf2n : invalid argument"); |
error("ptogf2n : invalid argument"); |
} |
} |
|
|
void gf2ntop(q,l) |
void gf2ntop(GF2N q,P *l) |
GF2N q; |
|
P *l; |
|
{ |
{ |
if ( !q ) |
if ( !q ) |
*l = 0; |
*l = 0; |
|
|
up2top(q->body,l); |
up2top(q->body,l); |
} |
} |
|
|
void gf2ntovect(q,l) |
void gf2ntovect(GF2N q,VECT *l) |
GF2N q; |
|
VECT *l; |
|
{ |
{ |
if ( !q ) |
if ( !q ) |
*l = 0; |
*l = 0; |
|
|
|
|
#define NZGF2N(a) ((a)&&(OID(a)==O_N)&&(NID(a)==N_GF2N)) |
#define NZGF2N(a) ((a)&&(OID(a)==O_N)&&(NID(a)==N_GF2N)) |
|
|
void addgf2n(a,b,c) |
void addgf2n(GF2N a,GF2N b,GF2N *c) |
GF2N a,b; |
|
GF2N *c; |
|
{ |
{ |
UP2 t,t1; |
UP2 t,t1; |
GF2N z; |
GF2N z; |
|
|
} |
} |
} |
} |
|
|
void subgf2n(a,b,c) |
void subgf2n(GF2N a,GF2N b,GF2N *c) |
GF2N a,b; |
|
GF2N *c; |
|
{ |
{ |
addgf2n(a,b,c); |
addgf2n(a,b,c); |
} |
} |
|
|
void mulgf2n(a,b,c) |
void mulgf2n(GF2N a,GF2N b,GF2N *c) |
GF2N a,b; |
|
GF2N *c; |
|
{ |
{ |
UP2 t; |
UP2 t; |
GF2N z; |
GF2N z; |
|
|
} |
} |
} |
} |
|
|
void squaregf2n(a,c) |
void squaregf2n(GF2N a,GF2N *c) |
GF2N a; |
|
GF2N *c; |
|
{ |
{ |
UP2 t; |
UP2 t; |
GF2N z; |
GF2N z; |
|
|
} |
} |
} |
} |
|
|
void divgf2n(a,b,c) |
void divgf2n(GF2N a,GF2N b,GF2N *c) |
GF2N a,b; |
|
GF2N *c; |
|
{ |
{ |
UP2 t,i,s; |
UP2 t,i,s; |
GF2N z; |
GF2N z; |
|
|
} |
} |
} |
} |
|
|
void invgf2n(b,c) |
void invgf2n(GF2N b,GF2N *c) |
GF2N b; |
|
GF2N *c; |
|
{ |
{ |
UP2 i; |
UP2 i; |
GF2N z; |
GF2N z; |
|
|
} |
} |
} |
} |
|
|
void chsgngf2n(a,c) |
void chsgngf2n(GF2N a,GF2N *c) |
GF2N a,*c; |
|
{ |
{ |
*c = a; |
*c = a; |
} |
} |
|
|
void pwrgf2n(a,b,c) |
void pwrgf2n(GF2N a,Q b,GF2N *c) |
GF2N a; |
|
Q b; |
|
GF2N *c; |
|
{ |
{ |
UP2 t; |
UP2 t; |
GF2N r; |
GF2N r; |
|
|
} |
} |
} |
} |
|
|
int cmpgf2n(a,b) |
int cmpgf2n(GF2N a,GF2N b) |
GF2N a,b; |
|
{ |
{ |
GF2N z; |
GF2N z; |
|
|
|
|
return compup2(a->body,b->body); |
return compup2(a->body,b->body); |
} |
} |
|
|
void randomgf2n(r) |
void randomgf2n(GF2N *r) |
GF2N *r; |
|
{ |
{ |
int i,w,d; |
int i,w,d; |
unsigned int *tb; |
unsigned int *tb; |