cryptoys 0.1.1

a cryptographic library filled with cryptographic toys(mostly historical ciphers)
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116

//! Affine cipher
//! ## Warning
//! Please keep in mind that this function only encrypts and decrypts using the given values.
//! There are no checks implemented wether these values are correct.
//! E.g. there is no check to verify that a and m are coprime.
//! If there is any interrest, then such checks might be implemented in the future.

use crate::utils::{find_key_for_value, text_preprocessor};
use crate::Solve;
use modinverse::modinverse;
use std::collections::HashMap;

pub struct AffineCiphertext {
    ciphertext: String,
    a: i32,
    b: i32,
}

/// solves a AffineCiphertext
impl Solve for AffineCiphertext {
    fn solve(&self) -> String {
        decrypt(self.a, self.b, &self.ciphertext)
    }
}

impl ToString for AffineCiphertext {
    fn to_string(&self) -> String {
        self.ciphertext.to_string()
    }
}

/// Encrypts plaintext using the affine cipher with given numbers a and b
/// <br>
/// Note that a and b need to be coprime.
/// # Example
/// ```
/// use cryptoys::historical::affine;
/// let encrypted = affine::encrypt(5, 8, "AFFINE cipher");
/// assert_eq!("IHHWVCSWFRCP".to_string(), encrypted.to_string())
/// ```
pub fn encrypt(a: i32, b: i32, plaintext: &str) -> AffineCiphertext {
    let plaintext = text_preprocessor(plaintext);

    // map every letter of the alphabet to a number
    let mut alphabet: HashMap<char, i32> = HashMap::new();
    let alph = "abcdefghijklmnopqrstuvwxyz ";
    for (index, c) in alph.chars().enumerate() {
        alphabet.insert(c, index.try_into().unwrap());
    }

    // find the value(number) for every char in plaintext
    let text_values: Vec<i32> = plaintext
        .chars()
        .map(|pc| *(alphabet.get(&pc).unwrap()))
        .collect();

    for i in 0..plaintext.len() {
        let _math: i32 = (a * i as i32 + b) % plaintext.len() as i32;
    }

    // apply encryption function to values from plaintext
    let text_values: Vec<i32> = text_values
        .iter()
        .map(|value| (a * value + b) % 26)
        .collect();

    // get chars corresponding to new text values
    let new_value: Vec<char> = text_values
        .iter()
        .map(|val| find_key_for_value(&alphabet, *val))
        .collect();

    let ciphertext = new_value.into_iter().collect::<String>().to_uppercase();
    AffineCiphertext { ciphertext, a, b }
}

/// Decrypts ciphertext encrypted with the affine cipher
/// # Example
/// ```
/// use cryptoys::historical::affine;
/// let decryption = affine::decrypt(5, 8,"IHHWVCSWFRCP");
/// assert_eq!("AFFINECIPHER", decryption)
/// ```
pub fn decrypt(a: i32, b: i32, ciphertext: &str) -> String {
    let ciphertext = text_preprocessor(ciphertext);
    let a_modinverse = modinverse(a, 26).unwrap();

    // map every letter of the alphabet to a number
    let mut alphabet: HashMap<char, i32> = HashMap::new();
    let alph = "abcdefghijklmnopqrstuvwxyz";
    let mut index = 0;
    for c in alph.chars() {
        alphabet.insert(c, index);
        index += 1;
    }

    // find the value(number) for every char in ciphertext
    let text_values: Vec<i32> = ciphertext
        .chars()
        .map(|pc| *(alphabet.get(&pc).unwrap()))
        .collect();

    // apply decryption function to values from ciphertext
    let text_values: Vec<i32> = text_values
        .iter()
        .map(|value| ((a_modinverse * (value - b) % 26 + 26) % 26))
        .collect();

    // get chars corresponding to new text values
    let new_value: Vec<char> = text_values
        .iter()
        .map(|val| find_key_for_value(&alphabet, *val))
        .collect();

    new_value.into_iter().collect::<String>().to_uppercase()
}