A practical attack against knapsack based hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 950, Issue , 1995, Pages 58-66

  Joux, Antoine ^a   Granboulan, Louis ^b  

^a DGA/CELAR   (France)

^b ENS/LIENS ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPRESSION FUNCTIONS; LATTICE REDUCTION;

HASH FUNCTIONS;

EID: 33646188704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053424     Document Type: Conference Paper

References (7)

1. P. Camion and J. Patarin. The knapsack hash-function proposed at crypto’89 can be broken. In D. W. Davies, editor, Advances in Cryptology, Proceedings of Euro-crypt ‘91, volume 547 of Lecture Notes in Computer Science, pages 39-53, New York, 1991. Springer-Verlag.
2. M. J. Costerr, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C.-P. Schnorr, and J. Stem. Subset sum algorithms. Comp. Complexity, 2:11-28, 1992.
3. I. Damgard. A design principle for hash functions. In Advances in Cryptology, Proceedings of Crypto’89, volume 435 of Lecture Notes in Computer Science, pages 25-37, New York, 1989. Springer-Verlag.
4. A. Joux and J. Stern. Lattice reduction: a toolbox for the cryptanalyst. submitted to the Journal of Cryptology, 1994.
5. J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. J. Assoc. Comp. Mach., 32(l):229-246, 1985.
6. A. K. Lenstra, H. W. Lenstra, and L. Lovasz. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
7. C.-P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. In L. Budach, editor, Proceedings of Fundamentals of Computation Theory 91, volume 529 of Lecture Notes in Computer Science, pages 68-85, New York, 1991. Springer-Verlag.