cryptopals/src/set5.rs

use crate::bytes::Bytes;
use crate::rsa;
use crate::sha1;
use num_bigint::BigUint;
use num_bigint::RandBigInt;
use num_bigint::ToBigUint;
use openssl::sha::sha256;
use rand::Rng;

mod challenge33 {
    use num_bigint::BigUint;
    use std::fs;

    pub fn load_large_prime() -> BigUint {
        let s = fs::read_to_string("data/33.txt").expect("run from git root dir");
        let b: Vec<u8> = s
            .chars()
            .filter(|c| *c != '\n')
            .map(|c| c.to_digit(16).unwrap().try_into().unwrap())
            .collect();
        BigUint::from_radix_be(&b, 16).unwrap()
    }
}

pub fn challenge33() {
    fn expmod(base: u32, exp: u32, m: u32) -> u32 {
        if exp == 0 {
            return 1;
        }

        if exp % 2 == 0 {
            let s = expmod(base, exp / 2, m);
            (s * s) % m
        } else {
            (expmod(base, exp - 1, m) * base) % m
        }
    }

    fn simple_diffie_hellman() {
        #![allow(non_snake_case)]
        let mut rng = rand::thread_rng();

        // Set a variable "p" to 37 and "g" to 5.
        let p: u32 = 37;
        let g: u32 = 5;

        // Generate "a", a random number mod 37. Now generate "A", which is "g" raised to the "a"
        // power mode 37 --- A = (g**a) % p.
        let a: u32 = rng.gen::<u32>() % p;
        let A = expmod(g, a, p);

        // Do the same for "b" and "B".
        let b: u32 = rng.gen::<u32>() % p;
        let B = expmod(g, b, p);

        // "A" and "B" are public keys. Generate a session key with them; set "s" to "B" raised to
        // the "a" power mod 37 --- s = (B**a) % p.
        let s = expmod(B, a, p);

        // Do the same with A**b, check that you come up with the same "s".
        let s_ = expmod(A, b, p);

        assert_eq!(s, s_, "crypto is broken");
        // To turn "s" into a key, you can just hash it to create 128 bits of key material (or
        // SHA256 it to create a key for encrypting and a key for a MAC).
    }

    fn serious_diffie_hellman() {
        let p = challenge33::load_large_prime();
        let g = 2_u8.to_biguint().unwrap();

        let a = rsa::Keypair::make(&p, &g);
        let b = rsa::Keypair::make(&p, &g);

        let s = b.public.0.modpow(&a.private.0, &p);
        let s_ = a.public.0.modpow(&b.private.0, &p);
        assert_eq!(s, s_, "crypto is broken");
    }

    simple_diffie_hellman();
    serious_diffie_hellman();
    println!("[okay] Challenge 33: implemented Diffie-Hellman");
}

mod challenge34 {
    use crate::bytes::Bytes;
    use crate::cbc;
    use crate::rsa;
    use crate::sha1::Sha1;
    use num_bigint::BigUint;

    pub struct Bot {
        p: BigUint,
        keypair: rsa::Keypair,
        pub s: Option<BigUint>,
        pub key: Option<Bytes>,
    }

    impl Bot {
        pub fn new(p: BigUint, g: &BigUint) -> Self {
            let keypair = rsa::Keypair::make(&p, g);
            Bot {
                p,
                keypair,
                s: None,
                key: None,
            }
        }

        pub fn get_public_key(&self) -> rsa::PublicKey {
            self.keypair.public.clone()
        }

        pub fn exchange_keys(&mut self, public: &rsa::PublicKey) -> rsa::PublicKey {
            let s = public.0.modpow(&self.keypair.private.0, &self.p);
            self.s = Some(s);
            self.make_encryption_key();
            self.keypair.public.clone()
        }

        fn make_encryption_key(&mut self) {
            assert!(self.s.is_some(), "keys have not been exchanged");
            if self.key.is_some() {
                return;
            }
            let mut sha1 = Sha1::default();
            let key = &sha1.hash(&Bytes(self.s.clone().unwrap().to_bytes_be())).0[0..16];
            self.key = Some(Bytes(key.to_vec()));
        }

