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 301–400 of 1,000
Efficient LBS Security-Preserving Based on NTRU Oblivious Transfer
Bi, B., Huang, D., Mi, B., Deng, Z., & Pan, H. (2019) · Wireless Personal Communications · doi:10.1007/s11277-019-06544-2 · Cited by 40
“As a relatively new public key cryptosystem which is developed around 1996, Number Theory Research Unit Encryption (NTRUEncrypt) [22] uses only simple polynomial multiplications and is more competitive to be implemented in resource-constraint applications such as mobile devices or smart-cards.”
BackgroundFujiwara, M., Waseda, A., Nojima, R., Moriai, S., Ogata, W., & Sasaki, M. (2016) · Scientific Reports · doi:10.1038/srep28988 · Cited by 35
“ir low dark counts. The quantum efficiencies of SSPDs are 10% at 100 c/s of dark count rate. Specifications are listed in table 1. The information theoretically secure distributed storage system with (3,4) threshold for secret data is physically constructed with four nodes which are denoted as Node 1 to 4 of the QKD p…”
Prakasan, A., Jain, K., & Krishnan, P. (2022) · International Conference on Intelligent Computing and Control Systems (ICICCS) · doi:10.1109/iciccs53718.2022.9788239 · Cited by 44
Countermeasures against Power Analysis Attacks for the NTRU Public Key Cryptosystem
Lee, M., Song, J. E., Choi, D., & Han, D. (2010) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e93.a.153 · Cited by 38
Implementation of Lattice Trapdoors on Modules and Applications
Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., & Sabt, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_11 · Cited by 39
Representing hard lattices with O(n log n) bits
Ajtai, M. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060604 · Cited by 39
“Another lattice based system with small key-size is the commercial system NTRU (see [7]).”
BackgroundCryptanalysis of the Public-Key Encryption Based on Braid Groups
Lee, E.-K., & Park, J. H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_30 · Cited by 39
A Survey of Oblivious Transfer Protocol
Yadav, V. K., Andola, N., Verma, S., & Venkatesan, S. (2022) · ACM Computing Surveys · doi:10.1145/3503045 · Cited by 38
“In order to send the encrypted message eiciently, the sender uses the combination of public-key [22, 32, 47, 75] and symmetric key encryption techniques [11, 53, 84].”
BackgroundTiming Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls
Silverman, J. H., & Whyte, W. (2006) · Lecture notes in computer science · doi:10.1007/11967668_14 · Cited by 38
Self-citationOTRU: A non-associative and high speed public key cryptosystem
Malekian, E., & Zakerolhosseini, A. (2010) · CSI International Symposium on Computer Architecture and Digital Systems (CADS) · doi:10.1109/cads.2010.5623536 · Cited by 38
“After a brief introduction to Ntrū, we describe the algebraic structure used in the proposed cryptosystem.”
MethodPIRMAP: Efficient Private Information Retrieval for MapReduce
Mayberry, T., Blaß, E.-O., & Chan, A. H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39884-1_32 · Cited by 38
“More recently, Aguilar-Melamine and Gaborit [1] have proposed a scheme using lattice-based homomorphic encryption (similar to Hoffstein et al. [11]) which has much better computational complexity, both asymptotically and in practice.”
Huang, W., Chen, J.-P., & Yang, B. (2019) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i1.123-151 · Cited by 40
May, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84245-1_24 · Cited by 50
On the Hardness of the NTRU Problem
Pellet-Mary, A., & Stehlé, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3_1 · Cited by 41
Privacy-Preserving Collective Learning With Homomorphic Encryption
Paul, J., Annamalai, M. S. M. S., Ming, W., Badawi, A. A., Veeravalli, B., & Aung, K. M. M. (2021) · IEEE Access · doi:10.1109/access.2021.3114581 · Cited by 50
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
Hermans, J., Schneider, M., Buchmann, J. A., Vercauteren, F., & Preneel, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12678-9_4 · Cited by 47
“The NTRU [ HPS98 ,otCC09] and GGH [GGH97] schemes do not provide a security proof, but the best attacks are also lattice based.”
BackgroundLow-Cost Cryptography for Privacy in RFID Systems
Calmels, B., Canard, S., Girault, M., & Sibert, H. (2006) · Lecture notes in computer science · doi:10.1007/11733447_17 · Cited by 37
“3 In terms of security, NTRU-503 is claimed to be equivalent to RSA-4096.”
MethodInfluentialAnalysis of Error-Correcting Codes for Lattice-Based Key Exchange
Fritzmann, T., Pöppelmann, T., & Sepúlveda, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-10970-7_17 · Cited by 36
“Aside from NTRU [19] and when focusing on ephemeral key exchange and PKE, the Learning with Errors (LWE) problem and the more structured Ring-LWE (RLWE) problem are the main tools to build state of the art schemes.”
Réduction de réseau et sécurité concrète du chiffrement complètement homomorphe
Chen, Y. (2013) · Cited by 113
Halak, B., Gibson, T., Henley, M., Botea, C.-B., Heath, B., & Khan, S. (2024) · IEEE Access · doi:10.1109/access.2024.3350775 · Cited by 44
“These are the NTRU problem [24] and the Learning-With-Errors problem (LWE) [25].”
Bandwidth Efficient PIR from NTRU
Doröz, Y., Sunar, B., & Hammouri, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44774-1_16 · Cited by 36
Generalisations of NTRU cryptosystem
Singh, S., & Padhye, S. (2016) · Security and Communication Networks · doi:10.1002/sec.1693 · Cited by 37
RLizard: Post-Quantum Key Encapsulation Mechanism for IoT Devices
Lee, J., Kim, D., Lee, H.-K., Lee, Y., & Cheon, J. H. (2018) · IEEE Access · doi:10.1109/access.2018.2884084 · Cited by 37
“NTRU encryption [27] together with its dedicated padding scheme [28] can be regarded as the earliest example of a lattice-based KEM.”
MethodEfficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
Shen, T., Wang, F., Chen, K., Wang, K., & Li, B. (2019) · IEEE Access · doi:10.1109/access.2019.2922685 · Cited by 36
“[44] J. Hoffstein, J. Pipher, and J. H. Silverman, ‘‘NTRU: A ring-based public key cryptosystem,’’ in Algorithmic Number Theory—ANTS (Lecture Notes in Computer Science), vol. 1423.”
Lamtzidis, O., Pettas, D., & Gialelis, J. (2019) · Applied System Innovation · doi:10.3390/asi2030030 · Cited by 42
“NTRU supports the use of NTRU-style public key encryption [10].”
MethodA Post-Quantum Compliant Authentication Scheme for IoT Healthcare Systems
Adeli, M., Bagheri, N., Maimani, H. R., Kumari, S., & Rodrigues, J. J. P. C. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3309931 · Cited by 41
“[17] and the learning with errors (LWE) [18].”
BackgroundHardware Circuits and Systems Design for Post-Quantum Cryptography—A Tutorial Brief
Xie, J., Zhao, W., Lee, H., Roy, D. B., & Zhang, X. (2024) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2024.3357836 · Cited by 37
“Lattice-based schemes mainly are based on Learning-with-Errors (LWE)/Ring-LWE and/or ring of polynomials of degree N (NTRU) problems [13], [14], [15], while code-based PQC relies on error-correcting codes to ensure its security [16].”
BackgroundNew Chosen-Ciphertext Attacks on NTRU
Gama, N., & Nguyễn, P. Q. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-71677-8_7 · Cited by 35
“We refer to [8,10,9] for the actual running time of an efficient implementation of the encryption and the decryption algorithm.”
BackgroundMethodInfluentialGroup key agreement for secure group communication in dynamic peer systems
Lv, X., Li, H., & Wang, B. (2012) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2012.06.004 · Cited by 35
Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
Szepieniec, A., Ding, J., & Bart Preneel, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_12 · Cited by 35
“Encryption can be done in only a few milliseconds, on par with other post-quantum cryptosystems such as NTRU [16] and McEliece [20].”
BackgroundAn efficient group key agreement protocol for secure P2P communication
Vijayakumar, P., Naresh, R., Deborah, L. J., & Islam, S. H. (2016) · Security and Communication Networks · doi:10.1002/sec.1578 · Cited by 35
A review and vision on authentication and privacy preservation schemes in smart grid network
Agarkar, A. A., & Agrawal, H. (2019) · Security and Privacy · doi:10.1002/spy2.62 · Cited by 39
“72 Recently, Lattice cryptography has attracted equal attention of the researchers from both industry and academia.”
BackgroundHomomorphic Encryption for Finite Automata
Genise, N., Gentry, C., Halevi, S., Li, B., & Micciancio, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34621-8_17 · Cited by 37
Zhou, Q., Tian, C., Zhang, H., Yu, J., & Li, F. (2019) · Information Sciences · doi:10.1016/j.ins.2019.10.007 · Cited by 35
Sim, B.-Y., Park, A., & Han, D. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3179683 · Cited by 41
“They are classified into two types: 1) the schemes based on the learning with error (LWE)/learning with rounding (LWR) problem [9]–[11] and 2) the schemes based on the NTRU problem [12], [13].”
TensorCrypto: High Throughput Acceleration of Lattice-Based Cryptography Using Tensor Core on GPU
Lee, W., Seo, H., Zhang, Z., & Hwang, S. O. (2022) · IEEE Access · doi:10.1109/access.2022.3152217 · Cited by 43
“The original NTRU scheme, known as NTRU-HPS [29], [30], works over R q := Z q [ x ] / ( x N − 1) = φ N ( x ) φ 1 ( x ) .”
BackgroundMethodConvergence and Hybrid Information Technologies
Crisan, M. (2010) · InTech eBooks · doi:10.5772/235 · Cited by 38
An Accelerated Algorithm for Solving SVP Based on Statistical Analysis
Fukase, M., & Kashiwabara, K. (2015) · Journal of Information Processing · doi:10.2197/ipsjjip.23.67 · Cited by 34
“Here, we consider GGH lattices [6], Micciancio’s GGH lattices [10], and NTRU lattices [7].”
MethodLarge FHE Gates from Tensored Homomorphic Accumulator
Bonnoron, G., Ducas, L., & Fillinger, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89339-6_13 · Cited by 34
“One (not so) novel technical aspect is that we choose in this work to use convolution rings Z[X]/(X − 1), as in the NTRU schemes [17] rather than cyclotomic ones.”
BackgroundMethodVerifiable Privacy-Preserving Scheme Based on Vertical Federated Random Forest
Hou, J., Su, M., Fu, A., & Yu, Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3090951 · Cited by 36
“…do not use the fast Fourier transform to compute the inverse of polynomials, the key generation speed of NTRU type multikey homomorphic encryption (MKFHE) will be very slow, so we use a fixed key ( n , q , d ) = ( 503 , 256 , 2 ) instead, which is the highest security level of NTRU algorithm [24].”
MethodLossless Data Hiding in Encrypted Images Compatible With Homomorphic Processing
Wu, H., Cheung, Y., Zhuang, Z., Xu, L., & Hu, J. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3163245 · Cited by 36
“cryptosystems such as those in [39]–[42].”
Practical Lattice Basis Sampling Reduction
Buchmann, J. A., & Ludwig, C. (2006) · Lecture notes in computer science · doi:10.1007/11792086_17 · Cited by 35
“We explain why under plausible assumptions the recommended security parameter N = 251 for NTRU [13] offer at most 74 Bit security and that 80 Bit security requires N ≥ 271.”
BackgroundFloating-Point LLL: Theoretical and Practical Aspects
Stehlé, D. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_5 · Cited by 38
“Lattice reduction gained tremendous popularity in the field of public-key cryptography thanks to the birth of lattice-based cryptosystems [5, 21, 27] and to the methods of Coppersmith to find small roots of polynomials [14, 15, 16], a very powerful tool in public-key cryptanalysis (see the survey [38] contained in thi…”
BackgroundRoy, K. S., Deb, S., & Kalita, H. K. (2022) · Digital Communications and Networks · doi:10.1016/j.dcan.2022.12.003 · Cited by 41
Security in Post-Quantum Era: A Comprehensive Survey on Lattice-Based Algorithms
Nguyen, H. D., Huda, S., Nogami, Y., & Nguyen, T. T. (2025) · IEEE Access · doi:10.1109/access.2025.3571307 · Cited by 42
“…deprecated in this round, while lattice-based solutions such as CRYSTALS-Kyber (Kyber) [18], [19], [20], [21], [22], [23], CRYSTALS-Dilithium (Dilithium) [24], [25], [26], [27], and number theory research unit (NTRU) [28] gained prominence because of their efficiency and robust security proofs.”
Research on Wireless Sensor Network Security
Li, Y., Qin, L., & Liang, Q. (2010) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2010.113 · Cited by 33
Efficient Attribute-Based Encryption from R-LWE
Zhu, W., Yu, J., Wang, T., Zhang, P., & Xie, W. (2014) · Chinese Journal of Electronics · doi:10.23919/cje.2014.10851999 · Cited by 33
Post-quantum cryptography and 5G security
Clancy, T. C., McGwier, R., & Chen, L. (2019) · ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) · doi:10.1145/3317549.3324882 · Cited by 34
“NTRU was originally published in 1998 [5] and undergone considerable study.”
BackgroundOrder-LWE and the Hardness of Ring-LWE with Entropic Secrets
Bolboceanu, M., Brakerski, Z., Perlman, R., & Sharma, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34621-8_4 · Cited by 37
MSDP: multi-scheme privacy-preserving deep learning via differential privacy
Owusu-Agyemeng, K., Qin, Z., Xiong, H., Liu, Y., Zhuang, T., & Qin, Z. (2021) · Personal and Ubiquitous Computing · doi:10.1007/s00779-021-01545-0 · Cited by 36
“In this section, we design our MSDP algorithms by composing a number of existing tools based on the literature, namely NTRU Encryption [23], Multikey Homomor-phism [24], Laplace mechanism [25] of Dwork, deep neural network, formal definition, security model and system model as the building blocks…”
MethodEfficient Hardware Arithmetic for Inverted Binary Ring-LWE Based Post-Quantum Cryptography
Imaña, J. L., He, P., Bao, T., Tu, Y., & Xie, J. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3169471 · Cited by 35
“The National Institute of Standards and Technology (NIST) has initiated a PQC standardization process, where the most promising cryptosystems are mainly classified as lattice-based [3], code-based [4], hash-based [5], isogeny-based [6], and multivariate-quadratic cryptography [7].”
BackgroundSieving for Shortest Vectors in Ideal Lattices
Schneider, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38553-7_22 · Cited by 33
A Novel Hybrid Quantum-Crypto Standard to Enhance Security and Resilience in 6G-Enabled IoT Networks
Singamaneni, K. K., Budati, A. K., Islam, S., Kolandaisamy, R. A. L., & Muhammad, G. (2025) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2025.3540905 · Cited by 41
“It enhances the security of operations with reduced keys [41].”
Application of NTRU Cryptographic Algorithm for SCADA Security
Premnath, A. P., Jo, J.-Y., & Kim, Y. (2014) · 2014 11th International Conference on Information Technology: New Generations · doi:10.1109/itng.2014.38 · Cited by 29
A public key cryptosystem based on three new provable problems
Su, S., & Lü, S. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.12.011 · Cited by 32
“The shortest vector problem (SVP) is the security bedrock of NTRU since it is impossible to seek an NTRU secret polynomial or an NTRU plaintext polynomial through the L3 lattice base reduction on condition that two special parameters ch and cm are fitly selected [15].”
BackgroundMethodSeparable Reversible Data Hiding Scheme in Homomorphic Encrypted Domain Based on NTRU
Zhou, N., Zhang, M., Wang, H., Ke, Y., & Di, F. (2020) · IEEE Access · doi:10.1109/access.2020.2990903 · Cited by 32
“NTRU (Number Theory Research Unit) full homomorphic encryption algorithm can resist quantum and traditional algorithm attacks, and its security can be reduced to the shortest vector problem (SVP) on the lattice [30]–[32].”
BackgroundRigorous and Efficient Short Lattice Vectors Enumeration
Pujol, X., & Stehlé, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_24 · Cited by 36
“The landscape changed dramatically in the mid-90’s with the invention of several lattice-based encryption schemes, among which Ajtai-Dwork [3], NTRU [17] and GGH [13].”
BackgroundA Survey on DNA-Based Cryptography and Steganography
Mahjabin, T., Olteanu, A., Xiao, Y., Han, W., Li, T., & Sun, W. (2023) · IEEE Access · doi:10.1109/access.2023.3324875 · Cited by 35
“In this work, the authors proposed a method to break the Number Theory Research Unit (NTRU) [50].”
MethodA physical layer security scheme for 6G wireless networks using post-quantum cryptography
Abdallah, W. (2024) · Computer Communications · doi:10.1016/j.comcom.2024.02.019 · Cited by 45
HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures
Cheon, J. H., Choe, H., Devevey, J., Güneysu, T. E., Hong, D., Krausz, M., Land, G., Möller, M., Stehlé, D., & Yi, M. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i3.25-75 · Cited by 31
A Multivariate Encryption Scheme with Rainbow
Yasuda, T., & Sakurai, K. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29814-6_19 · Cited by 31
Second Order Statistical Behavior of LLL and BKZ
Yu, Y., & Ducas, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_1 · Cited by 31
“Lattice reduction has played a role in the cryptanalysis of cryptosystems not directly related to lattices, and is now even more relevant to quantifying the security of lattice-based cryptosystems [14, 6, 1].”
BackgroundBatten Down the Hatches: Securing Neighborhood Area Networks of Smart Grid in the Quantum Era
Chi, C., Qin, Y., Lu, R., Jiang, T., & Takagi, T. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2903836 · Cited by 31
Residue arithmetic systems in cryptography: a survey on modern security applications
Schoinianakis, D. (2020) · Journal of Cryptographic Engineering · doi:10.1007/s13389-020-00231-w · Cited by 37
“It can be proven that the quantity [P∗f]m + [P∗g]r is bound by q/2, so the decrypting side can recover the message without additional reductions modulo q [31].”
BackgroundInfluentialKolberg, J., Drozdowski, P., Gomez‐Barrero, M., Rathgeb, C., & Busch, C. (2020) · International Conference on Biometrics · Cited by 31
Drozdowski, P., Stockhardt, F., Rathgeb, C., Osorio-Roig, D., & Busch, C. (2021) · IEEE Access · doi:10.1109/access.2021.3118830 · Cited by 38
Kundu, S., D’Anvers, J.-P., Beirendonck, M. V., Karmakar, A., & Verbauwhede, I. M. R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-14791-3_5 · Cited by 33
“Three of the four finalist KEMs: Saber [19], Kyber [10], and NTRU [26], are lattice-based.”
BackgroundSarkar, S., Shafaei, S., Jones, T., & Totaro, M. W. (2025) · Drones · doi:10.3390/drones9080583 · Cited by 58
Another Look at Tightness II: Practical Issues in Cryptography
Chatterjee, S., Koblitz, N., Menezes, A., & Sarkar, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61273-7_3 · Cited by 31
“NTRU is a lattice-based public-key encryption scheme that was first presented in 1996 (see [47, 46]) and has been standardized by several accredited organizations including ANSI [6] and IEEE [48].”
MethodAn LLL Algorithm for Module Lattices
Lee, C., Pellet-Mary, A., Stehlé, D., & Wallet, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34621-8_3 · Cited by 37
“In order to assess the security of cryptographic schemes based on NTRU/RingSIS/etc, an essential question is whether the restriction to module lattices brings vulnerabilities.”
BackgroundInfluentialPost Quantum Public and Private Key Cryptography Optimized for IoT Security
Kaushik, A. K., Vadlamani, L. S. S., Hussain, M. M., Sahay, M., Singh, R., Singh, A. K., Indu, S., Goswami, P., & Kousik, N. G. V. (2022) · Wireless Personal Communications · doi:10.1007/s11277-022-10162-w · Cited by 33
“[16] whose improved version was released later in 2003 [17].”
BackgroundMethodMore on Security of Public-Key Cryptosystems Based on Chebyshev Polynomials
Cheong, K. Y., & Koshiba, T. (2007) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/tcsii.2007.900875 · Cited by 30
“For instance, the NTRU [3], based on polynomial rings, is known as such a candidate and its security has been discussed in the literature.”
BackgroundComputing Generator in Cyclotomic Integer Rings
Biasse, J., Espitau, T., Fouque, P.-A., Gélin, A., & Kirchner, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_3 · Cited by 30
“For instance, the NTRU cryptosystem [22], which is one of the most efficient encryption scheme related to our purpose, is based on the Shortest Vector Problem (SVP).”
High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
Liu, Z., Pöppelmann, T., Oder, T., Seo, H., Roy, S. S., Güneysu, T. E., Großschädl, J., Kim, H., & Verbauwhede, I. M. R. (2017) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3092951 · Cited by 30
“To realize lattice-based public key encryption several proposals exist (see Cabar-cas et al. [2014] for a comparison) like classical NTRU [Hoffstein et al. 1998] (de-fined in Z q [ x ] / (cid:4) x n − 1 (cid:5) ), provably secure NTRU [Stehl´e and Steinfeld 2011] (defined in Z q [ x ] / (cid:4) x n +…”
A Key Recovery Reaction Attack on QC-MDPC
Guo, Q., Johansson, T., & Stankovski, P. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2877458 · Cited by 32
“1As in NTRUEncrypt [23], [24], a secure approach is to require the decoding error probability to be less than 2−κ for the κ-bit security level.”
BackgroundMultilevel Indexed Quasigroup Encryption for Data and Speech
Satti, M., & Kak, S. C. (2009) · IEEE Transactions on Broadcasting · doi:10.1109/tbc.2009.2014993 · Cited by 29
“Number theoretic transformations, such as those by decimal sequences [14], exponentiation or elliptic curves [15], or NTRU [16], which are used in encryption, may also be viewed as performing permutations.”
BackgroundYassein, H. R., Al-Saidi, N. M. G., & Farhan, A. K. (2020) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2020.1741218 · Cited by 29
“NTRU is one of the cryptosystems founded in 1996 by Jeffery Hoffstein, Joseph Silverman, and Jill Piper [6].”
BackgroundLiu, Z., Tseng, Y., Tso, R., Mambo, M., & Chen, Y. (2021) · The Computer Journal · doi:10.1093/comjnl/bxab119 · Cited by 30
“The first NTRU-based public-key encryption is introduced in 1996 by Hoffstein et al. [HPS98], and later Stehlé and Steinfeld [SS11] presents a new variant that has been proven to be secure in the worst-case lattice problem.”
MethodA Privacy-Preserving Scheme for Smart Grid Using Trusted Execution Environment
Akgün, M., Soykan, E. Ü., & Soykan, G. (2023) · IEEE Access · doi:10.1109/access.2023.3237643 · Cited by 33
“Lattice-based homomorphic encryption [14] is used for aggregation to be performed between smart appliances [15], [16].”
MethodNTRU+: Compact Construction of NTRU Using Simple Encoding Method
Kim, J., & Park, J. H. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3299172 · Cited by 29
“The hardness of NTRU is crucially based on the NTRU problem [14], which has withstood significant cryptanalytic attacks over the past few decades.”
BackgroundMethodA comprehensive survey of cryptography key management systems
Rana, S., Parast, F. K., Kelly, B., Wang, Y., & Kent, K. B. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103607 · Cited by 58
Lattice Reduction Algorithms: Theory and Practice
Nguyễn, P. Q. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_2 · Cited by 29
“reduction [2] and the NTRU cryptosystem [15].”
Provably Secure NTRU Instances over Prime Cyclotomic Rings
Yu, Y., Xu, G., & Wang, X. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54365-8_17 · Cited by 29
The Complexity of Public-Key Cryptography
Barak, B. (2017) · Information security and cryptography · doi:10.1007/978-3-319-57048-8_2 · Cited by 34
Faster Multiplication in $$\mathbb {Z}_{2^m}[x]$$ on Cortex-M4 to Speed up NIST PQC Candidates
Kannwischer, M. J., Rijneveld, J., & Schwabe, P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21568-2_14 · Cited by 32
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
Ducas, L., Plançon, M., & Wesolowski, B. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_12 · Cited by 33
Towards Lattice Based Aggregate Signatures
Bansarkhani, R. E., & Buchmann, J. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06734-6_21 · Cited by 29
A Public Key Block Cipher Based on Multivariate Quadratic QuasigroupsPreprint
Gligoroski, D., Markovski, S., & Knapskog, S. J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0808.0247 · Cited by 29
“…years, such as McEliece PKC based on error correcting codes [30], Rabin’s digital signature method [39], PKCs based on lattice reduction problems [1,18] and on lattice problems over rings such as NTRU [21], PKCs based on braid groups [25] and PKCs based on Multivariate Quadratic (MQ) polynomials.”
MethodUnshared Secret Key Cryptography
Liu, S., Hong, Y., & Viterbo, E. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2364022 · Cited by 28
Teruya, T., Kashiwabara, K., & Hanaoka, G. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76578-5_15 · Cited by 28
“…field of research, because it has produced useful cryptographic schemes, for example, public-key cryptosystems, functional encryption schemes, and fully homomorphic encryption schemes, etc. [4,26,31,44,24,1,2,27,28,7,29,10,11,8,9,12], and these systems are believed to resist quantum cryptanalysis.”
BackgroundA Review of Post-quantum Cryptography and Crypto-agility Strategies
Grote, O., Ahrens, A., & Benavente-Peces, C. (2019) · International Interdisciplinary PhD Workshop (IIPhDW) · doi:10.1109/iiphdw.2019.8755433 · Cited by 39
“is based on the principles of the RLWE problem, requires a runtime of O(N) for an encryption/decryption operation of a message of length N , while a conventional RSA method requires a runtime of O(N) [10].”
MethodA Variant of NTRU with Non-invertible Polynomials
Banks, W. D., & Shparlinski, I. E. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36231-2_6 · Cited by 28
“We remark that for the special set L' considered in [ 5 ], the bound on M(J) in Lemma 1 can be improved, which leads to a stronger bound in Theorem 1.”
BackgroundNTRU over rings beyond $${\mathbb{Z}}$$
Nevins, M., Karimianpour, C., & Miri, A. (2009) · Designs Codes and Cryptography · doi:10.1007/s10623-009-9342-7 · Cited by 28
“The material in this section is summarized from [7].”
BackgroundEfficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
Becker, A., & Laarhoven, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31517-1_1 · Cited by 32
A Faster Lattice Reduction Method Using Quantum Search
Ludwig, C. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24587-2_22 · Cited by 27
“If we transfer our improved running time bounds on the experimental results reported in [ HPS98 ] and require the security thresholds from the Lenstra-Verheul heuristic [LV01], we expect that NTRU’s security parameter needed to be more than doubled.”
BackgroundMethodResultInfluentialGupta, D. S. (2023) · IEEE Systems Journal · doi:10.1109/jsyst.2023.3335217 · Cited by 28
“Recently, different cryptographic tools have been proposed by using the lattice hard assumptions [21], [22], [23], [24], [25], [26], [27].”
MethodLearning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography
Sabani, M. E., Savvas, I. Κ., & Garani, G. (2024) · Signals · doi:10.3390/signals5020012 · Cited by 38
“Around the same time, in 1996, J.H. Silverman, J. Pipher and J. Hoffstein proposed another public key cryptographic scheme that can be explained via specially constructed lat-tices, the NTRU cryptosystem [36].”
BackgroundDistributed Cyber-infrastructures and Artificial Intelligence in Hybrid Post-Quantum Era
Yavuz, A. A., Nouma, S. E., Hoang, T., Earl, D., & Packard, S. (2022) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa56441.2022.00014 · Cited by 37
“Falcon is a combination GPV framework [25], NTRU lattices [26], and Fast Fourier sampling [27].”
BackgroundMethodSolving the Shortest Vector Problem in Lattices Faster Using Quantum Search
Laarhoven, T., Mosca, M., & van de Pol, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_6 · Cited by 39
“Since the late 1990s, there has been a lot of research into the area of lattice-based cryptography, resulting in encryption schemes [25, 48], digital signature schemes [19, 37] and even fully homomorphic encryption schemes [10, 20].”
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.