Author:
Lyubashevsky Vadim,Micciancio Daniele
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Aharonov, D., Regev, O.: 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. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC, pp. 601–610 (2001)
4. Biham, E., Chen, R., Joux, A., Carribault, P., Jalby, W., Lemuet, C.: Collisions of SHA-0 and Reduced SHA-1. In: EUROCRYPT (2005)
5. Cai, J., Nerurkar, A.: An improved worst-case to average-case connection for lattice problems. In: FOCS, pp. 468–477 (1997)
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献