Cryptographically relevant contributions to combinational complexity theory

"The provability of certain cryptographic assumptions and, more generally, the existence of provable practical security is investigated. It is argued why combinatorial complexity is the complexity measure that is most suited if the security of practical crytographic applications is to be proved."--p. iii.