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 101–200 of 1,000
Post-Quantum Authentication in TLS 1.3: A Performance Study
Sikeridis, D., Kampanakis, P., & Devetsikiotis, M. (2020) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24203 · Cited by 216
“The lattice problems NIST PQ signature candidates depend on are learning with errors (LWE) [77], ring learning with errors (RLWE) [59], module learning with rounding or errors (MLWR or MLWE) and NTRU [41].”
BackgroundInfluentialA Survey of Security in SCADA Networks: Current Issues and Future Challenges
Ghosh, S., & Sampalli, S. (2019) · IEEE Access · doi:10.1109/access.2019.2926441 · Cited by 154
“It is a public key scheme based on lattice-based cryptography [68], [69].”
Nguyễn, P. Q., & Stehlé, D. (2006) · Lecture notes in computer science · doi:10.1007/11792086_18 · Cited by 154
“A better understanding of their behavior should provide a better understanding of stronger reduction algorithms such as Schnorr's BKZ [27] and is thus useful to estimate the hardness of lattice problems (which is used in several public-key cryptosystems, such as NTRU [16] and GGH [11]).”
BackgroundMethodInfluentialA Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
Guo, Q., Johansson, T., & Stankovski, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53887-6_29 · Cited by 194
“1 As in NTRUEncrypt [17,16], a secure approach is to require the decoding error probability to be less than 2−κ for the κ-bit security.”
BackgroundStatistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
Micciancio, D., & Vadhan, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_17 · Cited by 152
“, the cyclic lattices of [20], or the convolutional modular lattices of NTRU [25]), or share the same lattice among different users, in order to get smaller key size or faster identification procedures.”
BackgroundInfluentialHigh-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_19 · Cited by 147
“To realize lattice-based public key encryption several proposals exists (see [10] for a comparison) like classical NTRU [31] (defined in Zq[x]/〈x−1〉), provably secure NTRU [54] (defined in Zq[x]/〈x+1〉), or a scheme based on the ring learning with errors (RLWE) problem [35, 40] (from now on referred to as RLWEenc).”
MethodInfluentialOn the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
Göttert, N., Feller, T., Schneider, M., Buchmann, J. A., & Huss, S. A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33027-8_30 · Cited by 180
cuHE: A Homomorphic Encryption Accelerator Library
Dai, W., & Sunar, B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29172-7_11 · Cited by 172
“In [28] a leveled NTRU [25][34] based FHE scheme was introduced by”
MethodOn Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Lyubashevsky, V., & Micciancio, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_34 · Cited by 192
“When it comes to the practical GGH [GGH97b] and NTRU [HPS98] cryptosystems, we cannot formally draw any implications from our findings, because ours are worst-case to worst-case reductions, and the GGH and NTRU cryptosystems lack security proofs from worst-case problems.”
BackgroundInfluentialNSS: An NTRU Lattice-Based Signature Scheme
Hoffstein, J., Pipher, J. C., & Silverman, J. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_14 · Cited by 147
Self-citationMulti-key FHE from LWE, Revisited
Peikert, C., & Shiehian, S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53644-5_9 · Cited by 150
“In [15], LTV constructed an MK-FHE scheme based on a variant of the NTRU cryptosystem [13].”
MethodImproved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Hanrot, G., & Stehlé, D. (2007) · Springer eBooks · doi:10.1007/978-3-540-74143-5_10 · Cited by 141
“Finally, one strongly suspects that in NTRU [15] the private key can be read on the coordinates of a shortest vector of the Coppersmith-Shamir lattice [8].”
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems
Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R. A., Smith-Tone, D., Tillich, J., & Verbel, J. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_17 · Cited by 155
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
Asif, R. (2021) · IoT · doi:10.3390/iot2010005 · Cited by 192
“We shall outline the basics of Ajtai-Dwork cryptosystem [88], Learning with Errors (LWE) cryptosystem [89], and N-th degree Truncated (NTRU) [90].”
MethodQuantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137
“Of the various lattice based cryptographic schemes that have been developed, the NTRU family of cryptographic al gorithms [25, 26, 27] appears to be the most practical.”
MethodMicciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
Cramer, R., Ducas, L., Peikert, C., & Regev, O. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5_20 · Cited by 191
“Representative works include [HPS98, Mic02, LMPR08, Gen09, LPR10].”
BackgroundRevisiting Lattice Attacks on Overstretched NTRU Parameters
Kirchner, P., & Fouque, P.-A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_1 · Cited by 133
“NTRU has been introduced by Hoffstein, Pipher and Silverman since 1996 in [26] and has since resisted many attacks [13,22,21,27].”
BackgroundAnalyzing Blockwise Lattice Algorithms Using Dynamical Systems
Hanrot, G., Pujol, X., & Stehlé, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_25 · Cited by 141
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Laarhoven, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_1 · Cited by 171
“its presumed resistance against quantum attacks [14], average-case hardness guarantees [3], the existence of lattice-based fully homomorphic encryption schemes [21], and efficient cryptographic primitives like NTRU [23].”
BackgroundA Survey of Public-Key Cryptographic Primitives in Wireless Sensor Networks
Shim, K.-A. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2459691 · Cited by 131
“Lattices have been studied by cryptographers for quite some time, both in the field of cryptanalysis [130]–[132] and as a source of hard problems on which to build encryption schemes [133]–[135].”
BackgroundLearning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Nguyễn, P. Q., & Regev, O. (2006) · Lecture notes in computer science · doi:10.1007/11761679_17 · Cited by 130
On the Complexity of the Rank Syndrome Decoding Problem
Gaborit, P., Ruatta, O., & Schrek, J. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2511786 · Cited by 155
“In particular when looking at the exponential complexity of [7] and [25], it is striking that the exponential does not depend on the length the code.”
BackgroundPreserving privacy in speaker and speech characterisation
Nautsch, A., Jiménez, A., Treiber, A., Kolberg, J., Jasserand, C., Kindt, E. J., Delgado, H., Todisco, M., Hmani, M. A., Mtibaa, A., et al. (2019) · Computer Speech & Language · doi:10.1016/j.csl.2019.06.001 · Cited by 187
“Efficient implementations of various HE schemes like Python-Paillier, 19 HElib, 20 the NTRU Open Source Project, or SEAL 22 have been widely used to perform computation on encrypted data.”
BackgroundThe Impact of Decryption Failures on the Security of NTRU Encryption
Howgrave-Graham, N., Nguyễn, P. Q., Pointcheval, D., Proos, J., Silverman, J. H., Singer, A., & Whyte, W. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_14 · Cited by 127
Self-citationRomán, R., Alcaraz, C., & López, J. (2007) · Mobile Networks and Applications · doi:10.1007/s11036-007-0024-2 · Cited by 124
“In [40], Gaubatz et. al. proposed the NtruEncrypt public key cryptosystem as a possible candidate.”
MethodM2M Security: Challenges and Solutions
Barki, A., Bouabdallah, A., Gharout, S., & Traoré, J. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2515516 · Cited by 145
“…in [65] the feasibility of using hardware based PKC to guarantee M2M security through an Application Specific Integrated Circuit (ASIC) implementation of two post-quantum public key cryptosystems, namely NTRUEncrypt [66], a lattice-based cryptosystem and TTS [67], a multivariate cryptosystem.”
MethodTightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Saito, T., Xagawa, K., & Yamakawa, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_17 · Cited by 130
Efficient Encryption From Random Quasi-Cyclic Codes
Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zemor, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2804444 · Cited by 122
A Survey and Comparison of Post-Quantum and Quantum Blockchains
Yang, Z., Alfauri, H., Farkiani, B., Jain, R. K., Pietro, R. D., & Erbad, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3325761 · Cited by 177
“In Table IX, we compare post-quantum and quantum blockchains in terms of the typical blockchain components and several other factors.”
MethodImproved Short Lattice Signatures in the Standard Model
Ducas, L., & Micciancio, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_19 · Cited by 128
“Lattice based cryptography [3,4], originally an area of primarily theoretical interest, has seen a tremendous growth during the last decade, due both to substantial efficiency improvements obtainable using lattices with algebraic structure [16,28], and to the enormous versatility afforded by the Learning with Errors (…”
BackgroundA Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies
Costello, C., & Hışıl, H. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_11 · Cited by 146
“Proposals here began with Hoffstein, Pipher and Silverman’s standardised NTRUEncrypt [20], and in more recent times have been based on either Regev’s learning with”
Algorithms for the Shortest and Closest Lattice Vector Problems
Hanrot, G., Pujol, X., & Stehlé, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_10 · Cited by 120
“Following the genesis of lattice-based cryptography in the mid-1990’s [4, 39, 27], whose security provably/heuristically”
BackgroundInfluentialShortest Vector from Lattice Sieving: A Few Dimensions for Free
Ducas, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78381-9_5 · Cited by 117
Shahidinejad, A., & Abawajy, J. (2024) · ACM Computing Surveys · doi:10.1145/3645087 · Cited by 134
“Since traditional public key cryptosystems, such as the ECC and RSA, cannot withstand quantum computers, several lattice-based public key methods, like the NTRU cryptosystem [80], have been developed.”
BackgroundSupersingular Isogeny Diffie-Hellman Key Exchange on 64-Bit ARM
Jalali, A., Azarderakhsh, R., Kermani, M. M., & Jao, D. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2723891 · Cited by 120
“raphy [4], hash-based cryptography [5], lattice-based cryptography including the NTRU encryption scheme [6], and isogeny-based cryptography [7].”
MethodLearning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Nguyễn, P. Q., & Regev, O. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9031-0 · Cited by 115
“NTRUS IGN [15] is a special instantiation of GGH with the compact lattices from the NTRU encryption scheme [12], which we briefly recall: we refer to [4,15] for more details.”
BackgroundIND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited
Jiang, H., Zhang, Z., Chen, L., Wang, H., & Ma, Z. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_4 · Cited by 139
“Many post-quantum PKE schemes satisfy OW-qPCA security, e.g., NTRU [26], McEliece [36], and Niederreiter [37].”
BackgroundMethodMasking Kyber: First- and Higher-Order Implementations
Bos, J. W., Gourjon, M., Renes, J., Schneider, T., & van Vredendaal, C. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i4.173-214 · Cited by 123
A Secure and Verifiable Access Control Scheme for Big Data Storage in Clouds
Hu, C., Li, W., Cheng, X., Yu, J., Wang, S., & Bie, R. (2017) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2621106 · Cited by 116
“The NTRU cryptosystem is a type of lattice-based cryptography [23], [24], [25], and its security is based on the shortest vector problem (SVP) in a lattice [26].”
BackgroundMethodInfluentialPost-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
“Notable examples: the Frodo scheme [174], NTRU [175], New Hope [176], Kyber [177].”
MethodShort Stickelberger Class Relations and Application to Ideal-SVP
Cramer, R., Ducas, L., & Wesolowski, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_12 · Cited by 138
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_27 · Cited by 125
“This is especially true in the case of signature schemes, for which there is arguably only one realistic lattice alternative: NTRUSign [11], which is an optimized instantiation of the Goldreich-Goldwasser-Halevi (GGH) signature scheme [9] using the compact lattices introduced in NTRU encryption [14] and whose performa…”
MethodYang, R., Au, M. H., Zhang, Z., Xu, Q., Yu, Z., & Whyte, W. F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_6 · Cited by 114
Chamola, V., Jolfaei, A., Chanana, V., Parashari, P., & Hassija, V. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.05.019 · Cited by 138
NTTRU: Truly Fast NTRU Using NTT
Lyubashevsky, V., & Seiler, G. (2019) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2019.i3.180-201 · Cited by 134
NTT Multiplication for NTT-unfriendly Rings
Chung, C.-M. M., Hwang, V., Kannwischer, M. J., Seiler, G., Shih, C.-J., & Yang, B. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i2.159-188 · Cited by 111
“The NTRU submission [ZCH + 19] is based on the NTRU crytosystem which was first proposed by Hoffstein, Pipher, and Silverman in 1998 [HPS98].”
Method6G white paper: Research challenges for trust, security and privacy
Ylianttila, M., Kantola, R., Gurtov, A., Mucchi, L., Oppermann, I., Yan, Z., Nguyen, T. H., Liu, F., Hewa, T., Liyanage, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2004.11665 · Cited by 106
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
Gaborit, P., & Zémor, G. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2616127 · Cited by 113
“recent LRPC cryptosystem [13] (similar to the NTRU cryptosystem [19] for lattices and the recent MDPC cryptosystem for codes) or the recent signature scheme of [15].”
MethodLattice 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
Cheon, J. H., Jeong, J., & Lee, C. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000371 · Cited by 103
“The NTRU problem is to find a pair of polynomials with small coefficients whose ratio matches a given ratio of two polynomials with small coefficients [17].”
BackgroundHigh-Performance and Lightweight Lattice-Based Public-Key Encryption
Buchmann, J. A., Göpfert, F., Güneysu, T. E., Oder, T., & Pöppelmann, T. (2016) · doi:10.1145/2899007.2899011 · Cited by 105
“A great step forward towards an effi-cient asymmetric scheme is NTRU [27] which recently moved back into focus due to the increased popularity of lattice-based cryptography and which has been successfully implemented on several architectures [5, 24].”
BackgroundMethodKnospe, H., & Pohl, H. (2004) · Information Security Technical Report · doi:10.1016/s1363-4127(05)70039-x · Cited by 103
Ke, Y., Zhang, M., Liu, J., Su, T., & Yang, X. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2963393 · Cited by 105
Post Quantum Cryptography: A Review of Techniques, Challenges and Standardizations
Bavdekar, R., Jayant Chopde, E., Agrawal, A., Bhatia, A., & Tiwari, K. (2023) · 2023 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin56518.2023.10048976 · Cited by 108
“NTRU [11] was published in 1996.”
Networked RFID Systems and Lightweight Cryptography
Ranasinghe, D. C., & Cole, P. H. (2007) · Springer eBooks · doi:10.1007/978-3-540-71641-9 · Cited by 107
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
Benhamouda, F., Camenisch, J. L., Krenn, S., Lyubashevsky, V., & Neven, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_29 · Cited by 118
“, [22, 24, 30, 35], but many of their applications in more complex primitives require efficient zero-knowledge proofs of the encrypted plaintext.”
BackgroundMethodInfluentialAn Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Kirchner, P., & Fouque, P.-A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_3 · Cited by 109
Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
Derler, D., Hanser, C., & Slamanig, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16715-2_7 · Cited by 119
High-Speed Key Encapsulation from NTRU
Hülsing, A., Rijneveld, J., Schanck, J. M., & Schwabe, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66787-4_12 · Cited by 99
“In this paper we take a step back and turn our attention to the grandfather of lattice-based encryption schemes , namely NTRU [26], with the goal of constructing a CCA2-secure key encapsulation mechanism (KEM).”
BackgroundMethodInfluentialMulti-bit Cryptosystems Based on Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-71677-8_21 · Cited by 99
“Key recovery and message attacks on NTRU-composite.”
BackgroundMethodInfluentialLattice-Based Public Key Cryptosystem for Internet of Things Environment: Challenges and Solutions
Chaudhary, R., Aujla, G. S., Kumar, N., & Zeadally, S. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2878707 · Cited by 111
“[15] which was followed by an improved version released in 2003 [16].”
BackgroundKey Recovery and Message Attacks on NTRU-Composite
Gentry, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_12 · Cited by 97
Choosing Parameters for NTRUEncrypt
Hoffstein, J., Pipher, J. C., Schanck, J. M., Silverman, J. H., Whyte, W., & Zhang, Z. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-52153-4_1 · Cited by 95
Self-citationRaptor: A Practical Lattice-Based (Linkable) Ring Signature
Lu, X., Au, M. H., & Zhang, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21568-2_6 · Cited by 93
“In practice, one often resorts to NTRU lattices [34] for better efficiency.”
BackgroundCao, J. P., Yu, P., Xiang, X., Ma, M., & Li, H. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2931724 · Cited by 95
“researchers have proposed new cryptographic schemes based on lattice difficulties [27], [28].”
BackgroundState-of-the-Art Survey of Quantum Cryptography
Kumar, A., & Garhwal, S. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09561-2 · Cited by 122
“Lattice-based cryptography NTRU public cryptosystem [290]”
BackgroundPractical CCA2-Secure and Masked Ring-LWE Implementation
Oder, T., Schneider, T., Pöppelmann, T., & Güneysu, T. E. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i1.142-174 · Cited by 95
Lattice-Based Public Key Searchable Encryption from Experimental Perspectives
Behnia, R., Ozmen, M. O., & Yavuz, A. A. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2018.2867462 · Cited by 93
“Hoffstein et al. [23] proposed a very efficient public key encryption scheme based on NTRU lattices.”
BackgroundAbout the XL Algorithm over GF(2)
Courtois, N. T., & Patarin, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_10 · Cited by 91
Finding shortest lattice vectors faster using quantum search
Laarhoven, T., Mosca, M., & van de Pol, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0067-5 · Cited by 115
“Ludwig also details the effect that this faster quantum algorithm would have had on the practical security of the lattice-based encryption scheme NTRU [39], had there been a quantum computer in 2005.”
BackgroundHalevi, S., & Shoup, V. (2021) · Journal of Cryptology · doi:10.1007/s00145-020-09368-7 · Cited by 109
“implementation by Gentry and Halevi [12] of Gentry’s original cryptosystem [11], the implementation of Coron, Lepoint, and Tibouchi [6–8] of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) scheme over the integers [9], and the implementation by Rohloff and Cousins [27] of the NTRU-based cryptosystem [20,21].”
MethodFast Fourier Orthogonalization
Ducas, L., & Prest, T. (2016) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2930889.2930923 · Cited by 89
“This use case allows a helpful extra degree of freedom: one may permute rows and columns of the lattice basis since this leaves the generated lattice unchanged —up to an isometry.”
Batalla, J. M., Vasilakos, A. V., & Gajewski, M. (2017) · ACM Computing Surveys · doi:10.1145/3122816 · Cited by 99
“The first objective may be achieved by running good practices (see Section 6 for details) avoiding communication directly with constrained nodes, whereas the second objective may be fulfilled by using one of the public keys encryption algorithms suitable for communicating constrained nodes: Rabin’s Scheme [43], NtruEn…”
BackgroundChoosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3
Howgrave-Graham, N., Silverman, J. H., & Whyte, W. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_10 · Cited by 90
Self-citationA New Algorithm for Solving the Rank Syndrome Decoding Problem
Aragon, N., Gaborit, P., Hauteville, A., & Tillich, J. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437464 · Cited by 98
“These codes are similar to the MDPC codes in the Hamming metric [10] or the NTRU cryptosystem in the Euclidean metric [11] and have a poor algebraic structure, which ensures a good resilience against structural attacks.”
MethodImmunizing Encryption Schemes from Decryption Errors
Dwork, C., Naor, M., & Reingold, O. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_21 · Cited by 88
“However, some cryptosystems do not satisfy this condition, two notable examples being the Ajtai-Dwork cryptosystem [1] and NTRU [23].”
BackgroundLow Rank Parity Check codes and their application to cryptography
Gaborit, P., Murat, G., Ruatta, O., & Zémor, G. (2013) · HAL · Cited by 87
Area optimization of lightweight lattice-based encryption on reconfigurable hardware
Pöppelmann, T., & Güneysu, T. E. (2014) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2014.6865754 · Cited by 87
“1 An exception is the NTRU public key encryption scheme [10] which is still considered secure and very efficient but protected by patents and defined in Zq[x]/x n − 1. use 37 slices for the sampler (excluding a random bit source).”
BackgroundBatched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension
Chen, L., Zhang, Z., & Wang, X. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70503-3_20 · Cited by 98
Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
Hirschhorn, P., Hoffstein, J., Howgrave-Graham, N., & Whyte, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_27 · Cited by 85
Self-citationNew lattice based cryptographic constructions
Regev, O. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780603 · Cited by 84
“, [9, 10, 13]), none of them is based on the worst case hardness of a lattice problem.”
BackgroundFast Proxy Re-Encryption for Publish/Subscribe Systems
Polyakov, Y., Rohloff, K. R., Sahu, G., & Vaikuntanathan, V. (2017) · ACM Transactions on Privacy and Security · doi:10.1145/3128607 · Cited by 91
Zamir, R. (2014) · CERN Document Server (European Organization for Nuclear Research) · Cited by 81
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_26 · Cited by 87
“In lattice-based cryptography, one mainly uses the so-called q-ary lattices, which include NTRU lattices [14,13] and Ajtai’s worst-case/average-case lattices [3].”
MethodAgrawal, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17653-2_7 · Cited by 92
Mujdei, C., Wouters, L., Karmakar, A., Beckers, A., Mera, J. M. B., & Verbauwhede, I. M. R. (2022) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3569420 · Cited by 82
“…NIST PQC competition are based on two constructions: first, Kyber [7] and Saber [21], which are both variants of the public-key encryption (PKE) scheme attributed to Lyubashevsky, Peikert, and Regev (LPR) [38], and second, NTRU-like schemes [16], which were first proposed by Hoffstein et al. [25].”
MethodA Security Framework for Nationwide Health Information Exchange based on Telehealth Strategy
Zaidan, B. B., Al-Haiqi, A., Zaidan, A. A., Abdulnabi, M. S. H., Kiah, L. M., & Muzamel, H. (2015) · Journal of Medical Systems · doi:10.1007/s10916-015-0235-1 · Cited by 81
Will quantum computers be the end of public key encryption?
Buchanan, W. J., & Woodward, A. (2016) · Journal of Cyber Security Technology · doi:10.1080/23742917.2016.1226650 · Cited by 102
“These implementations include: (1) Buchmann – Williams Key Establishment [42] (2) The NTRU Cryptosystem [43] (3) The Goldreich – Goldwasser – Halevi Cryptosystem [44] (4) The Ajtai – Dwork Cryptosystem [45] (5) The McEliece Cryptosystem [46] Early analysis of the levels of quantum resistance of these crypto schemes [4…”
BackgroundCryptography for Ultra-Low Power Devices
Kaps, J.-P. E. (2006) · Digital WPI · Cited by 74
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_3 · Cited by 87
Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR
Cheon, J. H., Kim, D., Lee, J., & Song, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_9 · Cited by 76
“We compare the performance of our CCALizard to those of NTRU [22,24] and an LWE-based PKE in [15], say CCACHK+, for the 128-bit quantum security.”
Mukherjee, S., Gupta, D. S., & Biswas, G. (2018) · Computing · doi:10.1007/s00607-018-0689-3 · Cited by 76
“However, in the subsequent years, a number of public-key cryptosystems based on the lattice hard problems [4,5,20,25,28,29,32,33,41] are proposed.”
BackgroundProxy Re-Encryption: Analysis of constructions and its application to secure access delegation
Núñez, D., Agudo, I., & López, J. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.03.005 · Cited by 91
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-citationGupta, D. S., Ray, S., Singh, T., & Kumari, M. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.09.031 · Cited by 73
Wang, W., Huang, H., Yin, Z., Gadekallu, T. R., Alazab, M., & Su, C. (2022) · Digital Communications and Networks · doi:10.1016/j.dcan.2022.10.005 · Cited by 80
“The NTRU public key cryptosystem is one of the fastest known public key cryptosystems [37].”
BackgroundExploring Post-Quantum Cryptography: Review and Directions for the Transition Process
Dekkaki, K. C., Tasic, I. A. B., & Cano, M. (2024) · Technologies · doi:10.3390/technologies12120241 · Cited by 113
A New Method for Exchanging Secret Keys
Stickel, E. U. (2005) · International Conference on Information Technology and Applications · doi:10.1109/icita.2005.33 · Cited by 75
“It is to be expected that it provides higher levels of security than the original method.”
BackgroundQuantum Algorithm Design: Techniques and Applications
Shao, C., Yang, L., & Li, H. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-9008-0 · Cited by 75
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.