forked from apache/incubator-milagro-crypto-c
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pair256.c.in
844 lines (673 loc) · 19.2 KB
/
pair256.c.in
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
/*
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 BLS Curve pairing functions */
//#define HAS_MAIN
#include "pair256_ZZZ.h"
/* Line function */
static void PAIR_ZZZ_line(FP48_YYY *v,ECP8_ZZZ *A,ECP8_ZZZ *B,FP_YYY *Qx,FP_YYY *Qy)
{
FP8_YYY X1,Y1,T1,T2;
FP8_YYY XX,YY,ZZ,YZ;
FP16_YYY a,b,c;
if (A==B)
{
/* doubling */
FP8_YYY_copy(&XX,&(A->x)); //FP8_YYY XX=new FP8_YYY(A.getx()); //X
FP8_YYY_copy(&YY,&(A->y)); //FP8_YYY YY=new FP8_YYY(A.gety()); //Y
FP8_YYY_copy(&ZZ,&(A->z)); //FP8_YYY ZZ=new FP8_YYY(A.getz()); //Z
FP8_YYY_copy(&YZ,&YY); //FP8_YYY YZ=new FP8_YYY(YY); //Y
FP8_YYY_mul(&YZ,&YZ,&ZZ); //YZ.mul(ZZ); //YZ
FP8_YYY_sqr(&XX,&XX); //XX.sqr(); //X^2
FP8_YYY_sqr(&YY,&YY); //YY.sqr(); //Y^2
FP8_YYY_sqr(&ZZ,&ZZ); //ZZ.sqr(); //Z^2
FP8_YYY_imul(&YZ,&YZ,4); //YZ.imul(4);
FP8_YYY_neg(&YZ,&YZ); //YZ.neg();
FP8_YYY_norm(&YZ); //YZ.norm(); //-4YZ
FP8_YYY_imul(&XX,&XX,6); //6X^2
FP8_YYY_tmul(&XX,&XX,Qx); //6X^2.Xs
FP8_YYY_imul(&ZZ,&ZZ,3*CURVE_B_I_ZZZ); //3Bz^2
FP8_YYY_tmul(&YZ,&YZ,Qy); //-4YZ.Ys
#if SEXTIC_TWIST_ZZZ==D_TYPE
FP8_YYY_div_2i(&ZZ); //6(b/i)z^2
#endif
#if SEXTIC_TWIST_ZZZ==M_TYPE
FP8_YYY_times_i(&ZZ);
FP8_YYY_add(&ZZ,&ZZ,&ZZ); // 6biz^2
FP8_YYY_times_i(&YZ);
FP8_YYY_norm(&YZ);
#endif
FP8_YYY_norm(&ZZ); // 6bi.Z^2
FP8_YYY_add(&YY,&YY,&YY); // 2y^2
FP8_YYY_sub(&ZZ,&ZZ,&YY); //
FP8_YYY_norm(&ZZ); // 6b.Z^2-2Y^2
FP16_YYY_from_FP8s(&a,&YZ,&ZZ); // -4YZ.Ys | 6b.Z^2-2Y^2 | 6X^2.Xs
#if SEXTIC_TWIST_ZZZ==D_TYPE
FP16_YYY_from_FP8(&b,&XX);
FP16_YYY_zero(&c);
#endif
#if SEXTIC_TWIST_ZZZ==M_TYPE
FP16_YYY_zero(&b);
FP16_YYY_from_FP8H(&c,&XX);
#endif
ECP8_ZZZ_dbl(A); //A.dbl();
}
else
{
/* addition */
FP8_YYY_copy(&X1,&(A->x)); //FP8_YYY X1=new FP8_YYY(A.getx()); // X1
FP8_YYY_copy(&Y1,&(A->y)); //FP8_YYY Y1=new FP8_YYY(A.gety()); // Y1
FP8_YYY_copy(&T1,&(A->z)); //FP8_YYY T1=new FP8_YYY(A.getz()); // Z1
FP8_YYY_copy(&T2,&T1); //FP8_YYY T2=new FP8_YYY(A.getz()); // Z1
FP8_YYY_mul(&T1,&T1,&(B->y)); //T1.mul(B.gety()); // T1=Z1.Y2
FP8_YYY_mul(&T2,&T2,&(B->x)); //T2.mul(B.getx()); // T2=Z1.X2
FP8_YYY_sub(&X1,&X1,&T2); //X1.sub(T2);
FP8_YYY_norm(&X1); //X1.norm(); // X1=X1-Z1.X2
FP8_YYY_sub(&Y1,&Y1,&T1); //Y1.sub(T1);
FP8_YYY_norm(&Y1); //Y1.norm(); // Y1=Y1-Z1.Y2
FP8_YYY_copy(&T1,&X1); //T1.copy(X1); // T1=X1-Z1.X2
FP8_YYY_tmul(&X1,&X1,Qy); //X1.pmul(Qy); // X1=(X1-Z1.X2).Ys
#if SEXTIC_TWIST_ZZZ==M_TYPE
FP8_YYY_times_i(&X1);
FP8_YYY_norm(&X1);
#endif
FP8_YYY_mul(&T1,&T1,&(B->y)); //T1.mul(B.gety()); // T1=(X1-Z1.X2).Y2
FP8_YYY_copy(&T2,&Y1); //T2.copy(Y1); // T2=Y1-Z1.Y2
FP8_YYY_mul(&T2,&T2,&(B->x)); //T2.mul(B.getx()); // T2=(Y1-Z1.Y2).X2
FP8_YYY_sub(&T2,&T2,&T1); //T2.sub(T1);
FP8_YYY_norm(&T2); //T2.norm(); // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
FP8_YYY_tmul(&Y1,&Y1,Qx); //Y1.pmul(Qx);
FP8_YYY_neg(&Y1,&Y1); //Y1.neg();
FP8_YYY_norm(&Y1); //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs
FP16_YYY_from_FP8s(&a,&X1,&T2); // (X1-Z1.X2).Ys | (Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2 | - (Y1-Z1.Y2).Xs
#if SEXTIC_TWIST_ZZZ==D_TYPE
FP16_YYY_from_FP8(&b,&Y1); //b=new FP4(Y1);
FP16_YYY_zero(&c);
#endif
#if SEXTIC_TWIST_ZZZ==M_TYPE
FP16_YYY_zero(&b);
FP16_YYY_from_FP8H(&c,&Y1); //b=new FP4(Y1);
#endif
ECP8_ZZZ_add(A,B); // A.add(B);
}
FP48_YYY_from_FP16s(v,&a,&b,&c);
v->type=AMCL_FP_SPARSER;
}
/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
int PAIR_ZZZ_nbits(BIG_XXX n3,BIG_XXX n)
{
BIG_XXX x;
BIG_XXX_rcopy(x,CURVE_Bnx_ZZZ);
BIG_XXX_copy(n,x);
BIG_XXX_norm(n);
BIG_XXX_pmul(n3,n,3);
BIG_XXX_norm(n3);
return BIG_XXX_nbits(n3);
}
/*
For multi-pairing, product of n pairings
1. Declare FP24 array of length number of bits in Ate parameter
2. Initialise this array by calling PAIR_initmp()
3. Accumulate each pairing by calling PAIR_another() n times
4. Call PAIR_miller()
5. Call final exponentiation PAIR_fexp()
*/
/* prepare for multi-pairing */
void PAIR_ZZZ_initmp(FP48_YYY r[])
{
int i;
for (i=ATE_BITS_ZZZ-1; i>=0; i--)
FP48_YYY_one(&r[i]);
return;
}
/* basic Miller loop */
void PAIR_ZZZ_miller(FP48_YYY *res,FP48_YYY r[])
{
int i;
FP48_YYY_one(res);
for (i=ATE_BITS_ZZZ-1; i>=1; i--)
{
FP48_YYY_sqr(res,res);
FP48_YYY_ssmul(res,&r[i]);
}
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(res,res);
#endif
FP48_YYY_ssmul(res,&r[0]);
return;
}
/* Accumulate another set of line functions for n-pairing */
void PAIR_ZZZ_another(FP48_YYY r[],ECP8_ZZZ* PV,ECP_ZZZ* QV)
{
int i,nb,bt;
BIG_XXX n,n3;
FP48_YYY lv,lv2;
ECP8_ZZZ A,NP,P;
ECP_ZZZ Q;
FP_YYY Qx,Qy;
nb=PAIR_ZZZ_nbits(n3,n);
ECP8_ZZZ_copy(&P,PV);
ECP_ZZZ_copy(&Q,QV);
ECP8_ZZZ_affine(&P);
ECP_ZZZ_affine(&Q);
FP_YYY_copy(&Qx,&(Q.x));
FP_YYY_copy(&Qy,&(Q.y));
ECP8_ZZZ_copy(&A,&P);
ECP8_ZZZ_copy(&NP,&P);
ECP8_ZZZ_neg(&NP);
for (i=nb-2; i>=1; i--)
{
PAIR_ZZZ_line(&lv,&A,&A,&Qx,&Qy);
bt=BIG_XXX_bit(n3,i)-BIG_XXX_bit(n,i); // bt=BIG_bit(n,i);
if (bt==1)
{
PAIR_ZZZ_line(&lv2,&A,&P,&Qx,&Qy);
FP48_YYY_smul(&lv,&lv2);
}
if (bt==-1)
{
PAIR_ZZZ_line(&lv2,&A,&NP,&Qx,&Qy);
FP48_YYY_smul(&lv,&lv2);
}
FP48_YYY_ssmul(&r[i],&lv);
}
}
/* Optimal R-ate pairing r=e(P,Q) */
void PAIR_ZZZ_ate(FP48_YYY *r,ECP8_ZZZ *P1,ECP_ZZZ *Q1)
{
BIG_XXX n,n3;
FP_YYY Qx,Qy;
int i,nb,bt;
ECP8_ZZZ A,NP,P;
ECP_ZZZ Q;
FP48_YYY lv,lv2;
nb=PAIR_ZZZ_nbits(n3,n);
ECP8_ZZZ_copy(&P,P1);
ECP_ZZZ_copy(&Q,Q1);
ECP8_ZZZ_affine(&P);
ECP_ZZZ_affine(&Q);
FP_YYY_copy(&Qx,&(Q.x));
FP_YYY_copy(&Qy,&(Q.y));
ECP8_ZZZ_copy(&A,&P);
ECP8_ZZZ_copy(&NP,&P);
ECP8_ZZZ_neg(&NP);
FP48_YYY_one(r);
/* Main Miller Loop */
for (i=nb-2; i>=1; i--)
{
FP48_YYY_sqr(r,r);
PAIR_ZZZ_line(&lv,&A,&A,&Qx,&Qy);
bt= BIG_XXX_bit(n3,i)-BIG_XXX_bit(n,i); // BIG_bit(n,i);
if (bt==1)
{
PAIR_ZZZ_line(&lv2,&A,&P,&Qx,&Qy);
FP48_YYY_smul(&lv,&lv2);
}
if (bt==-1)
{
PAIR_ZZZ_line(&lv2,&A,&NP,&Qx,&Qy);
FP48_YYY_smul(&lv,&lv2);
}
FP48_YYY_ssmul(r,&lv);
}
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(r,r);
#endif
}
/* Optimal R-ate double pairing e(P,Q).e(R,S) */
void PAIR_ZZZ_double_ate(FP48_YYY *r,ECP8_ZZZ *P1,ECP_ZZZ *Q1,ECP8_ZZZ *R1,ECP_ZZZ *S1)
{
BIG_XXX n,n3;
FP_YYY Qx,Qy,Sx,Sy;
int i,nb,bt;
ECP8_ZZZ A,B,NP,NR,P,R;
ECP_ZZZ Q,S;
FP48_YYY lv,lv2;
nb=PAIR_ZZZ_nbits(n3,n);
ECP8_ZZZ_copy(&P,P1);
ECP_ZZZ_copy(&Q,Q1);
ECP8_ZZZ_affine(&P);
ECP_ZZZ_affine(&Q);
ECP8_ZZZ_copy(&R,R1);
ECP_ZZZ_copy(&S,S1);
ECP8_ZZZ_affine(&R);
ECP_ZZZ_affine(&S);
FP_YYY_copy(&Qx,&(Q.x));
FP_YYY_copy(&Qy,&(Q.y));
FP_YYY_copy(&Sx,&(S.x));
FP_YYY_copy(&Sy,&(S.y));
ECP8_ZZZ_copy(&A,&P);
ECP8_ZZZ_copy(&B,&R);
ECP8_ZZZ_copy(&NP,&P);
ECP8_ZZZ_neg(&NP);
ECP8_ZZZ_copy(&NR,&R);
ECP8_ZZZ_neg(&NR);
FP48_YYY_one(r);
/* Main Miller Loop */
for (i=nb-2; i>=1; i--)
{
FP48_YYY_sqr(r,r);
PAIR_ZZZ_line(&lv,&A,&A,&Qx,&Qy);
PAIR_ZZZ_line(&lv2,&B,&B,&Sx,&Sy);
FP48_YYY_smul(&lv,&lv2);
FP48_YYY_ssmul(r,&lv);
bt=BIG_XXX_bit(n3,i)-BIG_XXX_bit(n,i); // bt=BIG_bit(n,i);
if (bt==1)
{
PAIR_ZZZ_line(&lv,&A,&P,&Qx,&Qy);
PAIR_ZZZ_line(&lv2,&B,&R,&Sx,&Sy);
FP48_YYY_smul(&lv,&lv2);
FP48_YYY_ssmul(r,&lv);
}
if (bt==-1)
{
PAIR_ZZZ_line(&lv,&A,&NP,&Qx,&Qy);
PAIR_ZZZ_line(&lv2,&B,&NR,&Sx,&Sy);
FP48_YYY_smul(&lv,&lv2);
FP48_YYY_ssmul(r,&lv);
}
}
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(r,r);
#endif
}
/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
void PAIR_ZZZ_fexp(FP48_YYY *r)
{
FP2_YYY X;
BIG_XXX x;
FP_YYY a,b;
FP48_YYY t1,t2,t3,t7;
BIG_XXX_rcopy(x,CURVE_Bnx_ZZZ);
FP_YYY_rcopy(&a,Fra_YYY);
FP_YYY_rcopy(&b,Frb_YYY);
FP2_YYY_from_FPs(&X,&a,&b);
/* Easy part of final exp - r^(p^24-1)(p^8+1)*/
FP48_YYY_inv(&t7,r);
FP48_YYY_conj(r,r);
FP48_YYY_mul(r,&t7);
FP48_YYY_copy(&t7,r);
FP48_YYY_frob(r,&X,8);
FP48_YYY_mul(r,&t7);
// if (FP48_YYY_isunity(r))
// {
// FP48_YYY_zero(r);
// return;
// }
// f^e0.f^e1^p.f^e2^p^2.. .. f^e14^p^14.f^e15^p^15
FP48_YYY_usqr(&t7,r); // t7=f^2
FP48_YYY_pow(&t1,&t7,x); // t1=f^2u
BIG_XXX_fshr(x,1);
FP48_YYY_pow(&t2,&t1,x); // t2=f^2u^(u/2) = f^u^2
BIG_XXX_fshl(x,1); // x must be even
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_conj(&t3,&t1); // t3=f^-2u
FP48_YYY_mul(&t2,&t3); // t2=f^u^2.f^-2u
FP48_YYY_mul(&t2,r); // t2=f^u^2.f^-2u.f = f^(u^2-2u+1) = f^e15
FP48_YYY_mul(r,&t7); // f^3
FP48_YYY_pow(&t1,&t2,x); // f^e15^u = f^(u.e15) = f^(u^3-2u^2+u) = f^(e14)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,14); // f^(u^3-2u^2+u)^p^14
FP48_YYY_mul(r,&t3); // f^3.f^(u^3-2u^2+u)^p^14
FP48_YYY_pow(&t1,&t1,x); // f^(u.e14) = f^(u^4-2u^3+u^2) = f^(e13)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,13); // f^(e13)^p^13
FP48_YYY_mul(r,&t3); // f^3.f^(u^3-2u^2+u)^p^14.f^(u^4-2u^3+u^2)^p^13
FP48_YYY_pow(&t1,&t1,x); // f^(u.e13)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,12); // f^(e12)^p^12
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e12)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,11); // f^(e11)^p^11
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e11)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,10); // f^(e10)^p^10
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e10)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,9); // f^(e9)^p^9
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e9)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,8); // f^(e8)^p^8
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e8)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_conj(&t3,&t2);
FP48_YYY_mul(&t1,&t3); // f^(u.e8).f^-e15
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,7); // f^(e7)^p^7
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e7)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,6); // f^(e6)^p^6
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e6)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,5); // f^(e5)^p^5
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e5)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,4); // f^(e4)^p^4
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e4)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,3); // f^(e3)^p^3
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e3)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,2); // f^(e2)^p^2
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e2)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_copy(&t3,&t1);
FP48_YYY_frob(&t3,&X,1); // f^(e1)^p^1
FP48_YYY_mul(r,&t3);
FP48_YYY_pow(&t1,&t1,x); // f^(u.e1)
#if SIGN_OF_X_ZZZ==NEGATIVEX
FP48_YYY_conj(&t1,&t1);
#endif
FP48_YYY_mul(r,&t1); // r.f^e0
FP48_YYY_frob(&t2,&X,15); // f^(e15.p^15)
FP48_YYY_mul(r,&t2);
FP48_YYY_reduce(r);
}
#ifdef USE_GLV_ZZZ
/* GLV method */
static void glv(BIG_XXX u[2],BIG_XXX e)
{
// -(x^8).P = (Beta.x,y)
BIG_XXX x,x2,q;
BIG_XXX_rcopy(x,CURVE_Bnx_ZZZ);
BIG_XXX_smul(x2,x,x);
BIG_XXX_smul(x,x2,x2);
BIG_XXX_smul(x2,x,x);
BIG_XXX_copy(u[0],e);
BIG_XXX_mod(u[0],x2);
BIG_XXX_copy(u[1],e);
BIG_XXX_sdiv(u[1],x2);
BIG_XXX_rcopy(q,CURVE_Order_ZZZ);
BIG_XXX_sub(u[1],q,u[1]);
return;
}
#endif // USE_GLV
/* Galbraith & Scott Method */
static void gs(BIG_XXX u[16],BIG_XXX e)
{
int i;
BIG_XXX x,w,q;
BIG_XXX_rcopy(q,CURVE_Order_ZZZ);
BIG_XXX_rcopy(x,CURVE_Bnx_ZZZ);
BIG_XXX_copy(w,e);
for (i=0; i<15; i++)
{
BIG_XXX_copy(u[i],w);
BIG_XXX_mod(u[i],x);
BIG_XXX_sdiv(w,x);
}
BIG_XXX_copy(u[15],w);
/* */
#if SIGN_OF_X_ZZZ==NEGATIVEX
BIG_XXX_modneg(u[1],u[1],q);
BIG_XXX_modneg(u[3],u[3],q);
BIG_XXX_modneg(u[5],u[5],q);
BIG_XXX_modneg(u[7],u[7],q);
BIG_XXX_modneg(u[9],u[9],q);
BIG_XXX_modneg(u[11],u[11],q);
BIG_XXX_modneg(u[13],u[13],q);
BIG_XXX_modneg(u[15],u[15],q);
#endif
return;
}
/* Multiply P by e in group G1 */
void PAIR_ZZZ_G1mul(ECP_ZZZ *P,BIG_XXX e)
{
#ifdef USE_GLV_ZZZ /* Note this method is patented */
int np,nn;
ECP_ZZZ Q;
FP_YYY cru;
BIG_XXX t,q;
BIG_XXX u[2];
BIG_XXX_rcopy(q,CURVE_Order_ZZZ);
glv(u,e);
ECP_ZZZ_copy(&Q,P);
ECP_ZZZ_affine(&Q);
FP_YYY_rcopy(&cru,CURVE_Cru_ZZZ);
FP_YYY_mul(&(Q.x),&(Q.x),&cru);
/* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
np=BIG_XXX_nbits(u[0]);
BIG_XXX_modneg(t,u[0],q);
nn=BIG_XXX_nbits(t);
if (nn<np)
{
BIG_XXX_copy(u[0],t);
ECP_ZZZ_neg(P);
}
np=BIG_XXX_nbits(u[1]);
BIG_XXX_modneg(t,u[1],q);
nn=BIG_XXX_nbits(t);
if (nn<np)
{
BIG_XXX_copy(u[1],t);
ECP_ZZZ_neg(&Q);
}
BIG_XXX_norm(u[0]);
BIG_XXX_norm(u[1]);
ECP_ZZZ_mul2(P,&Q,u[0],u[1]);
#else
ECP_ZZZ_mul(P,e);
#endif
}
/* Multiply P by e in group G2 */
void PAIR_ZZZ_G2mul(ECP8_ZZZ *P,BIG_XXX e)
{
#ifdef USE_GS_G2_ZZZ /* Well I didn't patent it :) */
int i,np,nn;
ECP8_ZZZ Q[16];
FP2_YYY X[3];
BIG_XXX x,y,u[16];
ECP8_ZZZ_frob_constants(X);
BIG_XXX_rcopy(y,CURVE_Order_ZZZ);
gs(u,e);
ECP8_ZZZ_copy(&Q[0],P);
for (i=1; i<16; i++)
{
ECP8_ZZZ_copy(&Q[i],&Q[i-1]);
ECP8_ZZZ_frob(&Q[i],X,1);
}
for (i=0; i<16; i++)
{
np=BIG_XXX_nbits(u[i]);
BIG_XXX_modneg(x,u[i],y);
nn=BIG_XXX_nbits(x);
if (nn<np)
{
BIG_XXX_copy(u[i],x);
ECP8_ZZZ_neg(&Q[i]);
}
BIG_XXX_norm(u[i]);
}
ECP8_ZZZ_mul16(P,Q,u);
#else
ECP8_ZZZ_mul(P,e);
#endif
}
/* f=f^e */
void PAIR_ZZZ_GTpow(FP48_YYY *f,BIG_XXX e)
{
#ifdef USE_GS_GT_ZZZ /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see FP16.cpp */
int i,np,nn;
FP48_YYY g[16];
FP2_YYY X;
BIG_XXX t,q;
FP_YYY fx,fy;
BIG_XXX u[16];
FP_YYY_rcopy(&fx,Fra_YYY);
FP_YYY_rcopy(&fy,Frb_YYY);
FP2_YYY_from_FPs(&X,&fx,&fy);
BIG_XXX_rcopy(q,CURVE_Order_ZZZ);
gs(u,e);
FP48_YYY_copy(&g[0],f);
for (i=1; i<16; i++)
{
FP48_YYY_copy(&g[i],&g[i-1]);
FP48_YYY_frob(&g[i],&X,1);
}
for (i=0; i<16; i++)
{
np=BIG_XXX_nbits(u[i]);
BIG_XXX_modneg(t,u[i],q);
nn=BIG_XXX_nbits(t);
if (nn<np)
{
BIG_XXX_copy(u[i],t);
FP48_YYY_conj(&g[i],&g[i]);
}
BIG_XXX_norm(u[i]);
}
FP48_YYY_pow16(f,g,u);
#else
FP48_YYY_pow(f,f,e);
#endif
}
#ifdef HAS_MAIN
using namespace std;
using namespace ZZZ;
// g++ -O2 pair256_BLS48.cpp ecp8_BLS48.cpp fp48_BLS48.cpp fp16_BLS48.cpp fp8_BLS48.cpp fp4_BLS48.cpp fp2_BLS48.cpp ecp_BLS48.cpp fp_BLS48.cpp big_B560_29.cpp rom_curve_BLS48.cpp rom_field_BLS48.cpp rand.cpp hash.cpp oct.cpp -o pair256_BLS48.exe
int main()
{
int i;
char byt[32];
csprng rng;
BIG xa,xb,ya,yb,w,a,b,t1,q,u[2],v[4],m,r,xx,x2,x4,p;
ECP8 P,G;
ECP Q,R;
FP48 g,gp;
FP16 t,c,cp,cpm1,cpm2;
FP8 X,Y;
FP2 x,y,f,Aa,Bb;
FP cru;
for (i=0; i<32; i++)
byt[i]=i+9;
RAND_seed(&rng,32,byt);
BIG_rcopy(r,CURVE_Order);
BIG_rcopy(p,Modulus);
BIG_rcopy(xa,CURVE_Gx_ZZZ);
BIG_rcopy(ya,CURVE_Gy_ZZZ);
ECP_ZZZ_set(&Q,xa,ya);
if (Q.inf) printf("Failed to set - point not on curve\n");
else printf("G1 set success\n");
printf("Q= ");
ECP_ZZZ_output(&Q);
printf("\n");
ECP8_generator(&P);
if (P.inf) printf("Failed to set - point not on curve\n");
else printf("G2 set success\n");
BIG_rcopy(a,Fra);
BIG_rcopy(b,Frb);
FP2_from_BIGs(&f,a,b);
PAIR_ZZZ_ate(&g,&P,&Q);
printf("gb= ");
FP48_output(&g);
printf("\n");
PAIR_ZZZ_fexp(&g);
printf("g= ");
FP48_output(&g);
printf("\n");
ECP_ZZZ_copy(&R,&Q);
ECP8_copy(&G,&P);
ECP8_dbl(&G);
ECP_dbl(&R);
ECP_affine(&R);
PAIR_ZZZ_ate(&g,&G,&Q);
PAIR_ZZZ_fexp(&g);
printf("g1= ");
FP48_output(&g);
printf("\n");
PAIR_ZZZ_ate(&g,&P,&R);
PAIR_ZZZ_fexp(&g);
printf("g2= ");
FP48_output(&g);
printf("\n");
PAIR_ZZZ_G1mul(&Q,r);
printf("rQ= ");
ECP_output(&Q);
printf("\n");
PAIR_ZZZ_G2mul(&P,r);
printf("rP= ");
ECP8_output(&P);
printf("\n");
PAIR_ZZZ_GTpow(&g,r);
printf("g^r= ");
FP48_output(&g);
printf("\n");
BIG_randomnum(w,r,&rng);
FP48_copy(&gp,&g);
PAIR_ZZZ_GTpow(&g,w);
FP48_trace(&t,&g);
printf("g^r= ");
FP16_output(&t);
printf("\n");
FP48_compow(&t,&gp,w,r);
printf("t(g)= ");
FP16_output(&t);
printf("\n");
}
#endif