How to exploit the intractability of exact TSP for cryptography | springerprofessional.de

Springer Professional

nach oben

Erschienen in:

Kapitel lesen Erstes Kapitel lesen

1995 | ReviewPaper | Buchkapitel

How to exploit the intractability of exact TSP for cryptography

verfasst von : Stefan Lucks

Erschienen in: Fast Software Encryption

Verlag: Springer Berlin Heidelberg

Enthalten in: Professional Book Archive

Zugang erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriges Kapitel On the need for multipermutations: Cryptanalysis of MD4 and SAFER

Nächstes Kapitel How to reverse engineer an EES device

Titel: How to exploit the intractability of exact TSP for cryptography
verfasst von: Stefan Lucks
Verlag: Springer Berlin Heidelberg
Buch: Fast Software Encryption
Print ISBN: 978-3-540-60590-4

Electronic ISBN: 978-3-540-47809-6

Copyright-Jahr: 1995
DOI: https://doi.org/10.1007/3-540-60590-8_23

Springer Professional

Premium Partner