Security for computer networks: an introduction to data security in teleprocessing and electronic funds transfer
Can a fast signature scheme without secret key be secure?
Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
Hash-functions using modulo-N operations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
How to find and avoid collisions for the knapsack hash function
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Lattice Reduction by Random Sampling and Birthday Methods
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Lattice Basis Reduction with Dynamic Approximation
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
The State of Cryptographic Hash Functions
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Security Bounds for the Design of Code-Based Cryptosystems
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Attacking the Knudsen-Preneel compression functions
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Really fast syndrome-based hashing
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Faster and smoother: VSH revisited
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
How to improve rebound attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
New generic algorithms for hard knapsacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
| Hi-index | 0.00 |
Ivan Damgård [4] suggested at Crypto'89 concrete examples of hash functions among which a knapsack scheme. We will here show that a probabilistic algorithm can break this scheme with a number in the region of 232 computations. That number of operations is feasible in realistic time with modern computers. Thus the proposed hash function is not very secure. Among those computations a substantial number can be performed once for all. A faster result can be obtained since parallelism is easy. Moreover, ways to extend the present algorithm to other knapsacks than the present (256, 128) suggested by Damgård are investigated.