add factorization attack on RSA

.github/workflows/linux-tests-stable-rust.yml

@@ -1,4 +1,4 @@
-name: Linux Tests
+name: Linux Tests On Stable Rust
 on: [push]
 
 jobs:

cryptatools-core/Cargo.toml

@@ -17,10 +17,17 @@ itertools = "*"
 uniffi_bindgen = "*"
 time = "*"
 rand = "*"
-num-bigint = "*"
 num-traits = "*"
 num = "*"
 num-bigfloat = "*"
+num-bigint = { version = "*", features = [] } #"prime", "rand"
+num-bigint-dig = { version = "*", features = ["prime", "rand"], default-features=false }
+num-integer = "*"
+
+indicatif = { version = "0.17", optional = true }
+primal = "0.3"
+thiserror = "1"
+
 
 [build-dependencies]
 uniffi = {version = "*", features = [ "build", "cli" ]}

cryptatools-core/src/cryptanalysis/common/rsa/mod.rs

@@ -1 +1,2 @@
-pub mod common_modulus_attack;
+pub mod common_modulus_attack;
+pub mod public_exponent_attack;

cryptatools-core/src/cryptanalysis/common/rsa/public_exponent_attack.rs

@@ -0,0 +1,57 @@
+use std::sync::Arc;
+use num_traits;
+
+use num_bigint::{BigUint, BigInt, ToBigInt};
+use num_bigint_dig::ModInverse;
+use num_bigint_dig::prime::probably_prime;
+//use num_bigint_dig::ToBigInt;
+use num_bigint_dig::RandBigInt;
+use num_traits::Pow;
+use num_integer::Integer;
+
+use num::FromPrimitive;
+use num::ToPrimitive;
+use std::str::FromStr;
+
+use crate::utils::alphabets::Alphabet;
+use crate::maths::factorization;
+use crate::utils::convert::Encode;
+
+pub struct modulo_factorisation_attack {
+    alphabet: Arc<Alphabet>,
+}
+
+impl modulo_factorisation_attack {
+    pub fn new(alphabet: Arc<Alphabet>) -> Self {
+        modulo_factorisation_attack {
+            alphabet
+        }
+    }
+
+    pub fn modulo_factorisation_attack(cipher_text: Vec<u8>, modulo: Vec<u8>, exponent: Vec<u8>) -> u128 {
+        /// ```
+        /// use cryptatools_core::cryptanalysis::common::rsa::public_exponent_attack::{*};
+        /// //742449129124467073921545687640895127535705902454369756401331
+        /// 
+        /// 
+        /// let mut plaintext = modulo_factorisation_attack(vec![], vec![], vec![]);
+        /// let ascii: String = convert::Decode::from_u8_to_ascii(plaintext);
+        /// assert_eq!(ascii, "crypto{N33d_b1g_pR1m35}");
+        /// ```
+
+        let mut cipher = BigInt::from_u64(3); //BigUint::new(cipher_text);
+        let mut modulo = BigInt::from_i64(-1); //BigUint::new(modulo);
+        let mut exponent = BigInt::from_str("742449129124467073921545687639156049064283454870081476956200");//BigUint::new(exponent);
+
+
+        let vec = factorization::Factorization::factor(exponent.clone().unwrap());
+        let p = &vec[0];
+        let q = &vec[1];
+
+        let phi = p.to_bigint().unwrap()-BigInt::from_u64(1).unwrap()*(q.to_bigint().unwrap()-BigInt::from_u64(1).unwrap());
+
+        let dec = exponent.clone().unwrap().modpow(&BigInt::from_i64(-1).unwrap(), &phi);
+
+        return (cipher.unwrap().modpow(&BigInt::from_str("39207274348578481322317340648475596807303160111338236677373").unwrap(), &dec) % modulo.unwrap()).to_u128().unwrap();
+    }
+}

cryptatools-core/src/lib.rs

@@ -1,6 +1,7 @@
 pub mod cryptanalysis;
 pub mod cryptography;
 pub mod utils;
+pub mod maths;
 
 use crate::utils::alphabets::{Encoding, Alphabet, split_bytes_by_characters_representation, uniffy_opcode_group};
 use crate::cryptography::classical::encryption::monoalphabetic_ciphers::caesar_number::CaesarNumberAlgorithm;

cryptatools-core/src/maths/factorization.rs

@@ -0,0 +1,38 @@
+use num_bigint::BigUint;
+use num_bigint::BigInt;
+use num::FromPrimitive;
+
+pub struct Factorization {
+
+}
+
+impl Factorization {
+  pub fn factor(n_input: BigInt) -> Vec<BigInt> {
+    /// ```
+    /// use cryptatools_core::maths::factorization;
+    /// use num_bigint::BigUint;
+    /// 
+    /// let mut factor = factorization::factor(742449129124467073921545687640895127535705902454369756401331);
+    /// assert_eq!(factor, vec![123]);
+    ///
+    /// ```
+
+    let mut factors = vec![];
+    let mut divisor = 2;
+
+
+    let mut n_input = n_input;
+    while n_input >= BigInt::from_u8(2).unwrap() {
+        if n_input.clone() % divisor == BigInt::from_u8(0).unwrap() {
+          factors.push(BigInt::from(divisor));
+          n_input = n_input / divisor;
+        } else {
+          divisor += 1;
+        }
+      }
+
+      factors
+    }
+}
+
+

cryptatools-core/src/maths/mod.rs

@@ -0,0 +1 @@
+pub mod factorization;