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 · cited 1×
“Special classes of lattices (with closely related, but somewhat different structure than ours) also have been used before in practical constructions (most notably, the NTRU encryption scheme [13] and LASH hash function [3]), but without any security proofs.”
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
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-citationLattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
Self-citationMicciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
Self-citationFiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Self-citationA Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Self-citationRegev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Pseudorandom Functions and Lattices
Banerjee, A., Peikert, C., & Rosen, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_42 · Cited by 459
Self-citationMaking NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
A Toolkit for Ring-LWE Cryptography
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_3 · Cited by 416
Self-citationLattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Self-citationPractical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Self-citationSpeeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-48965-0_8 · Cited by 268
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_7 · Cited by 258
A Decade of Lattice Cryptography
Peikert, C. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831139 · Cited by 256
Self-citationThe Learning with Errors Problem (Invited Survey)
Regev, O. (2010) · 2010 IEEE 25th Annual Conference on Computational Complexity · doi:10.1109/ccc.2010.26 · Cited by 255
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.