Cryptographically relevant contributions to combinational complexity theory
By: Alain P.L. Hiltgen
Contributors: Eidgenössische Technische Hochschule Zürich.
Edition: 1. Aufl.
Series: ETH series in information processing,; v. 3
Publisher: Hartung-Gorre Verlag
Published: 1994
Place of publication: Konstanz
Language: eng
Number of pages: 129
Subjects: Computer security.; Data encryption (Computer science)
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.
Notes: Abstract in German and English.
Includes bibliographical references (p. 117-125) and index.
"Nachdruck der Diss. ETH Nr. 10382--T. p. verso.