The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
NTRUSign: Digital Signatures Using the NTRU Lattice
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
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
Self-citationKiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
On Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · Combinatorica · doi:10.1007/bf02579403 · Cited by 938
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 789
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
A public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258604 · Cited by 642
Public-key cryptosystems from lattice reduction problems
Goldreich, O., Goldwasser, S., & Halevi, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052231 · Cited by 482
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Hankerson, D., López Hernandez, J., & Menezes, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_1 · Cited by 423
Cryptographic Hardware and Embedded Systems — CHES 2000
Koç, Ã. K., & Paar, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44499-8 · Cited by 271
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Shamir, A. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.5 · Cited by 186
Lattice Reduction in Cryptology: An Update
Nguyễn, P. Q., & Stern, J. (2000) · Lecture notes in computer science · doi:10.1007/10722028_4 · Cited by 116
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Shamir, A. (1982) · doi:10.1109/sfcs.1982.55 · Cited by 100
Dimension Reduction Methods for Convolution Modular Lattices
May, A., & Silverman, J. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44670-2_10 · Cited by 74
Self-citationNTRU : A new high speed public key cryptosystem
Hoffstein, J. (1996) · International Cryptology Conference · Cited by 66
Self-citationCryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
Gentry, C., Jönsson, J., Stern, J., & Szydlo, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_1 · Cited by 48
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
“The first attempts [27, 28, 29] to turn hard lattice problems into signature systems were marred by attacks [30, 31] and surviving systems suffered from large signature sizes.”
Lattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., & Stehlé, D. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i1.238-268 · Cited by 713
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
Metadata
- Authors
- Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J. H., & Whyte, W.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 122-140
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1893972099
- Cited by
- 302
- References
- 18
- FWCI
- 4.42
- 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.