How to Exploit the Intractability of Exact TSP for Cryptography

How to Exploit the Intractability of Exact TSP for Cryptography (1994)

by Stefan Lucks

Citations:

2 - 1 self

53	Set Reconciliation with Nearly Optimal Communication Complexity – Yaron Minsky, Ari Trachtenberg, Richard Zippel - 2000
131	Provably secure and practical identification schemes and corresponding signature schemes – Tatsuaki Okamoto - 1993
91	How to prove a theorem so no one else can claim it – Manuel Blum - 1987
3	Improved algorithms for the permuted kernel prolem – J Patarin, P Chauvaud - 1994
1	A Certified Digital Signature (That Antique Paper from 1979 – R C Merkle
1	private communication – S Thienel - 1995
22	On the length of cryptographic hash-values used in identification schemes – M Girault, J Stern - 1994
24	A New Identification Scheme Based on the Perceptrons Problem – David Pointcheval - 1995
36	An Efficient Identification Scheme Based on Permuted Kernels – A Shamir - 1990
19	Designing Identification Schemes with Keys of Short Size – Jacques Stern - 1994
4	G.:‘Provably good solutions for the traveling salesman problem – M Jünger, S Thienel, Reinelt - 1994
50	A New Identification Scheme Based on Syndrome Decoding – Jacques Stern - 1994
285	The Traveling Salesman Problem – E L Lawler, J K Lenstra, A H - 1985
133	A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems – M Padberg, G Rinaldi - 1991
231	A design principle for hash functions – I Damgård - 1989