rsacracker 0.9.1

Powerful RSA cracker for CTFs. Supports RSA, X509, OPENSSH, PKCS#12, PKCS#7, and CSR in PEM and DER formats.
Documentation 
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

use indicatif::ProgressBar;
use rug::{integer::IsPrime, Integer};

use crate::{Attack, AttackKind, AttackSpeed, Error, KeyError, Parameters, Solution};

/// N is a prime modulus attack
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct PrimeModulusAttack;

impl Attack for PrimeModulusAttack {
    fn name(&self) -> &'static str {
        "prime_modulus"
    }

    fn speed(&self) -> AttackSpeed {
        AttackSpeed::Fast
    }

    fn kind(&self) -> AttackKind {
        AttackKind::KnownExtraInformation
    }

    fn run(&self, params: &Parameters, _pb: Option<&ProgressBar>) -> Result<Solution, Error> {
        if let (Some(n), Some(c)) = (&params.n, &params.c) {
            if n.is_probably_prime(100) == IsPrime::No {
                return Err(Error::NotFound);
            }

            let d = params
                .e
                .clone()
                .invert(&(n - Integer::from(1)))
                .or(Err(KeyError::PrivateExponentComputationFailed))?;
            let m = c.clone().pow_mod(&d, n).unwrap();

            return Ok(Solution::new_m(self.name(), m));
        }

        Err(Error::MissingParameters)
    }
}