ir, An Identification Scheme based on Permuted Kernels (0)

by A Sham
Venue:in: Proc. Crypto '89, Springer LNCS 435
Add To MetaCart
Results 1 - 1 of 1

How to Exploit the Intractability of Exact TSP for Cryptography

by Stefan Lucks , 1994
"... 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. We prove that these constructions are secure if the XTSP is infeasible. Our constructions a ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
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. We prove that these constructions are secure if the XTSP is infeasible. Our constructions are easy to implement, appear to be fast, but require a large amount of memory.