@@ -47,7 +47,7 @@ use crate::arithmetic::{
47
47
48
48
use core:: ops:: { Mul , MulAssign } ;
49
49
use elliptic_curve:: {
50
- ops:: { LinearCombination , MulByGenerator } ,
50
+ ops:: LinearCombination ,
51
51
scalar:: IsHigh ,
52
52
subtle:: { Choice , ConditionallySelectable , ConstantTimeEq } ,
53
53
} ;
@@ -386,16 +386,16 @@ fn precompute_gen_lookup_table() -> [LookupTable; 33] {
386
386
res
387
387
}
388
388
389
- impl MulByGenerator for ProjectivePoint {
389
+ impl ProjectivePoint {
390
390
/// Calculates `k * G`, where `G` is the generator.
391
391
#[ cfg( not( feature = "precomputed-tables" ) ) ]
392
- fn mul_by_generator ( k : & Scalar ) -> ProjectivePoint {
392
+ pub ( super ) fn mul_by_generator ( k : & Scalar ) -> ProjectivePoint {
393
393
ProjectivePoint :: GENERATOR * k
394
394
}
395
395
396
396
/// Calculates `k * G`, where `G` is the generator.
397
397
#[ cfg( feature = "precomputed-tables" ) ]
398
- fn mul_by_generator ( k : & Scalar ) -> ProjectivePoint {
398
+ pub ( super ) fn mul_by_generator ( k : & Scalar ) -> ProjectivePoint {
399
399
let digits = Radix16Decomposition :: < 65 > :: new ( k) ;
400
400
let table = * GEN_LOOKUP_TABLE ;
401
401
let mut acc = table[ 32 ] . select ( digits. 0 [ 64 ] ) ;
@@ -460,7 +460,6 @@ mod tests {
460
460
use crate :: arithmetic:: { ProjectivePoint , Scalar } ;
461
461
use elliptic_curve:: {
462
462
Field , Group ,
463
- ops:: MulByGenerator ,
464
463
rand_core:: { OsRng , TryRngCore } ,
465
464
} ;
466
465
0 commit comments