The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
SWIFFT: A Modest Proposal for FFT Hashing
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
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
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
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
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
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-citation(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
(1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4 · Cited by 661
Rogaway, P., & Shrimpton, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_24 · Cited by 614
Generating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
A Generalized Birthday Problem
Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_19 · Cited by 539
Cryptanalysis 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
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
Self-citation(1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3 · Cited by 258
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Micciancio, D. (2007) · computational complexity · doi:10.1007/s00037-007-0234-9 · Cited by 242
Self-citationAdvances in Cryptology--Eurocrypt '92
Rueppel, R. A. (1993) · Cited by 206
Nguyễn, P. Q., & Stehlé, D. (2006) · Lecture notes in computer science · doi:10.1007/11792086_18 · Cited by 154
Lyubashevsky, V. (2005) · Lecture notes in computer science · doi:10.1007/11538462_32 · Cited by 144
Self-citationMicciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136
Self-citationAlmost 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
Advances in Cryptology — ASIACRYPT '91
Brandt, J., Damgård, I., & Landrock, P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1 · Cited by 81
Lattices that admit logarithmic worst-case to average-case connection factors
Peikert, C., & Rosen, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250860 · Cited by 69
Self-citation
Cited by
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-citationFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Proceedings of the 3rd ACM workshop on Cloud computing security workshop · doi:10.1145/2046660.2046682 · Cited by 1,004
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Self-citation
Metadata
- Authors
- Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-07-18
- Pages
- 54-72
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1525538795
- Cited by
- 265
- References
- 29
- FWCI
- 12.16
- 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.