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
|
/******************************************************
* gfp_element tests *
* *
* (C) 2007 Patrick Sona *
* *
* Falko Strenzke *
* strenzke@flexsecure.de *
* (C) 2008 Jack Lloyd *
******************************************************/
#include "validate.h"
#if defined(BOTAN_HAS_BIGINT_GFP)
#include <botan/bigint.h>
#include <botan/numthry.h>
#include <botan/gfp_element.h>
#include <botan/gfp_modulus.h>
#include <botan/curve_gfp.h>
#include <botan/ec_dompar.h>
#include <iostream>
using namespace Botan;
#define CHECK_MESSAGE(expr, print) if(!(expr)) { std::cout << print << "\n"; pass = false; }
#define CHECK(expr) if(!(expr)) { std::cout << #expr << "\n"; pass = false; }
namespace {
bool test_turn_on_sp_red_mul()
{
std::cout << "." << std::flush;
bool pass = true;
GFpElement a1(23,15);
GFpElement b1(23,18);
GFpElement c1 = a1*b1;
GFpElement a2(23,15);
GFpElement b2(23,18);
a2.turn_on_sp_red_mul();
a2.turn_on_sp_red_mul();
b2.turn_on_sp_red_mul();
b2.turn_on_sp_red_mul();
GFpElement c2 = a2*b2;
if(c1 != c2)
{
std::cout << "test_turn_on_sp_red_mul: ";
std::cout << "c1 = " << c1 << " != ";
std::cout << "c2 = " << c2 << "\n";
return false; // test failed
}
return pass; // pass
}
bool test_bi_div_even()
{
std::cout << "." << std::flush;
bool pass = true;
std::string str_large("1552518092300708935148979488462502555256886017116696611139052038026050952686323255099158638440248181850494907312621195144895406865083132424709500362534691373159016049946612882688577088900506460909202178541447303914546699487373976586");
BigInt to_div(str_large);
BigInt half = to_div/2;
BigInt should_be_to_div = half*2;
CHECK_MESSAGE(should_be_to_div == to_div, "error in division/multiplication of large BigInt");
// also testing /=...
BigInt before_div = to_div;
to_div /= 2;
BigInt should_be_before(to_div*2);
CHECK_MESSAGE(should_be_before == before_div, "error in division/multiplication of large BigInt");
return pass;
}
bool test_bi_div_odd()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string str_large("1552518092300708935148979488462502555256886017116696611139052038026050952686323255099158638440248181850494907312621195144895406865083132424709500362534691373159016049946612882688577088900506460909202178541447303914546699487373976585");
BigInt to_div(str_large);
BigInt half = to_div/2;
BigInt should_be_to_div = half*2;
BigInt diff = should_be_to_div-to_div;
CHECK_MESSAGE((diff <= 1) && (diff >= BigInt("-1")), "error in division/multiplication (/) of large BigInt, differnce = " << diff);
// also testing /=...
BigInt before_div = to_div;
to_div /= 2;
BigInt should_be_before(to_div*2);
BigInt diff2(should_be_before - before_div);
CHECK_MESSAGE((diff2 <= 1) && (diff2 >= BigInt("-1")), "error in division/multiplication (/=) of large BigInt, difference = " << diff2);
return pass;
}
bool test_deep_montgm()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
//std::string s_prime = "5";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333334";
//std::string s_value_a = "4";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
//std::string s_value_b = "3";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a_trf(bi_prime, bi_value_a, true);
GFpElement gfp_a_ntrf(bi_prime, bi_value_a, false);
GFpElement gfp_b_trf(bi_prime, bi_value_b, true);
GFpElement gfp_b_ntrf(bi_prime, bi_value_b, false);
//CHECK(!gfp_b_trf.is_trf_to_mres());
gfp_b_trf.get_mres();
gfp_a_trf.get_mres();
GFpElement c_trf(gfp_a_trf * gfp_b_trf);
GFpElement c_ntrf(gfp_a_ntrf * gfp_b_ntrf);
if(c_trf != c_ntrf)
{
std::cout << "test_deep_montgm - " << c_trf << " != " << c_ntrf << "\n";
}
return pass; // pass
}
bool test_gfp_div_small_numbers()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "13";
BigInt bi_prime(s_prime);
std::string s_value_a = "2";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "3";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_b, true);
GFpElement gfp_c(bi_prime, bi_value_b, false);
CHECK(!gfp_a.is_trf_to_mres());
//convert to montgomery
gfp_b.get_mres();
CHECK(gfp_b.is_trf_to_mres());
CHECK(!gfp_c.is_trf_to_mres());
GFpElement res_div_m = gfp_a / gfp_b;
CHECK(res_div_m.is_trf_to_mres());
GFpElement res_div_n = gfp_a / gfp_c;
CHECK(!res_div_n.is_trf_to_mres());
CHECK_MESSAGE(res_div_n.get_value() == res_div_m.get_value(), "transformed result is not equal to untransformed result");
CHECK_MESSAGE(gfp_a.get_value() == s_value_a, "GFpElement has changed while division operation");
CHECK_MESSAGE(gfp_b.get_value() == s_value_b, "GFpElement has changed while division operation");
GFpElement inverse_b = inverse(gfp_b);
GFpElement res_div_alternative = gfp_a * inverse_b;
if(res_div_m != res_div_alternative)
{
std::cout << "test_gfp_div_small_numbers - a/b != a*b^-1 where\n"
<< "a = " << gfp_a << "\n"
<< "b = " << gfp_b << "\n"
<< "b^-1 = " << inverse_b << "\n"
<< "a*b^-1 = " << res_div_alternative << "\n"
<< "a/b = " << res_div_n << "\n";
pass = false;
}
CHECK_MESSAGE(res_div_m == res_div_alternative, "a/b is not as equal to a * b^-1");
//cout << "Div-result transformed:" << res_div_m.get_value() << endl;
//cout << "Div-result untransformed:" << res_div_n.get_value() << endl;
//cout << "Div-Alternative: " << res_div_alternative.get_value() << endl;
return pass;
}
bool test_gfp_basics()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
GFpElement gfp_a(bi_prime, bi_value_a, true);
CHECK(gfp_a.get_p() == s_prime);
CHECK(gfp_a.get_value() == s_value_a);
CHECK(!gfp_a.is_trf_to_mres());
gfp_a.get_mres();
CHECK(gfp_a.is_trf_to_mres());
return pass;
}
bool test_gfp_addSubNegate()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_a, true);
gfp_b.negate();
GFpElement zero = gfp_a + gfp_b;
BigInt bi_zero("0");
CHECK(zero.get_value() == bi_zero);
CHECK(gfp_a.get_value() == bi_value_a);
return pass;
}
bool test_gfp_mult()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_b, true);
GFpElement gfp_c(bi_prime, bi_value_b, false);
CHECK(!gfp_a.is_trf_to_mres());
//convert to montgomery
gfp_b.get_mres();
CHECK(gfp_b.is_trf_to_mres());
CHECK(!gfp_c.is_trf_to_mres());
GFpElement res_mult_m = gfp_a * gfp_b;
CHECK(res_mult_m.is_trf_to_mres());
GFpElement res_mult_n = gfp_a * gfp_c;
CHECK(!res_mult_n.is_trf_to_mres());
if(res_mult_n != res_mult_m)
std::cout << gfp_a << " * " << gfp_b << " =? "
<< "n = " << res_mult_n << " != m = " << res_mult_m << "\n";
return pass;
}
bool test_gfp_div()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_b, true);
GFpElement gfp_c(bi_prime, bi_value_b, false);
CHECK(!gfp_a.is_trf_to_mres());
//convert to montgomery
gfp_b.get_mres();
CHECK(gfp_b.is_trf_to_mres());
CHECK(!gfp_c.is_trf_to_mres());
GFpElement res_div_m = gfp_a / gfp_b;
CHECK(res_div_m.is_trf_to_mres());
GFpElement res_div_n = gfp_a / gfp_c;
CHECK(!res_div_n.is_trf_to_mres());
CHECK_MESSAGE(res_div_n.get_value() == res_div_m.get_value(), "transformed result is not equal to untransformed result");
CHECK_MESSAGE(gfp_a.get_value() == s_value_a, "GFpElement has changed while division operation");
CHECK_MESSAGE(gfp_b.get_value() == s_value_b, "GFpElement has changed while division operation");
GFpElement inverse_b = inverse(gfp_b);
GFpElement res_div_alternative = gfp_a * inverse_b;
CHECK_MESSAGE(res_div_m == res_div_alternative, "a/b is not as equal to a * b^-1");
//cout << "Div-result transformed:" << res_div_m.get_value() << endl;
//cout << "Div-result untransformed:" << res_div_n.get_value() << endl;
//cout << "Div-Alternative: " << res_div_alternative.get_value() << endl;
return pass;
}
bool test_gfp_add()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_b, true);
GFpElement gfp_c(bi_prime, bi_value_b, true);
CHECK(!gfp_a.is_trf_to_mres());
//convert to montgomery
gfp_b.get_mres();
CHECK(gfp_b.is_trf_to_mres());
CHECK(!gfp_c.is_trf_to_mres());
GFpElement res_add_m = gfp_a + gfp_b;
CHECK(res_add_m.is_trf_to_mres());
GFpElement res_add_n = gfp_a + gfp_c;
// commented out by patrick, behavior is clear:
// rhs might be transformed, lhs never
// for now, this behavior is only intern, doesn't matter for programm function
// CHECK_MESSAGE(res_add_n.is_trf_to_mres(), "!! Falko: NO FAIL, wrong test, please repair"); // clear: rhs might be transformed, lhs never
CHECK(res_add_n.get_value() == res_add_m.get_value());
return pass;
}
bool test_gfp_sub()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b(bi_prime, bi_value_b, true);
GFpElement gfp_c(bi_prime, bi_value_b, true);
CHECK(!gfp_a.is_trf_to_mres());
//convert to montgomery
gfp_b.get_mres();
CHECK(gfp_b.is_trf_to_mres());
CHECK(!gfp_c.is_trf_to_mres());
GFpElement res_sub_m = gfp_b - gfp_a;
CHECK(res_sub_m.is_trf_to_mres());
CHECK(gfp_a.is_trf_to_mres()); // added by Falko
GFpElement res_sub_n = gfp_c - gfp_a;
// commented out by psona, behavior is clear:
// rhs might be transformed, lhs never
// for now, this behavior is only intern, doesn't matter for programm function
// CHECK_MESSAGE(!res_sub_n.is_trf_to_mres(), "!! Falko: NO FAIL, wrong test, please repair"); // falsche
// Erwartung: a wurde durch die operation oben auch
// ins m-residue transformiert, daher passiert das hier auch mit
// c, und das Ergebnis ist es auch
CHECK(res_sub_n.get_value() == res_sub_m.get_value());
return pass;
}
bool test_more_gfp_div()
{
std::cout << '.' << std::flush;
bool pass = true;
std::string s_prime = "5334243285367";
BigInt bi_prime(s_prime);
std::string s_value_a = "3333333333333";
BigInt bi_value_a(s_value_a);
std::string s_value_b = "4444444444444";
BigInt bi_value_b(s_value_b);
GFpElement gfp_a(bi_prime, bi_value_a, true);
GFpElement gfp_b_trf(bi_prime, bi_value_b, true);
GFpElement gfp_b_ntrf(bi_prime, bi_value_b, false);
CHECK(!gfp_b_trf.is_trf_to_mres());
gfp_b_trf.get_mres();
CHECK(gfp_b_trf.is_trf_to_mres());
CHECK(!gfp_a.is_trf_to_mres());
bool exc_ntrf = false;
try
{
gfp_b_ntrf.get_mres();
}
catch(Botan::Illegal_Transformation e)
{
exc_ntrf = true;
}
CHECK(exc_ntrf);
CHECK(!gfp_b_ntrf.is_trf_to_mres());
CHECK_MESSAGE(gfp_b_trf == gfp_b_ntrf, "b is not equal to itself (trf)");
GFpElement b_trf_inv(gfp_b_trf);
b_trf_inv.inverse_in_place();
GFpElement b_ntrf_inv(gfp_b_ntrf);
b_ntrf_inv.inverse_in_place();
CHECK_MESSAGE(b_trf_inv == b_ntrf_inv, "b inverted is not equal to itself (trf)");
CHECK(gfp_b_trf/gfp_b_ntrf == GFpElement(bi_prime, 1));
CHECK(gfp_b_trf/gfp_b_trf == GFpElement(bi_prime, 1));
CHECK(gfp_b_ntrf/gfp_b_ntrf == GFpElement(bi_prime, 1));
GFpElement rhs(gfp_a/gfp_b_trf);
GFpElement lhs(gfp_a/gfp_b_ntrf);
if(lhs != rhs)
{
std::cout << "test_more_gfp_div - " << lhs << " != " << rhs << "\n";
pass = false;
}
return pass;
}
bool test_gfp_mult_u32bit()
{
std::cout << '.' << std::flush;
bool pass = true;
/*
Botan::EC_Domain_Params parA(Botan::get_EC_Dom_Pars_by_oid("1.2.840.10045.3.1.1"));
CurveGFp curve = parA.get_curve();
//CurveGFp curve2 = parA.get_curve();
BigInt p = curve.get_p();
GFpElement a = curve.get_a();
GFpElement a_mr = curve.get_mres_a();
Botan::u32bit u_x = 134234;
BigInt b_x(u_x);
GFpElement g_x(p, b_x);
CHECK(a*u_x == a*g_x);
CHECK(a*u_x == u_x*a);
CHECK(a*g_x == g_x*a);
CHECK(a_mr*u_x == a*g_x);
CHECK(u_x*a_mr == a*g_x);
*/
return pass;
}
/**
* This tests verifies the functionality of sharing pointers for modulus dependent values
*/
bool test_gfp_shared_vals()
{
std::cout << '.' << std::flush;
bool pass = true;
BigInt p("5334243285367");
GFpElement a(p, BigInt("234090"));
GFpElement shcpy_a(1,0);
shcpy_a.share_assign(a);
std::tr1::shared_ptr<GFpModulus> ptr1 = a.get_ptr_mod();
std::tr1::shared_ptr<GFpModulus> ptr2 = shcpy_a.get_ptr_mod();
CHECK_MESSAGE(ptr1.get() == ptr2.get(), "shared pointers for moduli aren´t equal");
GFpElement b(1,0);
b = a; // create a non shared copy
std::tr1::shared_ptr<GFpModulus> ptr_b_p = b.get_ptr_mod();
CHECK_MESSAGE(ptr1.get() != ptr_b_p.get(), "non shared pointers for moduli are equal");
a.turn_on_sp_red_mul();
GFpElement c1 = a * shcpy_a;
GFpElement c2 = a * a;
GFpElement c3 = shcpy_a * shcpy_a;
GFpElement c4 = shcpy_a * a;
shcpy_a.turn_on_sp_red_mul();
GFpElement c5 = shcpy_a * shcpy_a;
if(c1 != c2 || c2 != c3 || c3 != c4 || c4 != c5)
{
std::cout << "test_gfp_shared_vals failed"
<< " a=" << a
<< " shcpy_a=" << shcpy_a
<< " c1=" << c1 << " c2=" << c2
<< " c3=" << c3 << " c4=" << c4
<< " c5=" << c5 << "\n";
pass = false;
}
swap(a,shcpy_a);
std::tr1::shared_ptr<GFpModulus> ptr3 = a.get_ptr_mod();
std::tr1::shared_ptr<GFpModulus> ptr4 = shcpy_a.get_ptr_mod();
CHECK_MESSAGE(ptr3.get() == ptr4.get(), "shared pointers for moduli aren´t equal after swap");
CHECK(ptr1.get() == ptr4.get());
CHECK(ptr2.get() == ptr3.get());
swap(a,b);
std::tr1::shared_ptr<GFpModulus> ptr_a = a.get_ptr_mod();
std::tr1::shared_ptr<GFpModulus> ptr_b = shcpy_a.get_ptr_mod();
CHECK(ptr_a.get() == ptr_b_p.get());
CHECK(ptr_b.get() == ptr3.get());
return pass;
}
/**
* The following test checks the behaviour of GFpElements assignment operator, which
* has quite complex behaviour with respect to sharing groups and precomputed values
* (with respect to montgomery mult.)
*/
bool test_gfpel_ass_op()
{
std::cout << '.' << std::flush;
bool pass = true;
// test different moduli
GFpElement a(23,4);
GFpElement b(11,6);
GFpElement b2(11,6);
a = b;
CHECK(a==b2);
CHECK(a.get_value() == b2.get_value());
CHECK(a.get_p() == b2.get_p());
CHECK(a.get_ptr_mod().get() != b.get_ptr_mod().get()); // sharing groups
// may not be fused!
// also test some share_assign()...
a.share_assign(b);
CHECK(a==b2);
CHECK(a.get_value() == b2.get_value());
CHECK(a.get_p() == b2.get_p());
CHECK(a.get_ptr_mod().get() == b.get_ptr_mod().get()); // sharing groups
// shall be fused!
//---------------------------
// test assignment within sharing group
// with montg.mult.
GFpElement c(5,2);
GFpElement d(5,2);
d.share_assign(c);
CHECK(d.get_ptr_mod().get() == c.get_ptr_mod().get());
CHECK(d.get_ptr_mod()->get_p() == c.get_ptr_mod()->get_p());
CHECK(c.get_ptr_mod()->get_r().is_zero());
c.turn_on_sp_red_mul();
CHECK(d.get_ptr_mod().get() == c.get_ptr_mod().get());
CHECK(d.get_ptr_mod()->get_p() == c.get_ptr_mod()->get_p());
CHECK(!c.get_ptr_mod()->get_p().is_zero());
GFpElement f(11,5);
d = f;
CHECK(f.get_ptr_mod().get() != c.get_ptr_mod().get());
GFpElement e = c*c;
GFpElement g = d*d;
GFpElement h = f*f;
CHECK(h == g);
GFpElement c2(5,2);
GFpElement d2(5,2);
d2.share_assign(c2);
GFpElement f2(11,5);
d2 = f2;
c2.turn_on_sp_red_mul();
CHECK(d2.get_ptr_mod().get() != c2.get_ptr_mod().get()); // the sharing group was left
CHECK(d2.get_ptr_mod()->get_r() == f2.get_ptr_mod()->get_r());
CHECK(c2.get_p() == 5); // c2´s shared values weren´t modified because
// the sharing group with d2 was separated by
// the assignment "d2 = f2"
d2.turn_on_sp_red_mul();
CHECK(d2.get_ptr_mod()->get_p() != c2.get_ptr_mod()->get_p());
GFpElement e2 = c2*c2;
GFpElement g2 = d2*d2;
GFpElement h2 = f2*f2;
CHECK(h2 == g2);
GFpElement c3(5,2);
GFpElement d3(5,2);
d3.share_assign(c3);
GFpElement f3(11,2);
d3 = f3;
GFpElement e3 = c3*c3;
GFpElement g3 = d3*d3;
CHECK(e == e2);
CHECK(g == g2);
CHECK(e == e3);
CHECK(g == g2);
return pass;
}
bool test_gfp_swap()
{
std::cout << '.' << std::flush;
bool pass = true;
BigInt p("173");
GFpElement a(p, BigInt("2342"));
GFpElement b(p, BigInt("423420"));
GFpModulus* a_mod = a.get_ptr_mod().get();
GFpModulus* b_mod = b.get_ptr_mod().get();
//GFpModulus* a_d = a.get_ptr_mod()->get_p_dash();
//GFpModulus* b_d = b.get_ptr_mod()->get_p_dash();
swap(a,b);
CHECK_MESSAGE(b.get_value() == 2342%173, "actual value of b was: " << b.get_value() );
CHECK_MESSAGE(a.get_value() == 423420%173, "actual value of a was: " << a.get_value() );
CHECK(a_mod == b.get_ptr_mod().get());
CHECK(b_mod == a.get_ptr_mod().get());
//CHECK(a_d == b.get_ptr_mod()->get_p_dash());
//CHECK(b_d == a.get_ptr_p_dash()->get_p_dash());
GFpElement c(p, BigInt("2342329"));
GFpElement d(1,1);
d.share_assign(c);
d += d;
c.swap(d);
CHECK(d.get_value() == 2342329%173);
CHECK(c.get_value() == (d*2).get_value());
return pass;
}
bool test_inv_in_place()
{
std::cout << '.' << std::flush;
bool pass = true;
BigInt mod(173);
GFpElement a1(mod, 288);
a1.turn_on_sp_red_mul();
a1.get_mres(); // enforce the conversion
GFpElement a1_inv(a1);
a1_inv.inverse_in_place();
GFpElement a2(mod, 288);
GFpElement a2_inv(a2);
a2_inv.inverse_in_place();
/*cout << "a1_inv = " << a1_inv << endl;
cout << "a2_inv = " << a2_inv << endl;*/
CHECK_MESSAGE(a1_inv == a2_inv, "error with inverting tranformed GFpElement");
CHECK(a1_inv.inverse_in_place() == a1);
CHECK(a2_inv.inverse_in_place() == a2);
return pass;
}
bool test_op_eq()
{
std::cout << '.' << std::flush;
bool pass = true;
BigInt mod(173);
GFpElement a1(mod, 299);
a1.turn_on_sp_red_mul();
a1.get_mres(); // enforce the conversion
GFpElement a2(mod, 288);
CHECK_MESSAGE(a1 != a2, "error with GFpElement comparison");
return pass;
}
bool test_rand_int(RandomNumberGenerator& rng)
{
bool pass = true;
for(int i=0; i< 100; i++)
{
std::cout << '.' << std::flush;
BigInt x = BigInt::random_integer(rng, 1,3);
//cout << "x = " << x << "\n"; // only 1,2 are put out
CHECK(x == 1 || x==2);
}
return pass;
}
bool test_bi_bit_access()
{
std::cout << '.' << std::flush;
bool pass = true;
BigInt a(323);
CHECK(a.get_bit(1) == 1);
CHECK(a.get_bit(1000) == 0);
return pass;
}
#if 0
bool test_sec_mod_mul()
{
//cout << "starting test_sec_mod_mul" << endl;
bool pass = true;
//mod_mul_secure(BigInt const& a, BigInt const& b, BigInt const& m)
BigInt m("5334243285367");
BigInt a("3333333333333");
BigInt b("4444444444444");
for(int i = 0; i<10; i++)
{
std::cout << '.' << std::flush;
BigInt c1 = a * b;
c1 %= m;
BigInt c2 = mod_mul_secure(a, b, m);
CHECK_MESSAGE(c1 == c2, "should be " << c1 << ", was " << c2);
}
//cout << "ending test_sec_mod_mul" << endl;
return pass;
}
#endif
#if 0
bool test_sec_bi_mul()
{
//mod_mul_secure(BigInt const& a, BigInt const& b, BigInt const& m)
bool pass = true;
BigInt m("5334243285367");
BigInt a("3333333333333");
BigInt b("4444444444444");
for(int i = 0; i<10; i++)
{
std::cout << '.' << std::flush;
BigInt c1 = a * b;
//c1 %= m;
BigInt c2(a);
c2.mult_this_secure(b, m);
CHECK_MESSAGE(c1 == c2, "should be " << c1 << ", was " << c2);
}
return pass;
}
#endif
}
u32bit do_gfpmath_tests(Botan::RandomNumberGenerator& rng)
{
std::cout << "Testing GF(p) math " << std::flush;
u32bit failed = 0;
failed += !test_turn_on_sp_red_mul();
failed += !test_bi_div_even();
failed += !test_bi_div_odd();
failed += !test_deep_montgm();
failed += !test_gfp_div_small_numbers();
failed += !test_gfp_basics();
failed += !test_gfp_addSubNegate();
failed += !test_gfp_mult();
failed += !test_gfp_div();
failed += !test_gfp_add();
failed += !test_gfp_sub();
failed += !test_more_gfp_div();
failed += !test_gfp_mult_u32bit();
failed += !test_gfp_shared_vals();
failed += !test_gfpel_ass_op();
failed += !test_gfp_swap();
failed += !test_inv_in_place();
failed += !test_op_eq();
failed += !test_rand_int(rng);
failed += !test_bi_bit_access();
//failed += !test_sec_mod_mul();
//failed += !test_sec_bi_mul();
#if 0
if(failed == 0)
std::cout << " OK";
else
std::cout << ' ' << failed << " failed";
#endif
std::cout << std::endl;
return failed;
}
#else
u32bit do_gfpmath_tests(Botan::RandomNumberGenerator&) { return 0; }
#endif
|