4 ms·
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 prope
by vendiddy 1y ago
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.
- tgma 1y agoWhat you described is pretty much exactly how modern provable cryptography field works today. Reduction to assumptions about certain primitives and constructing the boundaries of security given such assumptions. E.g. "Assuming AES block cipher is a perfect pseudorandom function, prove AES-GCM construction is secure up to certain number of messages"