forked from skair39/milagro-crypto-c
/
ff.c
1155 lines (1030 loc) · 24.8 KB
/
ff.c
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied. See the License for the
specific language governing permissions and limitations
under the License.
*/
/* AMCL basic functions for Large Finite Field support */
#include "ff_WWW.h"
/* Arazi and Qi inversion mod 256 */
static int invmod256(int a)
{
int U,t1,t2,b,c;
t1=0;
c=(a>>1)&1;
t1+=c;
t1&=1;
t1=2-t1;
t1<<=1;
U=t1+1;
// i=2
b=a&3;
t1=U*b;
t1>>=2;
c=(a>>2)&3;
t2=(U*c)&3;
t1+=t2;
t1*=U;
t1&=3;
t1=4-t1;
t1<<=2;
U+=t1;
// i=4
b=a&15;
t1=U*b;
t1>>=4;
c=(a>>4)&15;
t2=(U*c)&15;
t1+=t2;
t1*=U;
t1&=15;
t1=16-t1;
t1<<=4;
U+=t1;
return U;
}
/* a=1/a mod 2^BIGBITS. This is very fast! */
void BIG_XXX_invmod2m(BIG_XXX a)
{
int i;
BIG_XXX U,t1,b,c;
BIG_XXX_zero(U);
BIG_XXX_inc(U,invmod256(BIG_XXX_lastbits(a,8)));
for (i=8; i<BIGBITS_XXX; i<<=1)
{
BIG_XXX_norm(U);
BIG_XXX_copy(b,a);
BIG_XXX_mod2m(b,i); // bottom i bits of a
BIG_XXX_smul(t1,U,b);
BIG_XXX_shr(t1,i); // top i bits of U*b
BIG_XXX_copy(c,a);
BIG_XXX_shr(c,i);
BIG_XXX_mod2m(c,i); // top i bits of a
BIG_XXX_smul(b,U,c);
BIG_XXX_mod2m(b,i); // bottom i bits of U*c
BIG_XXX_add(t1,t1,b);
BIG_XXX_norm(t1);
BIG_XXX_smul(b,t1,U);
BIG_XXX_copy(t1,b); // (t1+b)*U
BIG_XXX_mod2m(t1,i); // bottom i bits of (t1+b)*U
BIG_XXX_one(b);
BIG_XXX_shl(b,i);
BIG_XXX_sub(t1,b,t1);
BIG_XXX_norm(t1);
BIG_XXX_shl(t1,i);
BIG_XXX_add(U,U,t1);
}
BIG_XXX_copy(a,U);
BIG_XXX_norm(a);
BIG_XXX_mod2m(a,BIGBITS_XXX);
}
/*
void FF_rcopy(BIG x[],const BIG y[],int n)
{
int i;
for (i=0;i<n;i++)
BIG_rcopy(x[i],y[i]);
}
*/
/* x=y */
void FF_WWW_copy(BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_copy(x[i],y[i]);
}
/* x=y<<n */
static void FF_WWW_dsucopy(BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_copy(x[n+i],y[i]);
BIG_XXX_zero(x[i]);
}
}
/* x=y */
static void FF_WWW_dscopy(BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_copy(x[i],y[i]);
BIG_XXX_zero(x[n+i]);
}
}
/* x=y>>n */
static void FF_WWW_sducopy(BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_copy(x[i],y[n+i]);
}
/* set to zero */
void FF_WWW_zero(BIG_XXX x[],int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_zero(x[i]);
}
/* test equals 0 */
int FF_WWW_iszilch(BIG_XXX x[],int n)
{
int i;
for (i=0; i<n; i++)
if (!BIG_XXX_iszilch(x[i])) return 0;
return 1;
}
/* shift right by BIGBITS-bit words */
static void FF_WWW_shrw(BIG_XXX a[],int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_copy(a[i],a[i+n]);
BIG_XXX_zero(a[i+n]);
}
}
/* shift left by BIGBITS-bit words */
static void FF_WWW_shlw(BIG_XXX a[],int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_copy(a[i+n],a[i]);
BIG_XXX_zero(a[i]);
}
}
/* extract last bit */
int FF_WWW_parity(BIG_XXX x[])
{
return BIG_XXX_parity(x[0]);
}
/* extract last m bits */
int FF_WWW_lastbits(BIG_XXX x[],int m)
{
return BIG_XXX_lastbits(x[0],m);
}
/* x=1 */
void FF_WWW_one(BIG_XXX x[],int n)
{
int i;
BIG_XXX_one(x[0]);
for (i=1; i<n; i++)
BIG_XXX_zero(x[i]);
}
/* x=m, where m is 32-bit int */
void FF_WWW_init(BIG_XXX x[],sign32 m,int n)
{
int i;
BIG_XXX_zero(x[0]);
#if CHUNK<64
x[0][0]=(chunk)(m&BMASK_XXX);
x[0][1]=(chunk)(m>>BASEBITS_XXX);
#else
x[0][0]=(chunk)m;
#endif
for (i=1; i<n; i++)
BIG_XXX_zero(x[i]);
}
/* compare x and y - must be normalised */
int FF_WWW_comp(BIG_XXX x[],BIG_XXX y[],int n)
{
int i,j;
for (i=n-1; i>=0; i--)
{
j=BIG_XXX_comp(x[i],y[i]);
if (j!=0) return j;
}
return 0;
}
/* recursive add */
static void FF_WWW_radd(BIG_XXX z[],int zp,BIG_XXX x[],int xp,BIG_XXX y[],int yp,int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_add(z[zp+i],x[xp+i],y[yp+i]);
}
/* recursive inc */
static void FF_WWW_rinc(BIG_XXX z[],int zp,BIG_XXX y[],int yp,int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_add(z[zp+i],z[zp+i],y[yp+i]);
}
/* recursive sub */
/*
static void FF_rsub(BIG z[],int zp,BIG x[],int xp,BIG y[],int yp,int n)
{
int i;
for (i=0;i<n;i++)
BIG_sub(z[zp+i],x[xp+i],y[yp+i]);
}
*/
/* recursive dec */
static void FF_WWW_rdec(BIG_XXX z[],int zp,BIG_XXX y[],int yp,int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_sub(z[zp+i],z[zp+i],y[yp+i]);
}
/* simple add */
void FF_WWW_add(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_add(z[i],x[i],y[i]);
}
/* simple sub */
void FF_WWW_sub(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_sub(z[i],x[i],y[i]);
}
/* increment/decrement by a small integer */
void FF_WWW_inc(BIG_XXX x[],int m,int n)
{
BIG_XXX_inc(x[0],m);
FF_WWW_norm(x,n);
}
void FF_WWW_dec(BIG_XXX x[],int m,int n)
{
BIG_XXX_dec(x[0],m);
FF_WWW_norm(x,n);
}
/* normalise - but hold any overflow in top part unless n<0 */
static void FF_WWW_rnorm(BIG_XXX z[],int zp,int n)
{
int i,trunc=0;
chunk carry;
if (n<0)
{
/* -v n signals to do truncation */
n=-n;
trunc=1;
}
for (i=0; i<n-1; i++)
{
carry=BIG_XXX_norm(z[zp+i]);
z[zp+i][NLEN_XXX-1]^=carry<<P_TBITS_WWW; /* remove it */
z[zp+i+1][0]+=carry;
}
carry=BIG_XXX_norm(z[zp+n-1]);
if (trunc) z[zp+n-1][NLEN_XXX-1]^=carry<<P_TBITS_WWW;
}
void FF_WWW_norm(BIG_XXX z[],int n)
{
FF_WWW_rnorm(z,0,n);
}
/* shift left by one bit */
void FF_WWW_shl(BIG_XXX x[],int n)
{
int i;
int carry,delay_carry=0;
for (i=0; i<n-1; i++)
{
carry=BIG_XXX_fshl(x[i],1);
x[i][0]|=delay_carry;
x[i][NLEN_XXX-1]^=(chunk)carry<<P_TBITS_WWW;
delay_carry=carry;
}
BIG_XXX_fshl(x[n-1],1);
x[n-1][0]|=delay_carry;
}
/* shift right by one bit */
void FF_WWW_shr(BIG_XXX x[],int n)
{
int i;
int carry;
for (i=n-1; i>0; i--)
{
carry=BIG_XXX_fshr(x[i],1);
x[i-1][NLEN_XXX-1]|=(chunk)carry<<P_TBITS_WWW;
}
BIG_XXX_fshr(x[0],1);
}
void FF_WWW_output(BIG_XXX x[],int n)
{
int i;
FF_WWW_norm(x,n);
for (i=n-1; i>=0; i--)
{
BIG_XXX_output(x[i]);
printf(" ");
}
}
void FF_WWW_rawoutput(BIG_XXX x[],int n)
{
int i;
for (i=n-1; i>=0; i--)
{
BIG_XXX_rawoutput(x[i]);
printf(" ");
}
}
/* Convert FFs to/from octet strings */
void FF_WWW_toOctet(octet *w,BIG_XXX x[],int n)
{
int i;
w->len=n*MODBYTES_XXX;
for (i=0; i<n; i++)
{
BIG_XXX_toBytes(&(w->val[(n-i-1)*MODBYTES_XXX]),x[i]);
}
}
void FF_WWW_fromOctet(BIG_XXX x[],octet *w,int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_fromBytes(x[i],&(w->val[(n-i-1)*MODBYTES_XXX]));
}
}
/* in-place swapping using xor - side channel resistant */
static void FF_WWW_cswap(BIG_XXX a[],BIG_XXX b[],int d,int n)
{
int i;
for (i=0; i<n; i++)
BIG_XXX_cswap(a[i],b[i],d);
return;
}
/* z=x*y, t is workspace */
static void FF_WWW_karmul(BIG_XXX z[],int zp,BIG_XXX x[],int xp,BIG_XXX y[],int yp,BIG_XXX t[],int tp,int n)
{
int nd2;
if (n==1)
{
BIG_XXX_norm(x[xp]);
BIG_XXX_norm(y[yp]);
BIG_XXX_mul(t[tp],x[xp],y[yp]);
BIG_XXX_split(z[zp+1],z[zp],t[tp],BIGBITS_XXX);
return;
}
nd2=n/2;
FF_WWW_radd(z,zp,x,xp,x,xp+nd2,nd2);
FF_WWW_rnorm(z,zp,nd2); /* needs this if recursion level too deep */
FF_WWW_radd(z,zp+nd2,y,yp,y,yp+nd2,nd2);
FF_WWW_rnorm(z,zp+nd2,nd2);
FF_WWW_karmul(t,tp,z,zp,z,zp+nd2,t,tp+n,nd2);
FF_WWW_karmul(z,zp,x,xp,y,yp,t,tp+n,nd2);
FF_WWW_karmul(z,zp+n,x,xp+nd2,y,yp+nd2,t,tp+n,nd2);
FF_WWW_rdec(t,tp,z,zp,n);
FF_WWW_rdec(t,tp,z,zp+n,n);
FF_WWW_rinc(z,zp+nd2,t,tp,n);
FF_WWW_rnorm(z,zp,2*n);
}
static void FF_WWW_karsqr(BIG_XXX z[],int zp,BIG_XXX x[],int xp,BIG_XXX t[],int tp,int n)
{
int nd2;
if (n==1)
{
BIG_XXX_norm(x[xp]);
BIG_XXX_sqr(t[tp],x[xp]);
BIG_XXX_split(z[zp+1],z[zp],t[tp],BIGBITS_XXX);
return;
}
nd2=n/2;
FF_WWW_karsqr(z,zp,x,xp,t,tp+n,nd2);
FF_WWW_karsqr(z,zp+n,x,xp+nd2,t,tp+n,nd2);
FF_WWW_karmul(t,tp,x,xp,x,xp+nd2,t,tp+n,nd2);
FF_WWW_rinc(z,zp+nd2,t,tp,n);
FF_WWW_rinc(z,zp+nd2,t,tp,n);
FF_WWW_rnorm(z,zp+nd2,n); /* was FF_rnorm(z,zp,2*n) */
}
static void FF_WWW_karmul_lower(BIG_XXX z[],int zp,BIG_XXX x[],int xp,BIG_XXX y[],int yp,BIG_XXX t[],int tp,int n)
{
/* Calculates Least Significant bottom half of x*y */
int nd2;
if (n==1)
{
/* only calculate bottom half of product */
BIG_XXX_norm(x[xp]);
BIG_XXX_norm(y[yp]);
BIG_XXX_smul(z[zp],x[xp],y[yp]);
return;
}
nd2=n/2;
FF_WWW_karmul(z,zp,x,xp,y,yp,t,tp+n,nd2);
FF_WWW_karmul_lower(t,tp,x,xp+nd2,y,yp,t,tp+n,nd2);
FF_WWW_rinc(z,zp+nd2,t,tp,nd2);
FF_WWW_karmul_lower(t,tp,x,xp,y,yp+nd2,t,tp+n,nd2);
FF_WWW_rinc(z,zp+nd2,t,tp,nd2);
FF_WWW_rnorm(z,zp+nd2,-nd2); /* truncate it */
}
static void FF_WWW_karmul_upper(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],BIG_XXX t[],int n)
{
/* Calculates Most Significant upper half of x*y, given lower part */
int nd2;
nd2=n/2;
FF_WWW_radd(z,n,x,0,x,nd2,nd2);
FF_WWW_radd(z,n+nd2,y,0,y,nd2,nd2);
FF_WWW_rnorm(z,n,nd2);
FF_WWW_rnorm(z,n+nd2,nd2);
FF_WWW_karmul(t,0,z,n+nd2,z,n,t,n,nd2); /* t = (a0+a1)(b0+b1) */
FF_WWW_karmul(z,n,x,nd2,y,nd2,t,n,nd2); /* z[n]= a1*b1 */
/* z[0-nd2]=l(a0b0) z[nd2-n]= h(a0b0)+l(t)-l(a0b0)-l(a1b1) */
FF_WWW_rdec(t,0,z,n,n); /* t=t-a1b1 */
FF_WWW_rinc(z,nd2,z,0,nd2); /* z[nd2-n]+=l(a0b0) = h(a0b0)+l(t)-l(a1b1) */
FF_WWW_rdec(z,nd2,t,0,nd2); /* z[nd2-n]=h(a0b0)+l(t)-l(a1b1)-l(t-a1b1)=h(a0b0) */
FF_WWW_rnorm(z,0,-n); /* a0b0 now in z - truncate it */
FF_WWW_rdec(t,0,z,0,n); /* (a0+a1)(b0+b1) - a0b0 */
FF_WWW_rinc(z,nd2,t,0,n);
FF_WWW_rnorm(z,nd2,n);
}
/* z=x*y */
void FF_WWW_mul(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],int n)
{
#ifndef C99
BIG_XXX t[2*FFLEN_WWW];
#else
BIG_XXX t[2*n];
#endif
// FF_norm(x,n); /* change here */
// FF_norm(y,n); /* change here */
FF_WWW_karmul(z,0,x,0,y,0,t,0,n);
}
/* return low part of product */
static void FF_WWW_lmul(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],int n)
{
#ifndef C99
BIG_XXX t[2*FFLEN_WWW];
#else
BIG_XXX t[2*n];
#endif
// FF_norm(x,n); /* change here */
// FF_norm(y,n); /* change here */
FF_WWW_karmul_lower(z,0,x,0,y,0,t,0,n);
}
/* Set b=b mod c */
void FF_WWW_mod(BIG_XXX b[],BIG_XXX c[],int n)
{
int k=0;
FF_WWW_norm(b,n);
if (FF_WWW_comp(b,c,n)<0)
return;
do
{
FF_WWW_shl(c,n);
k++;
}
while (FF_WWW_comp(b,c,n)>=0);
while (k>0)
{
FF_WWW_shr(c,n);
if (FF_WWW_comp(b,c,n)>=0)
{
FF_WWW_sub(b,b,c,n);
FF_WWW_norm(b,n);
}
k--;
}
}
/* z=x^2 */
void FF_WWW_sqr(BIG_XXX z[],BIG_XXX x[],int n)
{
#ifndef C99
BIG_XXX t[2*FFLEN_WWW];
#else
BIG_XXX t[2*n];
#endif
// FF_norm(x,n); /* change here */
FF_WWW_karsqr(z,0,x,0,t,0,n);
}
/* r=t mod modulus, N is modulus, ND is Montgomery Constant */
static void FF_WWW_reduce(BIG_XXX r[],BIG_XXX T[],BIG_XXX N[],BIG_XXX ND[],int n)
{
/* fast karatsuba Montgomery reduction */
#ifndef C99
BIG_XXX t[2*FFLEN_WWW];
BIG_XXX m[FFLEN_WWW];
#else
BIG_XXX t[2*n];
BIG_XXX m[n];
#endif
FF_WWW_sducopy(r,T,n); /* keep top half of T */
//FF_norm(T,n); /* change here */
FF_WWW_karmul_lower(m,0,T,0,ND,0,t,0,n); /* m=T.(1/N) mod R */
//FF_norm(N,n); /* change here */
FF_WWW_karmul_upper(T,N,m,t,n); /* T=mN */
FF_WWW_sducopy(m,T,n);
FF_WWW_add(r,r,N,n);
FF_WWW_sub(r,r,m,n);
FF_WWW_norm(r,n);
}
/* Set r=a mod b */
/* a is of length - 2*n */
/* r,b is of length - n */
void FF_WWW_dmod(BIG_XXX r[],BIG_XXX a[],BIG_XXX b[],int n)
{
int k;
#ifndef C99
BIG_XXX m[2*FFLEN_WWW];
BIG_XXX x[2*FFLEN_WWW];
#else
BIG_XXX m[2*n];
BIG_XXX x[2*n];
#endif
FF_WWW_copy(x,a,2*n);
FF_WWW_norm(x,2*n);
FF_WWW_dsucopy(m,b,n);
k=BIGBITS_XXX*n;
while (FF_WWW_comp(x,m,2*n)>=0)
{
FF_WWW_sub(x,x,m,2*n);
FF_WWW_norm(x,2*n);
}
while (k>0)
{
FF_WWW_shr(m,2*n);
if (FF_WWW_comp(x,m,2*n)>=0)
{
FF_WWW_sub(x,x,m,2*n);
FF_WWW_norm(x,2*n);
}
k--;
}
FF_WWW_copy(r,x,n);
FF_WWW_mod(r,b,n);
}
/* Set r=1/a mod p. Binary method - a<p on entry */
void FF_WWW_invmodp(BIG_XXX r[],BIG_XXX a[],BIG_XXX p[],int n)
{
#ifndef C99
BIG_XXX u[FFLEN_WWW],v[FFLEN_WWW],x1[FFLEN_WWW],x2[FFLEN_WWW],t[FFLEN_WWW],one[FFLEN_WWW];
#else
BIG_XXX u[n],v[n],x1[n],x2[n],t[n],one[n];
#endif
FF_WWW_copy(u,a,n);
FF_WWW_copy(v,p,n);
FF_WWW_one(one,n);
FF_WWW_copy(x1,one,n);
FF_WWW_zero(x2,n);
// reduce n in here as well!
while (FF_WWW_comp(u,one,n)!=0 && FF_WWW_comp(v,one,n)!=0)
{
while (FF_WWW_parity(u)==0)
{
FF_WWW_shr(u,n);
if (FF_WWW_parity(x1)!=0)
{
FF_WWW_add(x1,p,x1,n);
FF_WWW_norm(x1,n);
}
FF_WWW_shr(x1,n);
}
while (FF_WWW_parity(v)==0)
{
FF_WWW_shr(v,n);
if (FF_WWW_parity(x2)!=0)
{
FF_WWW_add(x2,p,x2,n);
FF_WWW_norm(x2,n);
}
FF_WWW_shr(x2,n);
}
if (FF_WWW_comp(u,v,n)>=0)
{
FF_WWW_sub(u,u,v,n);
FF_WWW_norm(u,n);
if (FF_WWW_comp(x1,x2,n)>=0) FF_WWW_sub(x1,x1,x2,n);
else
{
FF_WWW_sub(t,p,x2,n);
FF_WWW_add(x1,x1,t,n);
}
FF_WWW_norm(x1,n);
}
else
{
FF_WWW_sub(v,v,u,n);
FF_WWW_norm(v,n);
if (FF_WWW_comp(x2,x1,n)>=0) FF_WWW_sub(x2,x2,x1,n);
else
{
FF_WWW_sub(t,p,x1,n);
FF_WWW_add(x2,x2,t,n);
}
FF_WWW_norm(x2,n);
}
}
if (FF_WWW_comp(u,one,n)==0)
FF_WWW_copy(r,x1,n);
else
FF_WWW_copy(r,x2,n);
}
/* nesidue mod m */
static void FF_WWW_nres(BIG_XXX a[],BIG_XXX m[],int n)
{
#ifndef C99
BIG_XXX d[2*FFLEN_WWW];
#else
BIG_XXX d[2*n];
#endif
if (n==1)
{
BIG_XXX_dscopy(d[0],a[0]);
BIG_XXX_dshl(d[0],NLEN_XXX*BASEBITS_XXX);
BIG_XXX_dmod(a[0],d[0],m[0]);
}
else
{
FF_WWW_dsucopy(d,a,n);
FF_WWW_dmod(a,d,m,n);
}
}
static void FF_WWW_redc(BIG_XXX a[],BIG_XXX m[],BIG_XXX ND[],int n)
{
#ifndef C99
BIG_XXX d[2*FFLEN_WWW];
#else
BIG_XXX d[2*n];
#endif
if (n==1)
{
BIG_XXX_dzero(d[0]);
BIG_XXX_dscopy(d[0],a[0]);
BIG_XXX_monty(a[0],m[0],((chunk)1<<BASEBITS_XXX)-ND[0][0],d[0]);
}
else
{
FF_WWW_mod(a,m,n);
FF_WWW_dscopy(d,a,n);
FF_WWW_reduce(a,d,m,ND,n);
FF_WWW_mod(a,m,n);
}
}
/* U=1/a mod 2^m - Arazi & Qi */
static void FF_WWW_invmod2m(BIG_XXX U[],BIG_XXX a[],int n)
{
int i;
#ifndef C99
BIG_XXX t1[FFLEN_WWW],b[FFLEN_WWW],c[FFLEN_WWW];
#else
BIG_XXX t1[2*n],b[n],c[n];
#endif
FF_WWW_zero(U,n);
FF_WWW_zero(b,n);
FF_WWW_zero(c,n);
FF_WWW_zero(t1,2*n);
BIG_XXX_copy(U[0],a[0]);
BIG_XXX_invmod2m(U[0]);
for (i=1; i<n; i<<=1)
{
FF_WWW_copy(b,a,i);
FF_WWW_mul(t1,U,b,i);
FF_WWW_shrw(t1,i); // top half to bottom half, top half=0
FF_WWW_copy(c,a,2*i);
FF_WWW_shrw(c,i); // top half of c
FF_WWW_lmul(b,U,c,i); // should set top half of b=0
FF_WWW_add(t1,t1,b,i);
FF_WWW_norm(t1,2*i);
FF_WWW_lmul(b,t1,U,i);
FF_WWW_copy(t1,b,i);
FF_WWW_one(b,i);
FF_WWW_shlw(b,i);
FF_WWW_sub(t1,b,t1,2*i);
FF_WWW_norm(t1,2*i);
FF_WWW_shlw(t1,i);
FF_WWW_add(U,U,t1,2*i);
}
FF_WWW_norm(U,n);
}
void FF_WWW_random(BIG_XXX x[],csprng *rng,int n)
{
int i;
for (i=0; i<n; i++)
{
BIG_XXX_random(x[i],rng);
}
/* make sure top bit is 1 */
while (BIG_XXX_nbits(x[n-1])<MODBYTES_XXX*8) BIG_XXX_random(x[n-1],rng);
}
/* generate random x mod p */
void FF_WWW_randomnum(BIG_XXX x[],BIG_XXX p[],csprng *rng,int n)
{
int i;
#ifndef C99
BIG_XXX d[2*FFLEN_WWW];
#else
BIG_XXX d[2*n];
#endif
for (i=0; i<2*n; i++)
{
BIG_XXX_random(d[i],rng);
}
FF_WWW_dmod(x,d,p,n);
}
static void FF_WWW_modmul(BIG_XXX z[],BIG_XXX x[],BIG_XXX y[],BIG_XXX p[],BIG_XXX ND[],int n)
{
#ifndef C99
BIG_XXX d[2*FFLEN_WWW];
#else
BIG_XXX d[2*n];
#endif
chunk ex=P_EXCESS_WWW(x[n-1]);
chunk ey=P_EXCESS_WWW(y[n-1]);
#ifdef dchunk
if ((dchunk)(ex+1)*(ey+1)>(dchunk)P_FEXCESS_WWW)
#else
if ((ex+1)>P_FEXCESS_WWW/(ey+1))
#endif
{
#ifdef DEBUG_REDUCE
printf("Product too large - reducing it %d %d\n",ex,ey);
#endif
FF_WWW_mod(x,p,n);
}
if (n==1)
{
BIG_XXX_mul(d[0],x[0],y[0]);
BIG_XXX_monty(z[0],p[0],((chunk)1<<BASEBITS_XXX)-ND[0][0],d[0]);
}
else
{
FF_WWW_mul(d,x,y,n);
FF_WWW_reduce(z,d,p,ND,n);
}
}
static void FF_WWW_modsqr(BIG_XXX z[],BIG_XXX x[],BIG_XXX p[],BIG_XXX ND[],int n)
{
#ifndef C99
BIG_XXX d[2*FFLEN_WWW];
#else
BIG_XXX d[2*n];
#endif
chunk ex=P_EXCESS_WWW(x[n-1]);
#ifdef dchunk
if ((dchunk)(ex+1)*(ex+1)>(dchunk)P_FEXCESS_WWW)
#else
if ((ex+1)>P_FEXCESS_WWW/(ex+1))
#endif
{
#ifdef DEBUG_REDUCE
printf("Product too large - reducing it %d\n",ex);
#endif
FF_WWW_mod(x,p,n);
}
if (n==1)
{
BIG_XXX_sqr(d[0],x[0]);
BIG_XXX_monty(z[0],p[0],((chunk)1<<BASEBITS_XXX)-ND[0][0],d[0]);
}
else
{
FF_WWW_sqr(d,x,n);
FF_WWW_reduce(z,d,p,ND,n);
}
}
/* r=x^e mod p using side-channel resistant Montgomery Ladder, for large e */
void FF_WWW_skpow(BIG_XXX r[],BIG_XXX x[],BIG_XXX e[],BIG_XXX p[],int n)
{
int i,b;
#ifndef C99
BIG_XXX R0[FFLEN_WWW],R1[FFLEN_WWW],ND[FFLEN_WWW];
#else
BIG_XXX R0[n],R1[n],ND[n];
#endif
FF_WWW_invmod2m(ND,p,n);
FF_WWW_one(R0,n);
FF_WWW_copy(R1,x,n);
FF_WWW_nres(R0,p,n);
FF_WWW_nres(R1,p,n);
for (i=8*MODBYTES_XXX*n-1; i>=0; i--)
{
b=BIG_XXX_bit(e[i/BIGBITS_XXX],i%BIGBITS_XXX);
FF_WWW_modmul(r,R0,R1,p,ND,n);
FF_WWW_cswap(R0,R1,b,n);
FF_WWW_modsqr(R0,R0,p,ND,n);
FF_WWW_copy(R1,r,n);
FF_WWW_cswap(R0,R1,b,n);
}
FF_WWW_copy(r,R0,n);
FF_WWW_redc(r,p,ND,n);
}
/* r=x^e mod p using side-channel resistant Montgomery Ladder, for short e */
void FF_WWW_skspow(BIG_XXX r[],BIG_XXX x[],BIG_XXX e,BIG_XXX p[],int n)
{
int i,b;
#ifndef C99
BIG_XXX R0[FFLEN_WWW],R1[FFLEN_WWW],ND[FFLEN_WWW];
#else
BIG_XXX R0[n],R1[n],ND[n];
#endif
FF_WWW_invmod2m(ND,p,n);
FF_WWW_one(R0,n);
FF_WWW_copy(R1,x,n);
FF_WWW_nres(R0,p,n);
FF_WWW_nres(R1,p,n);
for (i=8*MODBYTES_XXX-1; i>=0; i--)
{
b=BIG_XXX_bit(e,i);
FF_WWW_modmul(r,R0,R1,p,ND,n);
FF_WWW_cswap(R0,R1,b,n);
FF_WWW_modsqr(R0,R0,p,ND,n);
FF_WWW_copy(R1,r,n);
FF_WWW_cswap(R0,R1,b,n);
}
FF_WWW_copy(r,R0,n);
FF_WWW_redc(r,p,ND,n);
}
/* raise to an integer power - right-to-left method */
void FF_WWW_power(BIG_XXX r[],BIG_XXX x[],int e,BIG_XXX p[],int n)
{
int f=1;
#ifndef C99
BIG_XXX w[FFLEN_WWW],ND[FFLEN_WWW];
#else
BIG_XXX w[n],ND[n];
#endif
FF_WWW_invmod2m(ND,p,n);
FF_WWW_copy(w,x,n);
FF_WWW_nres(w,p,n);
if (e==2)
{
FF_WWW_modsqr(r,w,p,ND,n);
}
else for (;;)
{
if (e%2==1)
{
if (f) FF_WWW_copy(r,w,n);
else FF_WWW_modmul(r,r,w,p,ND,n);
f=0;
}
e>>=1;
if (e==0) break;
FF_WWW_modsqr(w,w,p,ND,n);
}
FF_WWW_redc(r,p,ND,n);
}
/* r=x^e mod p, faster but not side channel resistant */
void FF_WWW_pow(BIG_XXX r[],BIG_XXX x[],BIG_XXX e[],BIG_XXX p[],int n)
{
int i,b;
#ifndef C99
BIG_XXX w[FFLEN_WWW],ND[FFLEN_WWW];
#else
BIG_XXX w[n],ND[n];
#endif
FF_WWW_invmod2m(ND,p,n);
FF_WWW_copy(w,x,n);
FF_WWW_one(r,n);
FF_WWW_nres(r,p,n);
FF_WWW_nres(w,p,n);
for (i=8*MODBYTES_XXX*n-1; i>=0; i--)
{
FF_WWW_modsqr(r,r,p,ND,n);
b=BIG_XXX_bit(e[i/BIGBITS_XXX],i%BIGBITS_XXX);
if (b==1) FF_WWW_modmul(r,r,w,p,ND,n);
}
FF_WWW_redc(r,p,ND,n);
}
/* double exponentiation r=x^e.y^f mod p */
void FF_WWW_pow2(BIG_XXX r[],BIG_XXX x[],BIG_XXX e,BIG_XXX y[],BIG_XXX f,BIG_XXX p[],int n)
{
int i,eb,fb;
#ifndef C99