Generalized compact knapsacks are collision resistant

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

Volumn 4052 LNCS, Issue , 2006, Pages 144-155

  Lyubashevsky, Vadim ^a   Micciancio, Daniele ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION AVOIDANCE; FUNCTION EVALUATION; LATTICE CONSTANTS; MATHEMATICAL MODELS; NUMBER THEORY;

COLLISION RESISTANT; CYCLIC LATTICES; WORST-CASE PROBLEMS;

PROBLEM SOLVING;

EID: 33746342484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_13     Document Type: Conference Paper

References (24)

1. D. Aharonov and O. Regev. Lattice problems in NP coNP. Journal of the ACM, 52(5)=749-765, 2005.
2. M. Ajtai. Generating hard instances of lattice problems. In STOC, pages 99-108, 1996.
3. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In STOC, pages 601-610, 2001.
4. E. Biham, R. Chen, A. Joux, P. Carribault, W. Jalby, and C. Lemuet. Collisions of SHA-0 and reduced SHA-1. In EUROCRYPT, 2005.
5. J. Cai and A. Nerurkar. An improved worst-case to average-case connection for lattice problems. In FOCS, pages 468-477, 1997.
6. B. Chor and R. L. Rivest. A knapsack type public-key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory, 34(5):901-909, 1988.
7. I. Damgard. A design principle for hash functions. In CRYPTO '89, pages 416-427.
8. I. Dinur. Approximating SVP∞ to within almost-polynomial factors is NP-hard. Theor. Comput. Sci., 285(1):55-71, 2002.
9. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci., 60(3), 2000.
10. J. Hoffstein, J. Pipher, and J. H. Silverman. Ntru: A ring-based public key cryptosystem. In ANTS, pages 267-288, 1998.
11. A. Joux and L. Granboulan. A practical attack against knapsack based hash functions. In EUROCRYPT'94, pages 58-66, 1994.
12. A. K. Lenstra, H. W. Lenstra Jr., and L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, (261):513-534, 1982.
13. R.C. Merkle and M.E. Hellman. Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory, IT-24:525-530, 1978.
14. D. Micciancio. Generalized compact knapsacks, cyclic lattices, and efficient oneway functions from worst-case complexity assumptions. Computational Complexity. (To appear. Preliminary version in FOCS 2002).
15. D. Micciancio. Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor. SIAM J. on Computing, 34(1):118-169, 2004.
16. D. Micciancio and S. Goldwasser. Complexity Of Lattice Problems: A Cryptographic Perspective. Kluwer Academic Publishers, 2002.
17. D. Micciancio and O. R.egev. Worst-case to average-case reductions based on Gaussian measures. SIAM J. on Computing. (To appear. Preliminary version in FOCS 2004).
18. C. Peikert and A. Rosen. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In TCC, 2006.
19. V. V. Prasolov. Polynomials, volume 11 of Algorithms and Computation in Mathematics. Springer-Verlag Berlin Heidelberg, 2004.
20. C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987.
21. A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. IEEE Transactions on Information Theory, IT-30(5):699-704, 1984.
22. S. Vaudenay. Cryptanalysis of the Chor-Rivest cryptosystem. Journal of Cryptology, 14(2):87-100, 2001.
23. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu. Cryptanalysis for hash functions MD4 and RIPEMD. In EUROCRYPT, 2005.
24. X. Wang and H. Yu. How to break MD5 and other hash functions. In EUROCRYPT, 2005.