4 Result(s)
within
Stefan Lucks
Combinatorics
-
Chapter and Conference Paper
Open key exchange: How to defeat dictionary attacks without encrypting public keys
Classical cryptographic protocols based on shared secret keys often are vulnerable to key-guessing attacks. For security, the keys must be strong, difficult to memorize for humans. Bellovin and Merritt [4] pro...
-
Chapter and Conference Paper
Faster Luby-Rackoff ciphers
This paper deals with a generalization of Luby's and Rackoff's results [9] on the construction of block ciphers and their consequences for block cipher implementations. Based on dedicated hash functions, block...
-
Chapter and Conference Paper
How to exploit the intractability of exact TSP for cryptography
We outline constructions for both pseudo-random generators and one-way hash functions. These constructions are based on the exact TSP (XTSP), a special variant of the well known traveling salesperson problem. ...
-
Chapter and Conference Paper
How traveling salespersons prove their identity
In this paper a new identification protocol is proposed. Its security is based on the Exact Traveling Salesperson Problem (XTSP). The XTSP is a close relative of the famous TSP and consists of finding a Hamiltoni...
