Abstract
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.
Cite
CITATION STYLE
Lucks, S. (1995). How to exploit the intractability of exact TSP for cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1008, pp. 298–304). Springer Verlag. https://doi.org/10.1007/3-540-60590-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
