aes-ndlr 0.0.2

An implementation of AES
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

/// Adapted from https://en.wikipedia.org/wiki/Rijndael_MixColumns#Implementation_example
/// In the polynomial representation, multiplication in GF(2^8) (denoted by •) corresponds with the
/// multiplication of polynomials modulo an irreducible polynomial of degree 8. A polynomial is
/// irreducible if its only divisors are one and itself
pub fn multiply_in_g(polynomial_value: u8, state_value: u8) -> u8 {
    let irreducible_polynomial = 0x1b;
    let mut a = polynomial_value;
    let mut b = state_value;
    let mut p = 0;

    for _ in 0..8 {
        if (b & 1) != 0 {
            p ^= a;
        }

        let hi_bit_set = (a & (1 << 7)) != 0;
        a <<= 1;
        if hi_bit_set {
            a ^= irreducible_polynomial;
        }
        b >>= 1;
    }

    p
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn multiply_in_g_test() {
        struct TestCase {
            a: u8,
            b: u8,
            expected: u8,
        }
        let test_cases = vec![
            TestCase { a: 0x57, b: 0x83, expected: 0xc1 },
            TestCase { a: 0x57, b: 0x13, expected: 0xfe },
            TestCase { a: 0x57, b: 0x02, expected: 0xae },
            TestCase { a: 0x57, b: 0x04, expected: 0x47 },
            TestCase { a: 0x57, b: 0x08, expected: 0x8e },
            TestCase { a: 0x57, b: 0x10, expected: 0x07 }
        ];

        for case in test_cases.iter() {
            let result = multiply_in_g(case.a, case.b);
            assert_eq!(result, case.expected);
        }
    }
}