pub fn decode_u32_online(self, hashmap: &DecodeU32Precomputation) -> Option<u32> {
        // iterator for 0G, -1G, -2G, ...
        let ristretto_iter = RistrettoIterator::new(self.target, -self.generator);

        let mut decoded = None;
        ristretto_iter.zip(0..TWO14).for_each(|(elem, x_lo)| {
            let key = elem.compress().to_bytes();
            if hashmap.0.contains_key(&key) {
                let x_hi = hashmap.0[&key];
                decoded = Some(x_lo + TWO14 * x_hi);
            }
        });
        decoded
    }
/// Solves the discrete log instance using the pre-computed HashMap by enumerating through 2^14
/// possible solutions
Solves the discrete log instance using the pre-computed HashMap by enumerating through 2^14
possible solutions
Solves the discrete log instance using the pre - computed HashMap by enumerating through 2^14 possible solutions
pub fn decode_u32_online(self, hashmap: &DecodeU32Precomputation) -> Option<u32> {
        // iterator for 0G, -1G, -2G, ...
        let ristretto_iter = RistrettoIterator::new(self.target, -self.generator);
        let mut decoded = None;
        ristretto_iter.zip(0..TWO14).for_each(|(elem, x_lo)| {
            let key = elem.compress().to_bytes();
            if hashmap.0.contains_key(&key) {
                let x_hi = hashmap.0[&key];
                decoded = Some(x_lo + TWO14 * x_hi);
            }
        });
        decoded
    }
pub fn decode_u32_online ( self , hashmap : & DecodeU32Precomputation ) -> Option < u32 > { // iterator for 0G, -1G, -2G, ... let ristretto_iter = RistrettoIterator :: new ( self . target , - self . generator ) ; let mut decoded = None ; ristretto_iter . zip ( 0 .. TWO14 ) . for_each ( | ( elem , x_lo ) | { let key = elem . compress ( ) . to_bytes ( ) ; if hashmap . 0 . contains_key ( & key ) { let x_hi = hashmap . 0 [ & key ] ; decoded = Some ( x_lo + TWO14 * x_hi ) ; } } ) ; decoded }
Solves the discrete log instance using the pre-computed HashMap by enumerating through 2^14
possible solutions
Solves the discrete log instance using the pre - computed HashMap by enumerating through 2^14 possible solutions
self
hashmap
&DecodeU32Precomputation