46 static void hashing(miracl *mip,FILE *fp,big hash)  in hashing()  argument
54     bytes_to_big(mip,20,h,hash);  in hashing()
66     miracl *mip=&instance;  in main()  local
81     mip=mirsys(mip,MR_ROUNDUP(abs(m),4),16);  in main()
82     a2=mirvar_mem(mip,mem,0);  in main()
83     a6=mirvar_mem(mip,mem,1);  in main()
84     q=mirvar_mem(mip,mem,2);  in main()
85     x=mirvar_mem(mip,mem,3);  in main()
86     y=mirvar_mem(mip,mem,4);  in main()
87     d=mirvar_mem(mip,mem,5);  in main()
88     r=mirvar_mem(mip,mem,6);  in main()
89     s=mirvar_mem(mip,mem,7);  in main()
90     k=mirvar_mem(mip,mem,8);  in main()
91     hash=mirvar_mem(mip,mem,9);  in main()
93     innum(mip,a2,fp);     /* curve parameters */  in main()
94     innum(mip,a6,fp);     /* curve parameters */  in main()
95     innum(mip,q,fp);     /* order of (x,y) */  in main()
96     innum(mip,x,fp);     /* (x,y) point on curve of order q */  in main()
97     innum(mip,y,fp);  in main()
108     irand(mip,seed);  in main()
110     ecurve2_init(mip,m,a,b,c,a2,a6,FALSE,MR_PROJECTIVE);  /* initialise curve */  in main()
112     g=epoint_init_mem(mip,mem1,0);  in main()
113     epoint2_set(mip,x,y,0,g); /* set point of order q */  in main()
117     bigrand(mip,q,k);  in main()
118     ecurve2_mult(mip,k,g,g);      /* see ebrick2.c for method to speed this up */  in main()
119     epoint2_get(mip,g,r,r);  in main()
120     divide(mip,r,q,q);  in main()
129     innum(mip,d,fp);  in main()
143     hashing(mip,fp,hash);  in main()
147     xgcd(mip,k,q,k,k,k);  in main()
149     mad(mip,d,r,hash,q,q,s);  in main()
150     mad(mip,s,k,k,q,q,s);  in main()
152     otnum(mip,r,fp);  in main()
153     otnum(mip,s,fp);  in main()