NTRU: A ring-based public key cryptosystem
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Unfortunately, it has an associated problem with large key-size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [115]
In the citing paper
“Likewise, another approach that is referred to as NTRU is proposed in [115].NTRU is based upon probability theory and polynomial algebra”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [115]
In the citing paper
“and has received much attention recently due to its speed.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [115]
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 2×
“There are currently a number of public key cryptosystems in the literature, including the system of Rivest, Shamir, and Adelman (RSA [9]) based on the difficulty of factoring, the system of McEliece [8] based on error correcting codes, and the recent system of Goldreich, Goldwasser, and Halevi (GGH [4]) based on the d…”
BackgroundMethodA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Schnorr, C. P., & Euchner, M. (1994) · Mathematical Programming · doi:10.1007/bf01581144 · Cited by 1,427
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 · cited 3×
“Other systems include the McEliece system [8] which relies on error correcting codes, and a recent system of Goldreich, Goldwasser, and Halevi [4] which is based on the difficulty of lattice reduction problems.”
BackgroundMethodAn Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Blum, M., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_23 · Cited by 262 · cited 1×
“NTRU fits into the general framework of a probabilistic cryptosystem as described in [1] and [5].”
BackgroundCoppersmith, D., & Shamir, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_5 · Cited by 216 · cited 3×
“Even if it were to find a spurious key of length somewhat longer than the target, as discussed by Coppersmith and Shamir in [2], it appears that the time required to find such a key would not be significantly less than that required to find the true target.”
BackgroundInfluential
Research works printed but not linked: 1
- J.H. Silverman, A Meet-In-The-Middle Attack on an NTRU Private Key, preprint.
Cited by
Items 201–300 of 1,000
Single-Trace Attacks on Message Encoding in Lattice-Based KEMs
Sim, B.-Y., Kwon, J., Lee, J., Kim, I.-J., Lee, T.-H., Han, J., Yoon, H., Cho, J., & Han, D. (2020) · IEEE Access · doi:10.1109/access.2020.3029521 · Cited by 83
“Lattice-based KEMs can be categorized into two classes: the schemes that comply security based on the hardness of some variants of the learning with errors (LWE) problem [43], and the schemes based on the NTRU problem [22].”
MethodBailey, D. V., Coffin, D., Elbirt, A. J., Silverman, J. H., & Woodbury, A. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44709-1_22 · Cited by 72
Self-citationPost-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Balamurugan, C., Singh, K., Ganesan, G., & Rajarajan, M. (2021) · Cryptography · doi:10.3390/cryptography5040038 · Cited by 110
“Certain candidate families of post-quantum schemes have been realized including code-based [5], hash-based [6], multivariate [7], lattice-based [8,9] and isogeny-based [10] solutions.”
BackgroundAbbasi, M., Cardoso, F., Váz, P., Silva, J., & Martins, P. (2025) · Cryptography · doi:10.3390/cryptography9020032 · Cited by 76
“Originally devised in the 1990s [19], NTRU has undergone extensive refinements to defend against various lattice-and algebraic-based attacks.”
NTRU Fatigue: How Stretched is Overstretched?
Ducas, L., & van Woerden, W. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_1 · Cited by 83
“For NTRUencrypt [HPS98, CDH ` 20] f and g have ternary coefficients, with a fixed number of about n { 3 of each value in t´ 1 , 0 , 1 u .”
InfluentialA Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
Borges, F., Reis, P. R., & Pereira, D. A. B. (2020) · IEEE Access · doi:10.1109/access.2020.3013250 · Cited by 95
“The scheme [25] uses cyclic (circulant) matrices as in [26] and, given h ∈ V , rot ( h ) corresponds to the circulant matrix with hX i mod X n − 1 as its i -th column.”
MethodGupta, D. S., Islam, S. H., Obaidat, M. S., Karati, A., & Sadoun, B. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2020.3016065 · Cited by 72
“Because of the security, computation, and communication efficiencies of the lattices, the literature has designed many cryptographic primitives [15]–[17] based on it.”
BackgroundDesigning an FPGA-Accelerated Homomorphic Encryption Co-Processor
Cousins, D. B., Rohloff, K. R., & Sumorok, D. (2016) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2619669 · Cited by 70
Dynamic Multi-Key FHE in Asymmetric Key Setting From LWE
Chen, Y., Dong, S., Li, T., Wang, Y., & Zhou, H. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3127023 · Cited by 67
A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications
Shim, K. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3131668 · Cited by 70
“2) Constructions and Implementation Results of Lattice-Based Schemes: Since the construction of the NTRU Encryption scheme was introduced in [55], the use of algebraic lattices [56] can boost many lattice-based constructions.”
BackgroundMaTRU: A New NTRU-Based Cryptosystem
Coglianese, M., & Goi, B. (2005) · Lecture notes in computer science · doi:10.1007/11596219_19 · Cited by 66
“Bob translates the coefficients of the polynomials in the matrix a to the range −q/2 to q/2 using the centering techniques as in the original NTRU paper [8].”
BackgroundMethodInfluentialPost Quantum Cryptography(PQC) - An overview: (Invited Paper)
Kumar, M., & Pattnaik, P. (2020) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec43674.2020.9286147 · Cited by 80
“NTRU predates the development of lattice-based cryptography, particularly the LWE methods, however it uses polynomial rings Z qn [ x ] , and its cryptographic strengths can be derived from Ring-LWEs [14].”
MethodLattice-based Cryptography for IoT in A Quantum World: Are We Ready?
Khalid, A., McCarthy, S., O'Neill, M. P., & Liu, W. (2019) · International Workshop on Advances in Sensors and Interfaces (IWASI) · doi:10.1109/iwasi.2019.8791343 · Cited by 73
“As one of the first lattice-based cryptosystems Hoffstein, Pipher, and Silverman introduced the encryption scheme NTRU [11] in 1998 which is based on ring lattices.”
BackgroundInfluentialTraceability in Permissioned Blockchain
Mitani, T., & Otsuka, A. (2020) · IEEE Access · doi:10.1109/access.2020.2969454 · Cited by 78
“First, regarding the NTRU encryption scheme [44], Hoffstein and Silverman announced the new technique [45].”
MethodProvably Weak Instances of Ring-LWE
Elias, Y., Lauter, K., Özman, E., & Stange, K. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_4 · Cited by 72
Security in RFID and Sensor Networks
Kitsos, P. (2010) · Auerbach Publications eBooks · doi:10.1201/9781420068405 · Cited by 63
Random small Hamming weight products with applications to cryptography
Hoffstein, J., & Silverman, J. H. (2003) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(02)00588-7 · Cited by 62
Self-citationEnergy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Secure Image LBP Feature Extraction in Cloud-Based Smart Campus
Xia, Z., Ma, X., Shen, Z., Sun, X., Xiong, N. N., & Jeon, B. (2018) · IEEE Access · doi:10.1109/access.2018.2845456 · Cited by 63
“It uses leveled homomorphic encryption [30] based on new encoding schemes, new homomorphic comparison, division and derivative encryption.”
MethodHomomorphic Encryption — Theory and Application
Sen, J. (2013) · InTech eBooks · doi:10.5772/56687 · Cited by 72
“A parallel line of work that utilizes ideal lattices in cryptography dates back to the NTRU cryptosystem (Hoffstein et al., 1998).”
Background(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Xagawa, K., & Yamakawa, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_14 · Cited by 68
Privacy preserving data aggregation with fault tolerance in fog-enabled smart grids
Khan, H. M., Khan, A., Jabeen, F., & Rahman, A. U. (2020) · Sustainable Cities and Society · doi:10.1016/j.scs.2020.102522 · Cited by 64
Lien, I.-T., Lin, Y., Shieh, J.-R., & Wu, J. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2252011 · Cited by 60
“We expect the proposed framework not only can address the challenges of privacy preserving LBS, but also inspire the research of secret computation with desired property to achieve privacy preserving information processing in the cloud computing era.”
BackgroundOne-Shot Verifiable Encryption from Lattices
Lyubashevsky, V., & Neven, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_11 · Cited by 61
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures
Chen, Y., Genise, N., & Mukherjee, P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34618-8_1 · Cited by 69
“Those cryptosystems include basic primitives like public-key encryption and signature schemes [33,39,38,31], as well as advanced primitives such as identity-based encryption [31,1,19], attribute-based encryption [34], and graded encodings [30].”
BackgroundShorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
Lyubashevsky, V., Nguyen, N. K., & Seiler, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75245-3_9 · Cited by 67
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
Hoffstein, J., Howgrave-Graham, N., Pipher, J. C., & Whyte, W. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_11 · Cited by 72
Self-citationA Chosen-Ciphertext Attack against NTRU
Jaulmes, É., & Joux, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_2 · Cited by 59
“In [7], Hoffstein, Pipher and Silverman have presented a public key cryptosystem based on polynomial algebra called NTRU.”
BackgroundMethodInfluentialDoubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
Lin, W.-K., Mook, E., & Wichs, D. (2023) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3564246.3585175 · Cited by 87
“5Alternatively, we also mention how to construct unkeyed DEPIR under the approximate-GCD assumption [53], the NTRU assumption [32, 41], or the module LWE assumption [12, 38] with constant rank.”
BackgroundHomomorphic AES evaluation using the modified LTV scheme
Doröz, Y., Hu, Y., & Sunar, B. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0095-1 · Cited by 68
“The scheme proposed by Stehlé and Steinfeld [11] is a modification to NTRU [10], whose security can be reduced to the hardness of the Ring-LWE (RLWE) problem.”
BackgroundMethodResultInfluentialJiang, L., Xu, C., Wang, X., Luo, B., & Wang, H. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2751476 · Cited by 61
“LHE based on NTRU has the following characteristics: easily created short keys, small ciphertext, high encryption (decryption) speed, efficient homomorphic evaluation and low memory requirement.”
BackgroundInfluentialCybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martínez, J. E. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3410702 · Cited by 94
“Hoffstein, Pipher, and Silverman proposed a lattice-based cryptosystem based on polynomial rings called “NTRU” in the 1990s [86].”
BackgroundMethodPractical Lattice-Based Digital Signature Schemes
Howe, J., Pöppelmann, T., O'Neill, M. P., O’Sullivan, E., & Güneysu, T. E. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2724713 · Cited by 68
Group key distribution via local collaboration in wireless sensor networks
Chadha, A. S., Liu, Y., & Das, S. K. (2005) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2005.1556863 · Cited by 57
Post-Quantum Cryptography: State of the Art
Buchmann, J. A., Butin, D., Göpfert, F., & Petzoldt, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49301-4_6 · Cited by 83
“Another alternative is the NTRU public-key encryption scheme [30] which has no security proof whatsoever but very good performance.”
BackgroundBenchmark Problems for Phase Retrieval
Elser, V., Lan, T.-Y., & Bendory, T. (2018) · SIAM Journal on Imaging Sciences · doi:10.1137/18m1170364 · Cited by 54
A Survey of Public-Key Cryptosystems
Koblitz, N., & Menezes, A. (2004) · SIAM Review · doi:10.1137/s0036144503439190 · Cited by 69
Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
Szydlo, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_27 · Cited by 55
A novel and efficient lattice‐based authenticated key exchange protocol in C‐K model
Gupta, D. S., & Biswas, G. (2017) · International Journal of Communication Systems · doi:10.1002/dac.3473 · Cited by 57
Towards post-quantum security for IoT endpoints with NTRU
Guillen, O. M., Pöppelmann, T., Mera, J. M. B., Bongenaar, E. F., Sigl, G., & Sepúlveda, J. (2017) · Design, Automation, and Test in Europe · doi:10.23919/date.2017.7927079 · Cited by 60
“RSA and ECC, which are based on modular exponentiation (RSA) and repeated squaring and doubling (ECC) operations, would require O(n3) operations to encrypt or decrypt the same message [5].”
BackgroundRankSign: an efficient signature algorithm based on the rank metric
Ruatta, O., Schrek, J., & Gilles Zemor, E. A. (2015) · Cited by 59
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Cited by 56
Zero Common-Knowledge Authentication for Pervasive Networks
Weimerskirch, A., & Westhoff, D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24654-1_6 · Cited by 55
“NTRU: A Ring-Based Public Key Cryptosystem.”
BackgroundEstimating the Security of Lattice-based Cryptosystems.Preprint
Rückert, M., & Schneider, M. (2010) · IACR Cryptology ePrint Archive · Cited by 55
Security Guidelines for Implementing Homomorphic Encryption
Bossuat, J.-P., Cammarota, R., Chillotti, I., Curtis, B. R., Dai, W., Gong, H., Hales, E., Kim, D., Kumara, B., Lee, C., et al. (2025) · IACR Communications in Cryptology · doi:10.62056/anxra69p1 · Cited by 74
“Here we present an overview of these topics.”
Provably Weak Instances of Ring-LWE Revisited
Castryck, W., Iliashenko, I., & Vercauteren, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49890-3_6 · Cited by 63
Mera, J. M. B., Karmakar, A., & Verbauwhede, I. M. R. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i2.222-244 · Cited by 78
Fujioka, A., Suzuki, K., Xagawa, K., & Yoneyama, K. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484323 · Cited by 60
New Results for Rank-Based Cryptography
Gaborit, P., Ruatta, O., Schrek, J., & Zémor, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06734-6_1 · Cited by 58
Koblitz, N., & Menezes, A. (2016) · IEEE Security & Privacy · doi:10.1109/msp.2016.120 · Cited by 46
“The most mature lattice-based public-key encryption scheme is NTRU [27], which has been standardized in several forums [2, 29, 51].”
A Scalable Implementation of Fully Homomorphic Encryption Built on NTRU
Rohloff, K. R., & Cousins, D. B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44774-1_18 · Cited by 61
“In this section we describe the somewhat homomorphic cryptosystem we use that is very similar to the NTRU system [16], though it was not until recently that its homomorphic properties were noticed independently by López-Alt et al.”
MethodSymplectic Lattice Reduction and NTRU
Gama, N., Howgrave-Graham, N., & Nguyễn, P. Q. (2006) · Lecture notes in computer science · doi:10.1007/11761679_15 · Cited by 52
LAC: Practical Ring-LWE Based Public-Key Encryption with Byte-Level Modulus.Preprint
Lu, X., Liu, Y., Zhang, Z., Jia, D., Xue, H., He, J., & Li, B. (2018) · IACR Cryptology ePrint Archive · Cited by 53
Improved Plantard Arithmetic for Lattice-based Cryptography
Huang, J., Zhang, J., Zhao, H., Liu, Z., Cheung, R. C. C., Koç, Ç. K., & Chen, D. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i4.614-636 · Cited by 57
“The original NTRU, which was proposed in 1996 and first published in 1998 [HPS98] by Hoffstein, Pipher, and Silverman, has gone through a long research history.”
MethodSecureMed: Secure Medical Computation Using GPU-Accelerated Homomorphic Encryption Scheme
Khedr, A. F., & Gulak, P. G. (2017) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2017.2657458 · Cited by 51
“RELATED WORK NTRU is a ring-based encryption scheme first proposed in [13].”
BackgroundInfluentialBai, S., Laarhoven, T., & Stehlé, D. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000292 · Cited by 51
“In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration algorithms, despite their superior asymptotic time complexity.”
BackgroundMiddle-Product Learning with Errors
Roşca, M., Sakzad, A., Stehlé, D., & Steinfeld, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63697-9_10 · Cited by 57
Efficient Word Size Modular Arithmetic
Plantard, T. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2021.3073475 · Cited by 57
“…process for post-quantum cryptography [13] is currently keeping, after 3 rounds of selections, 3 lattice based cryptosystems based on NTT [16], [17], [39] on the 4 finalist post-quantum cryptosystems and 2 lattice based signatures based on NTT [14], [40] on the 3 finalist for post-quantum signatures.”
MethodZhang, P., Huang, T., Sun, X., Zhao, W., Liu, H., Lai, S., & Liu, J. K. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3181667 · Cited by 50
“In 2012, based on NTRU cryptosystem [21], Lopez-Alt et al. [3] constructed a multi-key homomorphic encryption scheme without fully proved security.”
MethodSolving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
Faugère, J., & Rahmany, S. (2009) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1576702.1576725 · Cited by 50
“Tothisend,weprovidetwoalgorithms: .rst,fromthe F5 algorithm we can derive an e.cient and easy to implement algorithm for computing truncated SAGBI Gr¨ obner bases of the ideals in invariant rings.”
MethodLow Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
Aragon, N., Gaborit, P., Hauteville, A., Ruatta, O., & Zémor, G. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2933535 · Cited by 52
“Now in 1996 and 1997, two lattice-based cryptosystems were proposed independently: the NTRU [26] and the GGH [23] cryptosystems which can be seen as McEliece-type cryptosystems but for the Euclidean distance.”
MethodRound5: Compact and Fast Post-quantum Public-Key Encryption
Baan, H., Bhattacharya, S., Fluhrer, S. R., García-Morchón, Ó., Laarhoven, T., Rietman, R., Saarinen, M.-J. O., Tolhuizen, L. M. G. M., & Zhang, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_5 · Cited by 55
“2 details how Round2’s use of the function Sampleμ prevents known distinguishing attacks such as the “Evaluate at 1 ” attack [20].”
BackgroundAdapting Density Attacks to Low-Weight Knapsacks
Nguyễn, P. Q., & Stern, J. (2005) · Lecture notes in computer science · doi:10.1007/11593447_3 · Cited by 50
“The record computation for breaking the NTRU cryptosystem [4] is a SVP computation in dimension 214 by May (see [8]), while the smallest NTRU parameter currently proposed corresponds to a 502-dimensional lattice.”
BackgroundMethodECRYPT yearly report on algorithms and keysizes
Babbage, S., Catalano, D., Cid, C., de Weger, B., Dunkelman, O., Gehrmann, C., Granboulan, L., Lange, T., Lenstra, A. K., Mitchell, C. J., et al. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 49
Analysis and Improvements of NTRU Encryption Paddings
Nguyễn, P. Q., & Pointcheval, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_14 · Cited by 49
“In this section, we present the NTRU cryptosystem as originally described in [13] by Hoffstein, Pipher and Silverman.”
BackgroundMethodInfluentialA key distribution scheme using elliptic curve cryptography in wireless sensor networks
Louw, J. A., Niezen, G., Ramotsoela, D. T., & Abu-Mahfouz, A. M. I. (2016) · IEEE International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin.2016.7819342 · Cited by 49
“With NtruEncrypt, both encryption and decryption use only simple polynomial multiplication, meaning these operations are very fast compared to other asymmetric encryption schemes [28].”
BackgroundA Comparative Study of Post-Quantum Cryptosystems for Internet-of-Things Applications
Septien-Hernandez, J.-A., Arellano-Vázquez, M., Contreras-Cruz, M. A., & Ramirez‐Paredes, J. (2022) · Sensors · doi:10.3390/s22020489 · Cited by 55
“As for lattice-based public-key cryptosystems, their primary representative is known as the NTRU cryptosystem [10], proposed in 1998 by Hoffstein, Pipher, and Silverman.”
Liu, S., Hong, Y., & Viterbo, E. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2437882 · Cited by 48
“Traditional key-based cryptography [1–3] usually is based on the assumption that the eavesdropper (Eve) has limited computational resources.”
BackgroundETRU: NTRU over the Eisenstein integers
Jarvis, K., & Nevins, M. (2013) · Designs Codes and Cryptography · doi:10.1007/s10623-013-9850-3 · Cited by 48
Cryptanalysis 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
Public key cryptography based privacy preserving multi-context RFID infrastructure
Kaya, S. V., Savaş, E., Levi, A. W., & Erçetin, Ö. (2008) · Ad Hoc Networks · doi:10.1016/j.adhoc.2007.12.004 · Cited by 48
A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE
Göpfert, F., van Vredendaal, C., & Wunderer, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_11 · Cited by 54
A New Public-Key Cryptosystem via Mersenne Numbers
Aggarwal, D., Joux, A., Prakash, A., & Sántha, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_16 · Cited by 50
Design of lattice‐based ElGamal encryption and signature schemes using SIS problem
Gupta, D. S., & Biswas, G. P. (2017) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.3255 · Cited by 49
“2 , 3 In 1998, the first version of the NTRU sys-tem was presented by Hoffstein et al. 26 They presented a new public key cryptosystem called the NTRU system.”
BackgroundAssessment of the Key-Reuse Resilience of NewHope
Bauer, A., Gilbert, H., Renault, G., & Rossi, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12612-4_14 · Cited by 47
Quantum-Resistant Cryptography for the Internet of Things Based on Location-Based Lattices
Althobaiti, O. S., & Dohler, M. (2021) · IEEE Access · doi:10.1109/access.2021.3115087 · Cited by 44
“All entities use lattice theory (lattice-based cryptography) to generate public/private keys and encrypt/decrypt messages [79]–[83].”
BackgroundMore Efficient Algorithms for the NTRU Key Generation Using the Field Norm
Pornin, T., & Prest, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17259-6_17 · Cited by 46
“NTRU lattices are a class of trapdoor lattices that were introduced by [13], as the core object in which the NTRUEncrypt asymmetric encryption algorithm is expressed.”
BackgroundAlgebraically Structured LWE, Revisited
Peikert, C., & Pepin, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36030-6_1 · Cited by 51
NTRUReEncrypt: An Efficient Proxy Re-Encryption Scheme Based on NTRU
Núñez, D., Agudo, I., & López, J. (2015) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2714576.2714585 · Cited by 57
“The NTRU encryption scheme, originally proposed by Hoffstein, Pipher and Silverman in [20], is one of the first public key encryption schemes based on lattices.”
BackgroundMethodInfluentialAn Efficient Lattice Based Multi-stage Secret Sharing Scheme
Pilaram, H., & Eghlidos, T. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2432800 · Cited by 53
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography).Preprint
Peikert, C. (2009) · IACR Cryptology ePrint Archive · Cited by 45
Lattice-Based Cryptography: A Survey
Wang, X., Xu, G., & Yu, Y. (2023) · Chinese Annals of Mathematics Series B · doi:10.1007/s11401-023-0053-6 · Cited by 74
Boorghany, A., Bayat-Sarmadi, S., & Jalili, R. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2700078 · Cited by 51
“It is in contrast to the NTRU encryption [HPS98], which is a well-known and efficient lattice-based scheme.”
MethodResultHomomorphic AES Evaluation using NTRU.Preprint
Doröz, Y., Hu, Y., & Sunar, B. (2014) · IACR Cryptology ePrint Archive · Cited by 55
Analysis of the NTRU Post-Quantum Cryptographic Scheme in Constrained IoT Edge Devices
Señor, J., Portilla, J., & Mujica, G. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3162254 · Cited by 57
“NTRU was first published in [21].”
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
Laarhoven, T., & de Weger, B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_6 · Cited by 59
“Lattice-based cryptography has recently received wide attention from the cryptographic community, due to e.g. its presumed resistance against quantum attacks [8], the existence of lattice-based fully homomorphic encryption schemes [16], and efficient cryptographic primitives like NTRU [18] and LWE [39].”
BackgroundAn FPGA implementation of the NTRUEncrypt cryptosystem
Kamal, A. A., & Youssef, A. (2009) · International Conference on Microelectronics (ICM) · doi:10.1109/icm.2009.5418649 · Cited by 43
“The NTRU public key cryptosystem [3] is one of these new generation systems that offer large speed improvement compared to RSA and elliptic curve counterparts.”
BackgroundSubtractive Sets over Cyclotomic Rings
Albrecht, M. R., & Lai, R. W. F. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84245-1_18 · Cited by 43
“This is because random elements in R are easily trapdoored [21] such that using them in computations touching secret values risks their exposure.”
BackgroundA Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
Qin, Y., Chi, C., Zhang, X., Pan, Y., Hu, L., & Ding, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_4 · Cited by 58
“The other is NTRU [35] and NTRU Prime [12].”
BackgroundAssessing Security-Critical Energy-Efficient Sensor Networks
Law, Y. W., Dulman, S., Etalle, S., & Havinga, P. (2002) · TU/e Research Portal · Cited by 48
TollsOnly Please—Homomorphic Encryption for Toll Transponder Privacy in Internet of Vehicles
Karim, H., & Rawat, D. B. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3056240 · Cited by 43
Eisenträger, K., Hallgren, S., & Lauter, K. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13051-4_11 · Cited by 48
A Three-Level Sieve Algorithm for the Shortest Vector Problem
Zhang, F., Pan, Y., & Hu, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_2 · Cited by 42
On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
Chenal, M., & Tang, Q. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16295-9_13 · Cited by 41
High-Precision Arithmetic in Homomorphic Encryption
Chen, H., Laine, K., Player, R., & Xia, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76953-0_7 · Cited by 46
“In this work we tackle the issue of the plaintext polynomial coefficient growth using a trick that Hoffstein and Silverman suggested in [29] to be used in the context of the NTRU encryption scheme [28].”
MethodOn Feasibility of Post-Quantum Cryptography on Small Devices
Malina, L., Popelová, L., Dzurenda, P., Hajný, J., & Martinásek, Z. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.07.104 · Cited by 41
Hu, T., Zhang, Z., Yi, P., Liang, D., Li, Z., Ren, Q., Hu, Y., & Lan, J. (2020) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2020.09.006 · Cited by 57
Fundamentals of fully homomorphic encryption
Brakerski, Z. (2019) · ACM eBooks · doi:10.1145/3335741.3335762 · Cited by 42
Low-cost implementations of NTRU for pervasive security
Atıcı, A. C., Batina, L., Fan, J., Verbauwhede, I. M. R., & Örs, B. (2008) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2008.4580158 · Cited by 40
“We have chosen N = 167, q = 128 and p = 3 among the parameter sets of NTRU that yields to a high level of security [4].”
BackgroundMethodParallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice
Ishiguro, T., Kiyomoto, S., Miyake, Y., & Takagi, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54631-0_24 · Cited by 40
“Using ideal lattices, many cryptographic primitives work faster and require less storage [12, 9].”
Background
Metadata
- Authors
- Hoffstein, J., Pipher, J., & Silverman, J. H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 267-288
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1675339804
- Semantic Scholar
- 1b8e7efdb97ff191530970a9685c6f4bed89644b
- Cited by
- 1,947
- References
- 13
- Citations by year
- 2026: 92 · 2025: 152 · 2024: 141 · 2023: 136 · 2022: 132 · 2021: 122 · 2020: 117 · 2019: 112 · 2018: 88 · 2017: 98 · 2016: 89 · 2015: 112 · 2014: 76 · 2013: 68 · 2012: 59
- FWCI
- 7.29
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- NTRU, public-key cryptosystems, ring-based cryptography, encryption and decryption, key generation, cryptosystem security
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.