Modular exponentiation with Barrett reduction. Seems slow. :(

2018-06-18 12:04:11 -07:00
parent 011ebc0c99
commit b30fe6a75f
20 changed files with 66276 additions and 342 deletions
--- a/src/cryptonum/multiplication.rs
+++ b/src/cryptonum/multiplication.rs
@@ -9,7 +9,6 @@ pub trait ModMul<T=Self> {
 }

 // This is algorithm 14.12 from "Handbook of Applied Cryptography"
-#[inline(always)]
 pub fn raw_multiplication(x: &[u64], y: &[u64], w: &mut [u64])
 {
    assert_eq!(x.len(), y.len());
@@ -212,4 +211,4 @@ macro_rules! generate_tests {
    }
 }

-generate_tests!(U192, U256, U384, U512, U576, U1024, U2048, U3072, U4096, U8192, U15360);
+generate_tests!(U192, U256, U384, U512, U576, U1024, U2048, U3072, U4096, U8192, U15360);