CSE 130 Lecture Notes - Lecture 17: Cryptographic Hash Function, Short Circuit, Scrypt
9 Mar 2018
School
Department
Course
Professor
Document Summary
Laws: return x >>= f = f x, m >>= return = m, m >>= (\x -> k x >>= h) = (m >>= k) >>= h do (m. In do notation: do x > putstr s = putstr (r ++ s) Instance monday maybe where return :: a -> maybe a return x = just x (>>=) :: maybe a -> (a -> maybe b) -> maybe b act 1 (>>=) k = case act 1 of. What"s wrong with saying that the password is incorrect? well you just typed a garbage password and exposed to whom the email belongs. //reply sorry dunno this doesn"t do any hashing! //reply sorry dunno this takes time to hash! Pre-image resistant: given an output, cannot find an input s. t. hash(input) = output.
