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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Baritaud, M. Campana, P. Chauvaud, H. Gilbert, On the security of the Permuted Kernel Identification Scheme, in: Proc. Crypto '92, Springer LNCS 760, 305–311.
P. Camion, J. Patarin, The Knapsack Hash Function proposed at Crypto '89 can be broken, in: Proc. EuroCrypt '91, Springer LNCS 547, 39–53.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
I. Damgård, Design Principles for Hash Functions, in: Proc. Crypto '89, Springer LNCS 435, 416–427.
J. Georgiades, Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels, in: J. Cryptology (1992), Vol. 5, 133–137.
R. Impagliazzo, M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, in: Proc. FOCS '89, 236–241.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys (eds.), Tie Traveling Salesman Problem, Wiley, 1985.
R. C. Merkle, M. Hellman, Hiding information and Signature in Trapdoor Knapsack, in: IEEE Trans. on Inf. Theory 24 (1978), 525–530.
M. Naor, M. Yung, Universal One Way Hash Functions and Their Cryptographic Applications, in: Proc. STOC '89, 33–43.
M. Padberg, G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, in: Siam Review 33, No. 1 (1991), 60–100.
J. Patarin, P. Chauvaud Improved Algorithms for the Permuted Kernel Problem, in: Proc. Crypto '93, Springer LNCS 773, 391–402.
C. P. Schnorr, M. Euchner, Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems, in: Proc. FCT '91, 68–85.
A. Shamir, An Identification Scheme based on Permuted Kernels, in: Proc. Crypto '89, Springer LNCS 435, 606–609.
J. Stern, A new identification scheme based on syndrome decoding, in: Proc. Crypto '93, Springer LNCS 773, 13–20.
J. Stern, Designing Identification Schemes with Keys of Short Size. in: Proc. Crypto '94, Springer LNCS 839, 164–173.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucks, S. (1995). How to exploit the intractability of exact TSP for cryptography. In: Preneel, B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60590-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-60590-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60590-4
Online ISBN: 978-3-540-47809-6
eBook Packages: Springer Book Archive