Ntru prime: Reducing attack surface at low cost
Open accessThe 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
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.
Cites
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 4× · see citing works
“Lyubashevsky– Peikert–Regev cryptosystem [87] original NTRU cryptosystem [64] “NTRU LPRime” “Streamlined NTRU Prime””
BackgroundMethodInfluential
Flagged first, then by citations
Cited by
Sorted by citations
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607 · see citing works
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301 · see citing works
Abbasi, M., Cardoso, F., Váz, P., Silva, J., & Martins, P. (2025) · Cryptography · doi:10.3390/cryptography9020032 · Cited by 76 · see citing works
“Modern variants such as NTRU-HRSS [20] and NTRU Prime [21] incorporate strengthened security properties and improved implementation characteristics.”
Sowa, J., Hoang, B., Yeluru, A., Qie, S., Nikolich, A., Iyer, R., & Cao, P. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00213 · Cited by 15 · see citing works
Quantum permutation pad for quantum secure symmetric and asymmetric cryptography
Kuang, R. (2025) · Academia Quantum · doi:10.20935/acadquant7457 · Cited by 4 · see citing works
- Authors
- Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C.
- Affiliations
- University of Illinois Chicago (US)
- École Normale Supérieure de Lyon (FR)
- Eindhoven University of Technology (NL)
- Corresponding author
- Bernstein, Daniel J.
- Chuengsatiansup, Chitchanok
- Lange, Tanja
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2017-12-23
- Pages
- 235-260
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2779943051
- Cited by
- 177
- References
- 1
- Citations by year
- 2026: 15 · 2025: 21 · 2024: 18 · 2023: 24 · 2022: 21 · 2021: 26 · 2020: 23 · 2019: 14 · 2018: 11 · 2017: 4
- FWCI
- 6.49
- Type
- conference paper
- Language
- en
- Open access
- green
- research.tue.nl
- Licence
- Locations
- Lecture notes in computer science (publishedVersion)
- TU/e Research Portal (publishedVersion, other-oa)
- TU/e Research Portal (submittedVersion, other-oa)
- TU/e Research Portal (submittedVersion)
- HAL (submittedVersion)
- TU/e Research Portal (submittedVersion, cc-by)
- Funders
- National Science Foundation (1314919)
- Technische Universiteit Eindhoven
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- NTRU, post-quantum cryptography, lattice-based cryptography, attack surface reduction, IND-CCA2 security, ring learning with errors, constant-time implementation, public-key cryptosystems
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
