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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143

#![no_std]
extern crate generic_array;

use generic_array::typenum::{U8, U16, U32};
use generic_array::GenericArray;

use core::mem;

const C64: u64 = 0b1_1011;
const C128: u64 = 0b1000_0111;
const C256: u64 = 0b100_0010_0101;

/// Double and inverse double over GF(2^n). WARNING: block must be aligned!
///
/// This trait is implemented for 64, 128 and 256 bit block sizes. Big-endian
/// order is used.
pub trait Dbl {
    /// Double block. (alternatively: multiply block by x)
    ///
    /// If most significant bit of the block equals to zero will return
    /// `block<<1`, otherwise `(block<<1)^C`, where `C` is the non-leading
    /// coefficients of the lexicographically first irreducible degree-b binary
    /// polynomial with the minimal number of ones.
    fn dbl(self) -> Self;

    /// Reverse double block. (alternatively: divbide block by x)
    ///
    /// If least significant bit of the block equals to zero will return
    /// `block>>1`, otherwise `(block>>1)^(1<<n)^(C>>1)`
    fn inv_dbl(self) -> Self;
}

impl Dbl for GenericArray<u8, U8> {
    fn dbl(self) -> Self {
        let mut val: u64 = unsafe { mem::transmute(self) };
        val = val.to_be();
        let a = val >> 63;
        val <<= 1;
        val ^= a * C64;
        unsafe { mem::transmute(val.to_be()) }
    }

    fn inv_dbl(self) -> Self {
        let mut val: u64 = unsafe { mem::transmute(self) };
        val = val.to_be();

        let a = val & 1;
        val >>= 1;
        val ^= a*((1 << 63) ^ (C64 >> 1));

        unsafe { mem::transmute(val.to_be()) }
    }
}

#[inline(always)]
fn to_be(val: &mut [u64]) {
    for v in val.iter_mut() {
        *v = v.to_be();
    }
}

impl Dbl for GenericArray<u8, U16> {
    fn dbl(self) -> Self {
        let mut val: [u64; 2] = unsafe { mem::transmute(self) };
        to_be(&mut val);

        let b = val[1] >> 63;
        let a = val[0] >> 63;

        val[0] <<= 1;
        val[0] ^= b;
        val[1] <<= 1;
        val[1] ^= a*C128;

        to_be(&mut val);
        unsafe { mem::transmute(val) }
    }

    fn inv_dbl(self) -> Self {
        let mut val: [u64; 2] = unsafe { mem::transmute(self) };
        to_be(&mut val);

        let a = (val[0] & 1) << 63;
        let b = val[1] & 1;

        val[0] >>= 1;
        val[1] >>= 1;
        val[1] ^= a;
        val[0] ^= b*(1 << 63);
        val[1] ^= b*(C128 >> 1);

        to_be(&mut val);
        unsafe { mem::transmute(val) }
    }
}

impl Dbl for GenericArray<u8, U32> {
    fn dbl(self) -> Self {
        let mut val: [u64; 4] = unsafe { mem::transmute(self) };
        to_be(&mut val);

        let a = val[0] >> 63;
        let b = val[1] >> 63;
        let c = val[2] >> 63;
        let d = val[3] >> 63;

        val[0] <<= 1;
        val[0] ^= b;
        val[1] <<= 1;
        val[1] ^= c;
        val[2] <<= 1;
        val[2] ^= d;
        val[3] <<= 1;
        val[3] ^= a*C256;

        to_be(&mut val);
        unsafe { mem::transmute(val) }
    }

    fn inv_dbl(self) -> Self {
        let mut val: [u64; 4] = unsafe { mem::transmute(self) };
        to_be(&mut val);

        let a = (val[0] & 1) << 63;
        let b = (val[1] & 1) << 63;
        let c = (val[2] & 1) << 63;
        let d = val[3] & 1;

        val[0] >>= 1;
        val[1] >>= 1;
        val[2] >>= 1;
        val[3] >>= 1;
        val[1] ^= a;
        val[2] ^= b;
        val[3] ^= c;

        val[0] ^= d*(1 << 63);
        val[3] ^= d*(C256 >> 1);

        to_be(&mut val);
        unsafe { mem::transmute(val) }
    }
}