Can't someone learn this stuff with the assumption that certain functions are hard to invert?
Like assuming f(x) is hard, let us try to prove these other properties of security.
Like assuming f(x) is hard, let us try to prove these other properties of security.
E.g. "Assuming AES block cipher is a perfect pseudorandom function, prove AES-GCM construction is secure up to certain number of messages"