        pub fn encrypt(&mut self, message: &Bytes) -> Bytes {
            assert!(self.key.is_some(), "keys have not been exchanged");

            const BLOCK_SIZE: usize = 16;
            let key = self.key.as_ref().unwrap();
            let mut iv = Bytes::random(16);
            let mut message = Bytes(message.0.clone());
            message.pad_pkcs7(BLOCK_SIZE);

            // AES-CBC(SHA1(s)[0:16], iv=random(16), msg) + iv
            let mut cipher = cbc::encrypt(key, &iv, &message).0;
            cipher.append(&mut iv.0);
            Bytes(cipher)
        }

        pub fn decrypt(&mut self, cipher: &Bytes) -> Bytes {
            const BLOCK_SIZE: usize = 16;
            assert!(self.key.is_some(), "keys have not been exchanged");

            let key = self.key.as_ref().unwrap();
            let cipher_len = cipher.len();

            let iv = Bytes(cipher.0[(cipher_len - BLOCK_SIZE)..cipher_len].to_vec());
            let cipher = Bytes(cipher.0[0..cipher_len - BLOCK_SIZE].to_vec());
            let mut message = cbc::decrypt(key, &iv, &cipher);
            message.remove_pkcs7(BLOCK_SIZE);
            message
        }
    }

    pub fn decrypt_with_s(cipher: &Bytes, s: &BigUint) -> Bytes {
        const BLOCK_SIZE: usize = 16;
        let mut sha1 = Sha1::default();
        let key = Bytes(sha1.hash(&Bytes(s.to_bytes_be())).0[0..16].to_vec());

        let cipher_len = cipher.len();
        let iv = Bytes(cipher.0[(cipher_len - BLOCK_SIZE)..cipher_len].to_vec());
        let cipher = Bytes(cipher.0[0..cipher_len - BLOCK_SIZE].to_vec());
        let mut message = cbc::decrypt(&key, &iv, &cipher);
        message.remove_pkcs7(BLOCK_SIZE);
        message
    }
}

pub fn challenge34() {
    fn echo() {
        let p = challenge33::load_large_prime();
        let g = 2_u8.to_biguint().unwrap();

        let mut a = challenge34::Bot::new(p.clone(), &g);

        // A->B: Send "p", "g", "A"
        let mut b = challenge34::Bot::new(p, &g);

        // B->A: Send "B"
        a.exchange_keys(&b.exchange_keys(&a.get_public_key()));
        assert_eq!(a.s, b.s, "crypto is broken");

        // A->B: Send AES-CBC(SHA1(s)[0:16], iv=random(16), msg) + iv
        let message_a = Bytes::from_utf8("Will this work? Let's make it longer.");
        let cipher_a = a.encrypt(&message_a);

        // B->A: Send AES-CBC(SHA1(s)[0:16], iv=random(16), A's msg) + iv
        let message_b = b.decrypt(&cipher_a);
        let cipher_b = b.encrypt(&message_b);
        let roundtrip = a.decrypt(&cipher_b);
        assert_eq!(message_a, roundtrip, "we broke it fam");
    }

    fn echo_mitm() {
        let p = challenge33::load_large_prime();
        let g = 2_u8.to_biguint().unwrap();
        let p_public = rsa::PublicKey(p.clone());

        // A->M Send "p", "g", "A"
        let mut a = challenge34::Bot::new(p.clone(), &g);
        let mut m = challenge34::Bot::new(p.clone(), &g);
        m.exchange_keys(&a.get_public_key());

        // M->B Send "p", "g", "p"
        // B->M Send "B"
        let mut b = challenge34::Bot::new(p, &g);
        b.exchange_keys(&p_public);

        // M->A Send "p"
        a.exchange_keys(&p_public);

        // A->M Send AES-CBC(SHA1(s)[0:16], iv=random(16), msg) + iv
        // M->B Relay that to B
        let message_a = Bytes::from_utf8("Will this work again? I don't doubt it.");
        let cipher_a = a.encrypt(&message_a);

        // B->M Send AES-CBC(SHA1(s)[0:16], iv=random(16), A's msg) + iv
        let message_b = b.decrypt(&cipher_a);
        let cipher_b = b.encrypt(&message_b);

        // M->A Relay that to A
        let roundtrip = a.decrypt(&cipher_b);
        assert_eq!(message_a, roundtrip, "we broke it fam");

        let restored_a = attack(&cipher_a);
        let restored_b = attack(&cipher_b);
        assert_eq!(message_a, restored_a, "attack didn't work");
        assert_eq!(message_b, restored_b, "attack didn't work");
    }

    fn attack(cipher: &Bytes) -> Bytes {
        // Do the DH math on this quickly to see what that does to the predictability of the key.
        // With p = A; s = (A ** b) % p becomes (p ** b) % p = 0 => s = 0
        let s = 0_u8.to_biguint().unwrap();
        challenge34::decrypt_with_s(cipher, &s)
    }

    echo();
    echo_mitm();
    println!("[okay] Challenge 34: implement MITM key-fixing attack on DH");
}

