version 1.1.1.1, 1999/12/03 07:39:07 |
version 1.5, 2001/10/09 01:36:05 |
|
|
/* $OpenXM: OpenXM/src/asir99/builtin/ec.c,v 1.1.1.1 1999/11/10 08:12:25 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/builtin/ec.c,v 1.4 2000/08/22 05:03:57 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
#include "inline.h" |
#include "inline.h" |
Line 78 struct ftab ec_tab[] = { |
|
Line 126 struct ftab ec_tab[] = { |
|
{"separate_vect",Pseparate_vect,1}, |
{"separate_vect",Pseparate_vect,1}, |
{"ecm_find_match",Pecm_find_match,2}, |
{"ecm_find_match",Pecm_find_match,2}, |
{"ecm_set_addcounter",Pecm_set_addcounter,-1}, |
{"ecm_set_addcounter",Pecm_set_addcounter,-1}, |
{"sha1",Psha1,1}, |
{"sha1",Psha1,-2}, |
#if 0 |
#if 0 |
{"sha1_free",Psha1_free,1}, |
{"sha1_free",Psha1_free,1}, |
#endif |
#endif |
|
|
z = NM((Q)ARG0(arg)); |
z = NM((Q)ARG0(arg)); |
n = PL(z); |
n = PL(z); |
l = n_bits(z); |
l = n_bits(z); |
bl = (l+7)/8; |
if ( argc(arg) == 2 ) |
|
bl = QTOS((Q)ARG1(arg)); |
|
else |
|
bl = (l+7)/8; |
s = (unsigned char *)MALLOC(bl); |
s = (unsigned char *)MALLOC(bl); |
for ( i = 0, j = bl-1; i < n; i++ ) { |
for ( i = 0, j = bl-1; i < n; i++ ) { |
t = BD(z)[i]; |
t = BD(z)[i]; |
Line 219 void Pecm_compute_all_key_homo_ff(arg,rp) |
|
Line 270 void Pecm_compute_all_key_homo_ff(arg,rp) |
|
NODE arg; |
NODE arg; |
VECT *rp; |
VECT *rp; |
{ |
{ |
Obj mod; |
|
unsigned int *ka; |
unsigned int *ka; |
int len,i; |
int len,i; |
VECT *pa; |
VECT *pa; |
|
|
{ |
{ |
GF2N ax,bc,a0,a1,a2,b0,b1,b2; |
GF2N ax,bc,a0,a1,a2,b0,b1,b2; |
GF2N a2b0,a0b2,a2b1,a1b2,a02,a04,a22,a24,a0a2,a0a22,a1a2; |
GF2N a2b0,a0b2,a2b1,a1b2,a02,a04,a22,a24,a0a2,a0a22,a1a2; |
GF2N t,s,u,r0,r1,r00,r01,r02,r002,r003,r022,r02q; |
GF2N t,s,u,r0,r1,r00,r01,r02,r002,r003,r02q; |
VECT r; |
VECT r; |
GF2N *vb,*rb; |
GF2N *vb,*rb; |
|
|
Line 436 extern LM THREE_LM,FOUR_LM,EIGHT_LM; |
|
Line 486 extern LM THREE_LM,FOUR_LM,EIGHT_LM; |
|
unsigned int ecm_count_order_gfp(p,a,b) |
unsigned int ecm_count_order_gfp(p,a,b) |
unsigned int p,a,b; |
unsigned int p,a,b; |
{ |
{ |
unsigned int x,y,rhs,ord,t; |
unsigned int x,rhs,ord,t; |
|
|
for ( x = 0, ord = 1; x < p; x++ ) { |
for ( x = 0, ord = 1; x < p; x++ ) { |
DMAR(x,x,a,p,t) /* t = x^2+a mod p */ |
DMAR(x,x,a,p,t) /* t = x^2+a mod p */ |
|
|
GF2N a,b; |
GF2N a,b; |
{ |
{ |
error("ecm_count_order_gf2n : not implemented yet"); |
error("ecm_count_order_gf2n : not implemented yet"); |
|
/* NOTREACHED */ |
|
return 0; |
} |
} |
|
|
/* ec = [AX,BC] */ |
/* ec = [AX,BC] */ |
Line 596 void ecm_chsgn_ff(p,pr) |
|
Line 648 void ecm_chsgn_ff(p,pr) |
|
VECT p; |
VECT p; |
VECT *pr; |
VECT *pr; |
{ |
{ |
Obj m,x,y,z; |
Obj x,y,z; |
LM tl; |
LM tl; |
GF2N tg; |
GF2N tg; |
Obj *vb; |
Obj *vb; |
Line 681 unsigned int *ka; |
|
Line 733 unsigned int *ka; |
|
LM *b,*x,*z; |
LM *b,*x,*z; |
int i; |
int i; |
LM t,s,m; |
LM t,s,m; |
N lm; |
|
Q mod; |
|
|
|
b = (LM *)ALLOCA((len+1)*sizeof(LM)); |
b = (LM *)ALLOCA((len+1)*sizeof(LM)); |
x = (LM *)ALLOCA(len*sizeof(LM)); |
x = (LM *)ALLOCA(len*sizeof(LM)); |
Line 820 void sort_ktarray(karray,tarray,rp) |
|
Line 870 void sort_ktarray(karray,tarray,rp) |
|
VECT karray,tarray; |
VECT karray,tarray; |
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST *lb; |
|
NODE r,r1; |
NODE r,r1; |
int i,i0,k,len,same,tsame; |
int i,i0,k,len,same,tsame; |
struct oKeyIndexPair *kip; |
struct oKeyIndexPair *kip; |