-
Notifications
You must be signed in to change notification settings - Fork 7
/
field_elem.rs
1381 lines (1187 loc) · 39.5 KB
/
field_elem.rs
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
use rand::{CryptoRng, RngCore};
use crate::constants::{BarrettRedc_k, BarrettRedc_u, BarrettRedc_v, CurveOrder, MODBYTES, NLEN};
use crate::errors::{SerzDeserzError, ValueError};
use crate::types::{BigNum, DoubleBigNum, Limb};
use crate::utils::{barrett_reduction, get_seeded_RNG, get_seeded_RNG_with_rng, hash_msg};
use amcl::rand::RAND;
use std::cmp::Ordering;
use std::fmt;
use std::hash::{Hash, Hasher};
use std::ops::{Add, AddAssign, Index, IndexMut, Mul, Neg, Sub, SubAssign};
use std::slice::Iter;
use clear_on_drop::clear::Clear;
use serde::ser::{Error as SError, Serialize, Serializer};
use serde::de::{Deserialize, Deserializer, Error as DError, Visitor};
#[macro_export]
macro_rules! add_field_elems {
( $( $elem:expr ),* ) => {
{
let mut sum = FieldElement::new();
$(
sum += $elem;
)*
sum
}
};
}
#[derive(Clone, Debug)]
pub struct FieldElement {
value: BigNum,
}
impl fmt::Display for FieldElement {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.value.fmt(f)
}
}
impl Hash for FieldElement {
fn hash<H: Hasher>(&self, state: &mut H) {
state.write(&self.to_bytes())
}
}
impl Default for FieldElement {
fn default() -> Self { Self::new() }
}
impl Drop for FieldElement {
fn drop(&mut self) {
self.value.w.clear();
}
}
/// Represents an element of the prime field of the curve. All operations are done modulo the curve order
impl FieldElement {
/// Creates a new field element with value 0
pub fn new() -> Self {
Self {
value: BigNum::new(),
}
}
pub fn zero() -> Self {
Self {
value: BigNum::new(),
}
}
pub fn one() -> Self {
Self {
value: BigNum::new_int(1),
}
}
pub fn minus_one() -> Self {
let mut o = Self::one();
o.negate();
o
}
/// Return a random non-zero field element
pub fn random() -> Self {
Self::random_field_element().into()
}
/// Return a random non-zero field element using the given random number generator
pub fn random_using_rng<R: RngCore + CryptoRng>(rng: &mut R) -> Self {
Self::random_field_element_using_rng(rng).into()
}
pub fn is_zero(&self) -> bool {
BigNum::iszilch(&self.value)
}
pub fn is_one(&self) -> bool {
BigNum::isunity(&self.value)
}
/// Return bytes in MSB form
pub fn to_bytes(&self) -> Vec<u8> {
let mut temp = BigNum::new_copy(&self.value);
let mut bytes: [u8; MODBYTES] = [0; MODBYTES];
temp.tobytes(&mut bytes);
bytes.to_vec()
}
/// Expects bytes in MSB form
pub fn from_bytes(bytes: &[u8]) -> Result<Self, SerzDeserzError> {
if bytes.len() != MODBYTES {
return Err(SerzDeserzError::FieldElementBytesIncorrectSize(
bytes.len(),
MODBYTES,
));
}
let mut n = BigNum::frombytes(bytes);
n.rmod(&CurveOrder);
Ok(Self { value: n })
}
pub fn to_bignum(&self) -> BigNum {
let mut v = self.value.clone();
v.rmod(&CurveOrder);
v
}
/// Hash an arbitrary sized message using SHAKE and return output as a field element
pub fn from_msg_hash(msg: &[u8]) -> Self {
// TODO: Ensure result is not 0
let h = &hash_msg(msg);
h.into()
}
/// Add a field element to itself. `self = self + b`
pub fn add_assign_(&mut self, b: &Self) {
// Not using `self.plus` to avoid cloning. Breaking the abstraction a bit for performance.
self.value.add(&b.value);
self.value.rmod(&CurveOrder);
}
/// Subtract a field element from itself. `self = self - b`
pub fn sub_assign_(&mut self, b: &Self) {
// Not using `self.minus` to avoid cloning. Breaking the abstraction a bit for performance.
let neg_b = BigNum::modneg(&b.value, &CurveOrder);
self.value.add(&neg_b);
self.value.rmod(&CurveOrder);
}
/// Return sum of a field element and itself. `self + b`
pub fn plus(&self, b: &Self) -> Self {
let mut sum = self.value.clone();
sum.add(&b.value);
sum.rmod(&CurveOrder);
sum.into()
}
/// Return difference of a field element and itself. `self - b`
pub fn minus(&self, b: &Self) -> Self {
let mut sum = self.value.clone();
let neg_b = BigNum::modneg(&b.value, &CurveOrder);
sum.add(&neg_b);
sum.rmod(&CurveOrder);
sum.into()
}
/// Multiply 2 field elements modulus the order of the curve.
/// (field_element_a * field_element_b) % curve_order
pub fn multiply(&self, b: &Self) -> Self {
let d = BigNum::mul(&self.value, &b.value);
Self::reduce_dmod_curve_order(&d).into()
}
/// Calculate square of a field element modulo the curve order, i.e `a^2 % curve_order`
pub fn square(&self) -> Self {
let d = BigNum::sqr(&self.value);
Self::reduce_dmod_curve_order(&d).into()
}
/// Return negative of field element
pub fn negation(&self) -> Self {
let zero = Self::zero();
zero.minus(&self)
}
pub fn negate(&mut self) {
let zero = Self::zero();
self.value = zero.minus(&self).value;
}
/// Calculate inverse of a field element modulo the curve order, i.e `a^-1 % curve_order`
pub fn inverse(&self) -> Self {
// Violating constant time guarantee until bug fixed in amcl
if self.is_zero() {
return Self::zero();
}
let mut inv = self.value.clone();
inv.invmodp(&CurveOrder);
inv.into()
}
pub fn inverse_mut(&mut self) {
// Violating constant time guarantee until bug fixed in amcl
if self.is_zero() {
self.value = BigNum::new();
} else {
self.value.invmodp(&CurveOrder);
}
}
pub fn shift_right(&self, k: usize) -> Self {
let mut t = self.value.clone();
t.shr(k);
t.into()
}
pub fn shift_left(&self, k: usize) -> Self {
let mut t = self.value.clone();
t.shl(k);
t.into()
}
pub fn is_even(&self) -> bool {
self.value.parity() == 0
}
pub fn is_odd(&self) -> bool {
!self.is_even()
}
/// Gives vectors of bit-vectors for the Big number. Each `Chunk` has a separate bit-vector,
/// hence upto NLEN bit-vectors possible. NOT SIDE CHANNEL RESISTANT
pub fn to_bitvectors(&self) -> Vec<Vec<u8>> {
let mut k = NLEN - 1;
let mut s = BigNum::new_copy(&self.value);
s.norm();
while (k as isize) >= 0 && s.w[k] == 0 {
k = k.wrapping_sub(1)
}
if (k as isize) < 0 {
return vec![];
}
let mut b_vec: Vec<Vec<u8>> = vec![vec![]; k + 1];
for i in 0..k + 1 {
let mut c = s.w[i];
let mut c_vec: Vec<u8> = vec![];
while c != 0 {
c_vec.push((c % 2) as u8);
c /= 2;
}
b_vec[i] = c_vec;
}
return b_vec;
}
/// Return a random non-zero field element using given random number generator
fn random_field_element_using_rng<R: RngCore + CryptoRng>(rng: &mut R) -> BigNum {
// initialise from at least 128 byte string of raw random entropy
let entropy_size = 256;
let mut r = get_seeded_RNG_with_rng(entropy_size, rng);
Self::get_big_num_from_RAND(&mut r)
}
fn random_field_element() -> BigNum {
// initialise from at least 128 byte string of raw random entropy
let entropy_size = 256;
let mut r = get_seeded_RNG(entropy_size);
Self::get_big_num_from_RAND(&mut r)
}
fn get_big_num_from_RAND(r: &mut RAND) -> BigNum {
let mut n = BigNum::randomnum(&BigNum::new_big(&CurveOrder), r);
while n.iszilch() {
n = BigNum::randomnum(&BigNum::new_big(&CurveOrder), r);
}
n
}
/// Conversion to wNAF, i.e. windowed Non Adjacent form
/// Taken from Guide to Elliptic Curve Cryptography book, "Algorithm 3.35 Computing the width-w NAF of a positive integer" with modification
/// at step 2.1, if k_i >= 2^(w-1), k_i = k_i - 2^w
pub fn to_wnaf(&self, w: usize) -> Vec<i8> {
// required by the NAF definition
debug_assert!(w >= 2);
// required so that the NAF digits fit in i8
debug_assert!(w <= 8);
// Working on the the underlying BIG to save the cost of to and from conversion with FieldElement
let mut k = self.to_bignum();
let mut naf: Vec<i8> = vec![];
let two_w_1 = 1 << (w - 1); // 2^(w-1)
let two_w = 1 << w; // 2^w
// While k is not zero
while !k.iszilch() {
// If k is odd
let t = if k.parity() == 1 {
let mut b = k.clone();
// b = b % 2^w
b.mod2m(w);
// Only the first limb is useful as b <2^w
let mut u = b.w[0];
if u >= two_w_1 {
u = u - two_w;
}
k.w[0] = k.w[0] - u;
u as i8
} else {
0i8
};
naf.push(t);
k.fshr(1usize);
}
naf
}
/// Convert to base that is power of 2. Does not handle negative nos or `base` higher than 2^7
pub fn to_power_of_2_base(&self, n: usize) -> Vec<u8> {
debug_assert!(n <= 7);
if self.is_zero() {
return vec![0u8];
}
let mut t = self.to_bignum();
t.norm();
let mut base_repr = vec![];
while !t.iszilch() {
let mut d = t.clone();
d.mod2m(n);
base_repr.push(d.w[0] as u8);
t.fshr(n);
}
base_repr
}
/// Convert to base that is power of 2. Does not handle negative nos or `base` higher than 2^7
pub fn from_power_of_2_base(repr: &[u8], n: usize) -> Self {
debug_assert!(n <= 7);
let mut accum = FieldElement::zero();
let mut factor = FieldElement::one().to_bignum();
for i in 0..repr.len() {
accum += FieldElement::from(factor) * FieldElement::from(repr[i]);
factor.fshl(n);
}
accum
}
/// Takes a bunch of field elements and returns the inverse of all field elements.
/// Also returns the product of all inverses as its computed as a side effect.
/// For an input of n elements, rather than doing n inversions, does only 1 inversion but 3n multiplications.
/// eg `batch_invert([a, b, c, d])` returns ([1/a, 1/b, 1/c, 1/d], 1/a * 1/b * 1/c * 1/d)
/// Algorithm taken from Guide to Elliptic Curve Cryptography book, "Algorithm 2.26 Simultaneous inversion"
pub fn batch_invert(elems: &[Self]) -> (Vec<Self>, Self) {
debug_assert!(elems.len() > 0);
let k = elems.len();
// TODO: Multiplications below can be sped up by using montgomery multiplication.
// Construct c as [elems[0], elems[0]*elems[1], elems[0]*elems[1]*elems[2], .... elems[0]*elems[1]*elems[2]*...elems[k-1]]
let mut c: Vec<Self> = vec![elems[0].clone()];
for i in 1..k {
c.push(&c[i - 1] * &elems[i])
}
// u = 1 / elems[0]*elems[1]*elems[2]*...elems[k-1]
let all_inv = c[k - 1].inverse();
let mut u = all_inv.clone();
let mut inverses = vec![FieldElement::one(); k];
for i in (1..k).rev() {
inverses[i] = &u * &c[i - 1];
u = &u * &elems[i];
}
inverses[0] = u;
(inverses, all_inv)
}
/// Returns hex string in big endian
pub fn to_hex(&self) -> String {
// TODO: Make constant time.
self.to_bignum().to_hex()
}
/// Create big number from hex string in big endian
pub fn from_hex(s: String) -> Result<Self, SerzDeserzError> {
let mut f = Self::parse_hex_as_bignum(s)?;
f.rmod(&CurveOrder);
Ok(f.into())
}
/// Useful for reducing product of BigNums. Uses Barrett reduction
pub fn reduce_dmod_curve_order(x: &DoubleBigNum) -> BigNum {
let (k, u, v) = (*BarrettRedc_k, *BarrettRedc_u, *BarrettRedc_v);
barrett_reduction(&x, &CurveOrder, k, &u, &v)
}
/// Parse given hex string as BigNum in constant time.
pub fn parse_hex_as_bignum(val: String) -> Result<BigNum, SerzDeserzError> {
// Logic almost copied from AMCL but with error handling and constant time execution.
// Constant time is important as hex is used during serialization and deserialization.
// A seemingly effortless solution is to filter string for errors and pad with 0s before
// passing to AMCL but that would be expensive as the string is scanned twice
let mut val = val;
// Given hex cannot be bigger than max byte size
if val.len() > MODBYTES*2 {
return Err(SerzDeserzError::FieldElementBytesIncorrectSize(
val.len(),
MODBYTES,
));
}
// Pad the string for constant time parsing.
while val.len() < MODBYTES*2 {
val.insert(0, '0');
}
let mut res = BigNum::new();
for i in 0..val.len() {
match u8::from_str_radix(&val[i..i+1], 16) {
Ok(n) => res.w[0] += n as Limb,
Err(_) => return Err(SerzDeserzError::RequiredHexChar)
}
if i == (val.len()-1) {break}
res.shl(4);
}
return Ok(res);
}
}
impl Serialize for FieldElement {
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
serializer.serialize_newtype_struct("FieldElement", &self.to_hex())
}
}
impl<'a> Deserialize<'a> for FieldElement {
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
D: Deserializer<'a>,
{
struct FieldElementVisitor;
impl<'a> Visitor<'a> for FieldElementVisitor {
type Value = FieldElement;
fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
formatter.write_str("expected FieldElement")
}
fn visit_str<E>(self, value: &str) -> Result<FieldElement, E>
where
E: DError,
{
Ok(FieldElement::from_hex(value.to_string()).map_err(DError::custom)?)
}
}
deserializer.deserialize_str(FieldElementVisitor)
}
}
impl From<u8> for FieldElement {
fn from(x: u8) -> Self {
Self {
value: BigNum::new_int(x as isize),
}
}
}
impl From<u32> for FieldElement {
fn from(x: u32) -> Self {
Self {
value: BigNum::new_int(x as isize),
}
}
}
impl From<u64> for FieldElement {
fn from(x: u64) -> Self {
Self {
value: BigNum::new_int(x as isize),
}
}
}
impl From<i32> for FieldElement {
fn from(x: i32) -> Self {
Self {
value: BigNum::new_int(x as isize),
}
}
}
impl From<BigNum> for FieldElement {
fn from(x: BigNum) -> Self {
Self { value: x }
}
}
impl From<&[u8; MODBYTES]> for FieldElement {
fn from(x: &[u8; MODBYTES]) -> Self {
let mut n = BigNum::frombytes(x);
n.rmod(&CurveOrder);
Self { value: n }
}
}
impl PartialEq for FieldElement {
fn eq(&self, other: &FieldElement) -> bool {
BigNum::comp(&self.value, &other.value) == 0
}
}
impl PartialOrd for FieldElement {
fn partial_cmp(&self, other: &FieldElement) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl Eq for FieldElement {}
impl Ord for FieldElement {
fn cmp(&self, other: &FieldElement) -> Ordering {
match BigNum::comp(&self.value, &other.value) {
0 => Ordering::Equal,
-1 => Ordering::Less,
_ => Ordering::Greater,
}
}
}
impl Add for FieldElement {
type Output = Self;
fn add(self, other: Self) -> Self {
self.plus(&other)
}
}
impl Add<FieldElement> for &FieldElement {
type Output = FieldElement;
fn add(self, other: FieldElement) -> FieldElement {
self.plus(&other)
}
}
impl<'a> Add<&'a FieldElement> for FieldElement {
type Output = Self;
fn add(self, other: &'a FieldElement) -> Self {
self.plus(other)
}
}
impl<'a> Add<&'a FieldElement> for &FieldElement {
type Output = FieldElement;
fn add(self, other: &'a FieldElement) -> FieldElement {
self.plus(other)
}
}
impl AddAssign for FieldElement {
fn add_assign(&mut self, other: Self) {
self.add_assign_(&other)
}
}
impl<'a> AddAssign<&'a FieldElement> for FieldElement {
fn add_assign(&mut self, other: &'a FieldElement) {
self.add_assign_(other)
}
}
impl Sub for FieldElement {
type Output = Self;
fn sub(self, other: Self) -> Self {
self.minus(&other)
}
}
impl Sub<FieldElement> for &FieldElement {
type Output = FieldElement;
fn sub(self, other: FieldElement) -> FieldElement {
self.minus(&other)
}
}
impl<'a> Sub<&'a FieldElement> for FieldElement {
type Output = Self;
fn sub(self, other: &'a FieldElement) -> Self {
self.minus(&other)
}
}
impl<'a> Sub<&'a FieldElement> for &FieldElement {
type Output = FieldElement;
fn sub(self, other: &'a FieldElement) -> FieldElement {
self.minus(&other)
}
}
impl SubAssign for FieldElement {
fn sub_assign(&mut self, other: Self) {
self.sub_assign_(&other)
}
}
impl<'a> SubAssign<&'a FieldElement> for FieldElement {
fn sub_assign(&mut self, other: &'a Self) {
self.sub_assign_(other)
}
}
impl Mul for FieldElement {
type Output = Self;
fn mul(self, other: Self) -> Self {
self.multiply(&other)
}
}
impl Mul<FieldElement> for &FieldElement {
type Output = FieldElement;
fn mul(self, other: FieldElement) -> FieldElement {
self.multiply(&other)
}
}
impl<'a> Mul<&'a FieldElement> for FieldElement {
type Output = FieldElement;
fn mul(self, other: &'a FieldElement) -> FieldElement {
self.multiply(other)
}
}
impl<'a> Mul<&'a FieldElement> for &FieldElement {
type Output = FieldElement;
fn mul(self, other: &'a FieldElement) -> FieldElement {
self.multiply(other)
}
}
impl Neg for FieldElement {
type Output = Self;
fn neg(self) -> Self::Output {
self.negation()
}
}
impl Neg for &FieldElement {
type Output = FieldElement;
fn neg(self) -> Self::Output {
self.negation()
}
}
#[derive(Clone, Debug)]
pub struct FieldElementVector {
elems: Vec<FieldElement>,
}
impl FieldElementVector {
/// Creates a new field element vector with each element being 0
pub fn new(size: usize) -> Self {
Self {
elems: (0..size).map(|_| FieldElement::new()).collect(),
}
}
/// Generate a Vandermonde vector of field elements as:
/// FieldElementVector::new_vandermonde_vector(k, n) => vec![1, k, k^2, k^3, ... k^n-1]
/// FieldElementVector::new_vandermonde_vector(0, n) => vec![0, 0, ... n times]
pub fn new_vandermonde_vector(elem: &FieldElement, size: usize) -> Self {
if size == 0 {
Self::new(0)
} else if elem.is_zero() {
Self::new(size)
} else if elem.is_one() {
vec![FieldElement::one(); size].into()
} else {
let mut v = Vec::<FieldElement>::with_capacity(size);
v.push(FieldElement::one());
for i in 1..size {
v.push(&v[i-1] * elem);
}
v.into()
}
}
pub fn with_capacity(capacity: usize) -> Self {
Self {
elems: Vec::<FieldElement>::with_capacity(capacity),
}
}
/// Get a vector of random field elements
pub fn random(size: usize) -> Self {
(0..size)
.map(|_| FieldElement::random())
.collect::<Vec<FieldElement>>()
.into()
}
pub fn as_slice(&self) -> &[FieldElement] {
&self.elems
}
pub fn len(&self) -> usize {
self.elems.len()
}
pub fn push(&mut self, value: FieldElement) {
self.elems.push(value)
}
pub fn append(&mut self, other: &mut Self) {
self.elems.append(&mut other.elems)
}
/// Multiply each field element of the vector with another given field
/// element `n` (scale the vector)
pub fn scale(&mut self, n: &FieldElement) {
for i in 0..self.len() {
self[i] = self[i].multiply(n);
}
}
pub fn scaled_by(&self, n: &FieldElement) -> Self {
let mut scaled = Vec::<FieldElement>::with_capacity(self.len());
for i in 0..self.len() {
scaled.push(&self[i] * n)
}
scaled.into()
}
/// Add 2 vectors of field elements
pub fn plus(&self, b: &FieldElementVector) -> Result<FieldElementVector, ValueError> {
check_vector_size_for_equality!(self, b)?;
let mut sum_vector = FieldElementVector::with_capacity(self.len());
for i in 0..self.len() {
sum_vector.push(&self[i] + &b.elems[i])
}
Ok(sum_vector)
}
/// Subtract 2 vectors of field elements
pub fn minus(&self, b: &FieldElementVector) -> Result<FieldElementVector, ValueError> {
check_vector_size_for_equality!(self, b)?;
let mut diff_vector = FieldElementVector::with_capacity(self.len());
for i in 0..self.len() {
diff_vector.push(&self[i] - &b[i])
}
Ok(diff_vector)
}
/// Compute sum of all elements of a vector
pub fn sum(&self) -> FieldElement {
let mut accum = FieldElement::new();
for i in 0..self.len() {
accum += &self[i];
}
accum
}
/// Computes inner product of 2 vectors of field elements
/// [a1, a2, a3, ...field elements].[b1, b2, b3, ...field elements] = (a1*b1 + a2*b2 + a3*b3) % curve_order
pub fn inner_product(&self, b: &FieldElementVector) -> Result<FieldElement, ValueError> {
check_vector_size_for_equality!(self, b)?;
let mut accum = FieldElement::new();
for i in 0..self.len() {
accum += &self[i] * &b[i];
}
Ok(accum)
}
/// Calculates Hadamard product of 2 field element vectors.
/// Hadamard product of `a` and `b` = `a` o `b` = (a0 o b0, a1 o b1, ...).
/// Here `o` denotes multiply operation
pub fn hadamard_product(
&self,
b: &FieldElementVector,
) -> Result<FieldElementVector, ValueError> {
check_vector_size_for_equality!(self, b)?;
let mut hadamard_product = FieldElementVector::with_capacity(self.len());
for i in 0..self.len() {
hadamard_product.push(&self[i] * &b[i]);
}
Ok(hadamard_product)
}
pub fn split_at(&self, mid: usize) -> (Self, Self) {
let (l, r) = self.as_slice().split_at(mid);
(Self::from(l), Self::from(r))
}
pub fn iter(&self) -> Iter<FieldElement> {
self.as_slice().iter()
}
}
impl From<Vec<FieldElement>> for FieldElementVector {
fn from(x: Vec<FieldElement>) -> Self {
Self { elems: x }
}
}
impl From<&[FieldElement]> for FieldElementVector {
fn from(x: &[FieldElement]) -> Self {
Self { elems: x.to_vec() }
}
}
impl Index<usize> for FieldElementVector {
type Output = FieldElement;
fn index(&self, idx: usize) -> &FieldElement {
&self.elems[idx]
}
}
impl IndexMut<usize> for FieldElementVector {
fn index_mut(&mut self, idx: usize) -> &mut FieldElement {
&mut self.elems[idx]
}
}
impl PartialEq for FieldElementVector {
fn eq(&self, other: &Self) -> bool {
if self.len() != other.len() {
return false;
}
for i in 0..self.len() {
if self[i] != other[i] {
return false;
}
}
true
}
}
impl IntoIterator for FieldElementVector {
type Item = FieldElement;
type IntoIter = ::std::vec::IntoIter<FieldElement>;
fn into_iter(self) -> Self::IntoIter {
self.elems.into_iter()
}
}
// TODO: Implement add/sub/mul ops but need some way to handle error when vectors are of different length
pub fn multiply_row_vector_with_matrix(
vector: &FieldElementVector,
matrix: &Vec<FieldElementVector>,
) -> Result<FieldElementVector, ValueError> {
check_vector_size_for_equality!(vector, matrix)?;
let out_len = matrix[0].len();
let mut out = FieldElementVector::new(out_len);
for i in 0..out_len {
for j in 0..vector.len() {
out[i] += &vector[j] * &matrix[j][i];
}
}
Ok(out)
}
#[cfg(test)]
mod test {
use super::*;
use amcl::bls381::big::BIG;
use std::collections::{HashMap, HashSet};
use std::time::{Duration, Instant};
use serde_json;
#[test]
fn test_to_and_from_bytes() {
let mut rng = rand::thread_rng();
for _ in 0..100 {
let x = FieldElement::random_using_rng(&mut rng);
let mut bytes: [u8; MODBYTES] = [0; MODBYTES];
bytes.copy_from_slice(x.to_bytes().as_slice());
let y = FieldElement::from(&bytes);
assert_eq!(x, y)
}
}
#[test]
fn test_field_elem_multiplication() {
let a: FieldElement = 5u8.into();
let b: FieldElement = 18u8.into();
let c: FieldElement = 90u8.into();
assert_eq!(a.multiply(&b), c);
assert_eq!(a * b, c);
}
#[test]
fn test_inversion() {
assert_eq!(FieldElement::zero().inverse(), FieldElement::zero());
assert_eq!(FieldElement::one().inverse(), FieldElement::one());
let mut zero = FieldElement::zero();
zero.inverse_mut();
assert_eq!(zero, FieldElement::zero());
for _ in 0..10 {
let x = FieldElement::random();
let x_inv = x.inverse();
assert_eq!(x * x_inv, FieldElement::one())
}
}
#[test]
fn test_field_elements_inner_product() {
let a: FieldElementVector = vec![
FieldElement::from(5),
FieldElement::one(),
FieldElement::from(100),
FieldElement::zero(),
]
.into();
let b: FieldElementVector = vec![
FieldElement::from(18),
FieldElement::one(),
FieldElement::from(200),
FieldElement::zero(),
]
.into();
let c = FieldElement::from((90 + 1 + 200 * 100) as u32);
assert_eq!(a.inner_product(&b).unwrap(), c);
}
#[test]
fn test_field_elements_hadamard_product() {
let a: FieldElementVector = vec![
FieldElement::from(5),
FieldElement::one(),
FieldElement::from(100),
FieldElement::zero(),
]
.into();
let b: FieldElementVector = vec![
FieldElement::from(18),
FieldElement::one(),
FieldElement::from(200),
FieldElement::zero(),
]
.into();
let h: FieldElementVector = vec![
FieldElement::from(90),
FieldElement::one(),
FieldElement::from(200 * 100),
FieldElement::zero(),
]
.into();
let c = FieldElement::from((90 + 1 + 200 * 100) as u32);
assert_eq!(a.hadamard_product(&b).unwrap(), h);
assert_eq!(h.sum(), c);
}
#[test]
fn test_scale_field_element_vector() {
let a: FieldElementVector = vec![
FieldElement::from(5),
FieldElement::from(1),
FieldElement::from(100),
FieldElement::from(0),
]
.into();
let n = FieldElement::from(3);
let na = a.scaled_by(&n);
assert_eq!(na[0], FieldElement::from(5 * 3));
assert_eq!(na[1], FieldElement::from(1 * 3));
assert_eq!(na[2], FieldElement::from(100 * 3));
assert_eq!(na[3], FieldElement::from(0));
}