The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Generalized Compact Knapsacks Are Collision Resistant
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
A Design Principle for Hash Functions
Damgård, I. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_39 · Cited by 1,188
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Self-citationHiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
A hierarchy of polynomial time lattice basis reduction algorithms
Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 648
Generating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Complexity of Lattice Problems
Micciancio, D., & Goldwasser, S. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0897-7 · Cited by 484
Self-citationCryptanalysis of the Hash Functions MD4 and RIPEMD
Wang, X., Lai, X., Feng, D., Chen, H., & Yu, X. (2005) · Lecture notes in computer science · doi:10.1007/11426639_1 · Cited by 445
Complexity of lattice problems : a cryptographic perspective
Micciancio, D., & Goldwasser, S. (2002) · Cited by 439
Self-citationA polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
Shamir, A. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056964 · Cited by 275
A knapsack-type public key cryptosystem based on arithmetic in finite fields
Chor, B., & Rivest, R. L. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.21214 · Cited by 238
On the Limits of Nonapproximability of Lattice Problems
Goldreich, O., & Goldwasser, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1686 · Cited by 231
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Peikert, C., & Rosen, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_8 · Cited by 229
Aharonov, D., & Regev, O. (2005) · Journal of the ACM · doi:10.1145/1089023.1089025 · Cited by 179
Another NP-complete problem and the complexity of computing short vectors in a lattice
Boas, P. V. E. (1981) · Medical Entomology and Zoology · Cited by 161
Collisions of SHA-0 and Reduced SHA-1
Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., & Jalby, W. (2005) · Lecture notes in computer science · doi:10.1007/11426639_3 · Cited by 142
Micciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136
Self-citationApproximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
Dinur, I. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46521-9_22 · Cited by 97
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
Micciancio, D. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703433511 · Cited by 90
Self-citationAn improved worst-case to average-case connection for lattice problems
Cai, J., & Nerurkar, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646135 · Cited by 85
Approximating SVP∞ to within almost-polynomial factors is NP-hard
Dinur, I. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00290-0 · Cited by 63
Cryptanalysis of the Chor—Rivest Cryptosystem
Vaudenay, S. (2000) · Journal of Cryptology · doi:10.1007/s001450010005 · Cited by 47
Cited by
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Self-citationTrapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
Self-citationCRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
Self-citation
Metadata
- Authors
- Lyubashevsky, V., & Micciancio, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 144-155
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1546634390
- Cited by
- 268
- References
- 27
- FWCI
- 3.84
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.