pub fn challenge35() {
    fn echo(message: &Bytes, g: &BigUint, p: &BigUint) -> (Bytes, Bytes) {
        let mut a = challenge34::Bot::new(p.clone(), g);
        let mut b = challenge34::Bot::new(p.clone(), g);
        a.exchange_keys(&b.exchange_keys(&a.get_public_key()));
        assert_eq!(a.s, b.s, "crypto is broken");

        let cipher_a = a.encrypt(message);
        let message_b = b.decrypt(&cipher_a);
        let cipher_b = b.encrypt(&message_b);
        let roundtrip = a.decrypt(&cipher_b);
        assert_eq!(*message, roundtrip, "we broke it fam");
        (cipher_a, cipher_b)
    }

    fn attack_g1(cipher: &Bytes) -> Bytes {
        // A = (g ** a) % p, g = 1 -> A = 1
        // s = (A ** b) % p, A = 1 -> s = 1
        let s = 1_u8.to_biguint().unwrap();
        challenge34::decrypt_with_s(cipher, &s)
    }

    fn attack_g_is_p(cipher: &Bytes) -> Bytes {
        // A = (g ** a) % p, g = p -> A = 0
        // s = (A ** b) % p, A = 0 -> s = 0
        let s = 0_u8.to_biguint().unwrap();
        challenge34::decrypt_with_s(cipher, &s)
    }

    fn attack_g_is_p_minus_one(cipher: &Bytes, p: &BigUint) -> Bytes {
        // A = (g ** a) % p, g = p - 1 -> A = 1 | (p - 1)
        // s = (A ** b) % p, A = 1 | (p - 1) -> s = 1 | (p - 1)
        let s1 = 1_u8.to_biguint().unwrap();
        let s2 = p - 1_u8.to_biguint().unwrap();
        let m1 = challenge34::decrypt_with_s(cipher, &s1);
        let m2 = challenge34::decrypt_with_s(cipher, &s2);

        match m1.ascii_score().cmp(&m2.ascii_score()) {
            std::cmp::Ordering::Greater => m1,
            std::cmp::Ordering::Less => m2,
            std::cmp::Ordering::Equal => panic!("how can they be equal?"),
        }
    }

    // Do the MITM attack again, but play with "g". Write attacks for each.
    let m = Bytes::from_utf8("Quick to the point, to the point, no faking");
    let p = challenge33::load_large_prime();
    let g = 2_u8.to_biguint().unwrap();
    echo(&m, &g, &p);

    // g = 1
    let g = 1_u8.to_biguint().unwrap();
    let (c1, c2) = echo(&m, &g, &p);
    assert_eq!(attack_g1(&c1), m, "failed to attack g = 1");
    assert_eq!(attack_g1(&c2), m, "failed to attack g = 1");

    // g = p
    let g = p.clone();
    let (c1, c2) = echo(&m, &g, &p);
    assert_eq!(attack_g_is_p(&c1), m, "failed to attack g = p");
    assert_eq!(attack_g_is_p(&c2), m, "failed to attack g = p");

    // g = p - 1
    let g = p.clone() - 1_u8.to_biguint().unwrap();
    let (c1, c2) = echo(&m, &g, &p);
    assert_eq!(attack_g_is_p_minus_one(&c1, &p), m, "failed g = p - 1");
    assert_eq!(attack_g_is_p_minus_one(&c2, &p), m, "failed g = p - 1");

    println!("[okay] Challenge 35: implement MITM with malicious g attack on DH");
}

