feat(repr): switch internal representation to Affine

benches/bench.rs

@@ -436,10 +436,10 @@ mod public_key_benches {
                 let mut msg = [0u8; 1000];
                 rng.fill_bytes(&mut msg);
                 let hash = hash_g2(&msg);
-                let sig = sk.sign_g2(&hash);
+                let sig = sk.sign_g2(hash);
                 (pk, hash, sig)
             };
-            b.iter_with_setup(rand_factors, |(pk, hash, sig)| pk.verify_g2(&sig, &hash));
+            b.iter_with_setup(rand_factors, |(pk, hash, sig)| pk.verify_g2(&sig, hash));
         });
     }
 
@@ -515,7 +515,7 @@ mod secret_key_benches {
                 let hash = hash_g2(&msg);
                 (sk, hash)
             };
-            b.iter_with_setup(rand_factors, |(sk, hash)| sk.sign_g2(&hash));
+            b.iter_with_setup(rand_factors, |(sk, hash)| sk.sign_g2(hash));
         });
     }
 
@@ -531,7 +531,7 @@ mod secret_key_benches {
                 let hash = hash_g2(&msg);
                 (sk, hash)
             };
-            b.iter_with_setup(rand_factors, |(sk, hash)| sk.sign_g2(&hash));
+            b.iter_with_setup(rand_factors, |(sk, hash)| sk.sign_g2(hash));
         });
     }
 

src/cmp_pairing.rs

@@ -1,10 +1,10 @@
 use std::cmp::Ordering;
 
-use group::{prime::PrimeCurve, GroupEncoding};
+use group::prime::PrimeCurveAffine;
 
 /// Compares two curve elements and returns their `Ordering`.
-pub fn cmp_projective<G: PrimeCurve>(x: &G, y: &G) -> Ordering {
-    let xc = x.to_affine().to_bytes();
-    let yc = y.to_affine().to_bytes();
+pub fn cmp_affine<G: PrimeCurveAffine>(x: &G, y: &G) -> Ordering {
+    let xc = x.to_bytes();
+    let yc = y.to_bytes();
     xc.as_ref().cmp(yc.as_ref())
 }