fn insecure_compare(l: &[u8], r: &[u8]) -> bool {
    if l.len() != r.len() {
        return false;
    }

    for (x, y) in l.iter().zip(r.iter()) {
        if x != y {
            return false;
        }

        // For problem 32 we would need to make som adjustments.
        // to make it work
        std::thread::sleep(std::time::Duration::from_millis(30));
    }

    true
}
/// insecure_compare compare two byte slices for equality
///
///  Solution for problem 7 from set4: <https://cryptopals.com/sets/4/challenges/31>
insecure_compare compare two byte slices for equality
Solution for problem 7 from set4.
insecure_compare compare two byte slices for equality Solution for problem 7 from set4 .
fn insecure_compare(l: &[u8], r: &[u8]) -> bool {
    if l.len() != r.len() {
        return false;
    }
    for (x, y) in l.iter().zip(r.iter()) {
        if x != y {
            return false;
        }
        // For problem 32 we would need to make som adjustments.
        // to make it work
        std::thread::sleep(std::time::Duration::from_millis(30));
    }
    true
}
fn insecure_compare ( l : & [ u8 ] , r : & [ u8 ] ) -> bool { if l . len ( ) != r . len ( ) { return false ; } for ( x , y ) in l . iter ( ) . zip ( r . iter ( ) ) { if x != y { return false ; } // For problem 32 we would need to make som adjustments. // to make it work std :: thread :: sleep ( std :: time :: Duration :: from_millis ( 30 ) ) ; } true }
insecure_compare compare two byte slices for equality
Solution for problem 7 from set4: <https://cryptopals.com/sets/4/challenges/31>
insecure_compare compare two byte slices for equality Solution for problem 7 from set4 : <https : // cryptopals . com / sets / 4 / challenges / 31 >
l
&[u8]
r
&[u8]