pub fn challenge36() {
    let mut rng = rand::thread_rng();

    // C & S
    //    Agree on N=[NIST Prime], g=2, k=3, I (email), P (password)
    let n = challenge33::load_large_prime();
    let g = 2_u8.to_biguint().unwrap();
    let k = 3_u8.to_biguint().unwrap();
    let _i = Bytes::from_utf8("john1337@wayne.com");
    let p = Bytes::from_utf8("horse planet carpet country");

    // S
    //   Generate salt as random integer
    //   Generate string xH=SHA256(salt|password)
    //   Convert xH to integer x somehow (put 0x on hexdigest)
    //   Generate v=g**x % N
    //   Save everything but x, xH
    let salt: u32 = rng.gen();
    let mut salt_password = salt.to_be_bytes().to_vec();
    salt_password.append(&mut p.0.clone());
    let xh = sha256(&salt_password);
    let x = BigUint::from_bytes_be(xh[0..4].try_into().unwrap());
    let v = g.modpow(&x, &n);

    // C->S
    //   Send I, A=g**a % N (a la Diffie Hellman)
    let a = rng.gen_biguint_below(&n);
    let a_public = g.modpow(&a, &n);

    // S->C
    //   Send salt, B=kv + g**b % N
    let b = rng.gen_biguint_below(&n);
    let b_public = k.clone() * v.clone() + g.modpow(&b, &n);

    // S, C
    //   Compute string uH = SHA256(A|B), u = integer of uH
    let mut a_b = a_public.to_bytes_be();
    a_b.append(&mut b_public.to_bytes_be());
    let uh = sha256(&a_b);
    let u = BigUint::from_bytes_be(uh[0..4].try_into().unwrap());

    // C
    //   Generate string xH=SHA256(salt|password)
    //   Convert xH to integer x somehow (put 0x on hexdigest)
    //   Generate S = (B - k * g**x)**(a + u * x) % N
    //   Generate K = SHA256(S)
    let mut salt_password = salt.to_be_bytes().to_vec();
    salt_password.append(&mut p.0.clone());
    let xh = sha256(&salt_password);
    let x = BigUint::from_bytes_be(xh[0..4].try_into().unwrap());
    let s = (b_public - k * g.modpow(&x, &n)).modpow(&(a + &u * x), &n);
    let k_client = sha256(&s.to_bytes_be());

    // S
    //   Generate S = (A * v**u) ** b % N
    //   Generate K = SHA256(S)
    let s = (a_public * v.modpow(&u, &n)).modpow(&b, &n);
    let k_server = sha256(&s.to_bytes_be());

    assert_eq!(k_client, k_server);

    // I don't have HMAC-SHA256, so I will use HMAC-SHA1 instead.

    // C->S
    //   Send HMAC-SHA256(K, salt)
    let salt = Bytes(salt.to_be_bytes().to_vec());
    let mac_server = sha1::hmac_sha1(&Bytes(k_server.to_vec()), &salt);

    // S->C
    //   Send "OK" if HMAC-SHA256(K, salt) validates
    let mac_client = sha1::hmac_sha1(&Bytes(k_client.to_vec()), &salt);
    assert_eq!(mac_server, mac_client, "HMAC verification failed");

    println!("[okay] Challenge 36: implement secure remote password");
}

pub fn challenge37() {
    //  Get your SRP working in an actual client-server setting. "Log in" with a
    //  valid password using the protocol.

    // Now log in without your password by having the client send 0 as its "A"
    // value. What does this to the "S" value that both sides compute?

    // Now log in without your password by having the client send N, N*2, &c.
    println!("[xxxx] Challenge 37: TBD");
}