cryptoxide 0.5.1

pure implementation of various common modern cryptographic algorithms, WASM compatible
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

pub(crate) struct GeneratorRaw(u64);

const MUL_FACTOR: u64 = 636_4136_2238_4679_3005;

impl GeneratorRaw {
    pub(crate) const fn new(seed: u64) -> Self {
        Self(seed)
    }

    pub fn next_u64(&mut self) -> u64 {
        let next = self.0.wrapping_add(102903).wrapping_mul(MUL_FACTOR);
        self.0 = next.wrapping_add(124);
        next
    }

    #[allow(unused)]
    pub fn array_u64<const N: usize>(&mut self) -> [u64; N] {
        let mut out = [0u64; N];
        for o in out.iter_mut() {
            *o = self.next_u64();
        }
        out
    }

    pub fn bytes<const N: usize>(&mut self) -> [u8; N] {
        let mut out = [0u8; N];
        for i in 0..N / 8 {
            let ofs = i * 8;
            let bytes = self.next_u64().to_be_bytes();
            out[ofs..ofs + 8].copy_from_slice(&bytes);
        }
        if N % 8 > 0 {
            let ofs = N / 8;
            let rem = N % 8;
            let bytes = self.next_u64().to_be_bytes();
            out[ofs..ofs + rem].copy_from_slice(&bytes[0..rem]);
        }
        out
    }
}

impl Iterator for GeneratorRaw {
    type Item = u64;

    fn next(&mut self) -> Option<Self::Item> {
        Some(self.next_u64())
    }
}

pub struct GeneratorOf<T> {
    testdrg: GeneratorRaw,
    remaining: usize,
    f: fn(&mut GeneratorRaw) -> T,
}

pub struct GeneratorOf2<T>(GeneratorOf<T>);
pub struct GeneratorOf3<T>(GeneratorOf<T>);

impl<T> GeneratorOf<T> {
    pub(crate) fn new(seed: u64, cases: usize, f: fn(&mut GeneratorRaw) -> T) -> Self {
        GeneratorOf {
            testdrg: GeneratorRaw::new(seed),
            remaining: cases,
            f,
        }
    }

    pub fn next_value(&mut self) -> T {
        (self.f)(&mut self.testdrg)
    }
}

impl<T> GeneratorOf2<T> {
    pub(crate) fn new(seed: u64, cases: usize, f: fn(&mut GeneratorRaw) -> T) -> Self {
        Self(GeneratorOf::new(seed, cases, f))
    }
}

impl<T> GeneratorOf3<T> {
    #[allow(unused)]
    pub(crate) fn new(seed: u64, cases: usize, f: fn(&mut GeneratorRaw) -> T) -> Self {
        Self(GeneratorOf::new(seed, cases, f))
    }
}

impl<T> Iterator for GeneratorOf<T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        if self.remaining == 0 {
            None
        } else {
            self.remaining -= 1;
            Some(self.next_value())
        }
    }
}

impl<T> Iterator for GeneratorOf2<T> {
    type Item = (T, T);

    #[allow(unused)]
    fn next(&mut self) -> Option<Self::Item> {
        if self.0.remaining == 0 {
            None
        } else {
            self.0.remaining -= 1;
            Some((self.0.next_value(), self.0.next_value()))
        }
    }
}

impl<T> Iterator for GeneratorOf3<T> {
    type Item = (T, T, T);

    fn next(&mut self) -> Option<Self::Item> {
        if self.0.remaining == 0 {
            None
        } else {
            self.0.remaining -= 1;
            Some((
                self.0.next_value(),
                self.0.next_value(),
                self.0.next_value(),
            ))
        }
    }
}

/*
fn next_fe(gen: &mut GeneratorRaw) -> Fe {
    let mut bytes = gen.bytes();
    bytes[0] &= 248;
    bytes[31] &= 127;
    bytes[31] |= 64;
    Fe::from_bytes(&bytes)
}
*/