Title: Cryptographically relevant contributions to combinational complexity theory
First published: 1994
Description: "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.
Subjects: Data encryption (Computer science), Computer security
LC classification: QA76.9.A25 H55 1994