Attacking the chor-rivest cryptosystem by improved lattice reduction

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

Volumn 921, Issue , 1995, Pages 1-12

  Schnorr, C P ^a   Horner, H H ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HASH FUNCTIONS;

CHOR-RIVEST CRYPTOSYSTEM; GRAM-SCHMIDT; LATTICE BASIS REDUCTION; LATTICE REDUCTION; LATTICE VECTORS; POSITIVE PROBABILITY; RANDOM SUBSETS;

CRYPTOGRAPHY;

EID: 0009452048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49264-X_1     Document Type: Conference Paper

References (15)

1. M.J. Coster, A. Joux, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr and J. Stern: Improved Low-Density Subset, Sum Algorithms; comput. complexity 2, Birkhauser-Verlag Base1 (1992), 11 1-128
2. B. Chor and R.L. Rivest: A knapsack-type public key cryptosystem based on arithmetic in finite fields; IEEE Trans. Inform. Theory, vol IT-34 (1988), 901-909.
3. I. B. DamgLrd: A Design Principle for Hash Functions; Advances in Cryptology, Proc. Crypto 89, Springer LNCS 435 (1990), 416-427.
4. H.H. Hörner: Verbesserte Gitterbasenreduktion; getestet arri Chor-IhvesKt ryptosystern und an allgemeinen Rucksack-Problcmen. Diplomarbeit, Universitat Frankfurt (August 1994).
5. A. Joux and L. Granboulan: A Practical Attack against Knapsack based Hash Functions; Prodeedings EUROCRYPT’94, Springer LNCS (1994).
6. A. Joux and J. Stern: Lattice Reduction: a Toolbox for the Cryptanalyst, TR DGA/CELAR, ENS (1994).
7. R. Kannan: Minkowski’s convex body theorem and integer programming; Math. Oper. Res. 12 (1987), 415-440.
8. M. Kaib and H. Ritter: Block Reduction with Respect to Arbitrary Norms; TRU. Frankfurt (1994).
9. J.C. Lagarias and A.M. Odlyzko: Solving low-density subset sum problems; J. Assoc. Comp. Mach. 32(1) (1985), 229-246.
10. A.K. Lenstra, H.W. Lenstra Jr. and L. Lovbsz: Factoring polynomials with rational coefficients; Math. Ann. 261 (1982), 515-534.
11. J.E. Mazo and A.M. Odlyzko: Lattice Points in high-dimensional spheres; Monatsh. Math. 110 (1990), 47-61.
12. S. Radziszowski and D. Kreher: Solving subset sum problems with the L3 algorithm; J. Combin. Math. Combin. Comput. 3 (1988), 49-63.
13. C.P. Schnorr: A hierarchy of polynomial time lattice basis reduction algorithms; Theoretical Computer Science 53 (1987), 201-224.
14. C.P. Schnorr: Block reduced lattice bases and successive minima; Combinatorics, Probability and Computing 3 (1994), 507-522.
15. C.P. Schnorr and M. Euchner: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems; Mathematical Programming 66 (1994), 181-199.