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 601–700 of 1,000
Lossless Data Hiding in NTRU Cryptosystem by Polynomial Encoding and Modulation
Wu, H., Cheung, Y., Tian, Z., Liu, D., Luo, X., & Hu, J. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3362592 · Cited by 14
“The NTRU encryption was first proposed by Hoffstein et al. in [7] and regulated in IEEE P1363.”
BackgroundMethodInfluentialThe implementation of polynomial multiplication for lattice-based cryptography: A survey
Zeng, C., He, D., Feng, Q., Peng, C., & Luo, M. (2024) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2024.103782 · Cited by 14
An anonymous mobile payment protocol based on SWPP
Javan, S. L., & Bafghi, A. G. (2014) · Electronic Commerce Research · doi:10.1007/s10660-014-9151-6 · Cited by 13
“In 2009, a new standard was proposed for public key cryptography by name NTRU cryptosystem [19].”
BackgroundDiophantine Approximation Attack on a Fast Public Key Cryptosystem
Wang, B., & Hu, Y. (2006) · Lecture notes in computer science · doi:10.1007/11689522_3 · Cited by 13
Cryptanalysis of a noncommutative key exchange protocol
Micheli, G. (2015) · Advances in Mathematics of Communications · doi:10.3934/amc.2015.9.247 · Cited by 13
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem
Doröz, Y., Hoffstein, J., Pipher, J. C., Silverman, J. H., Sunar, B., Whyte, W., & Zhang, Z. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76578-5_5 · Cited by 16
“More significantly, the scheme eliminates the DSPR assumption and relies only on the standard R-LWE assumption which makes it the only NTRU variant FHE scheme immune to the Subfield Attack.”
BackgroundMethodInfluentialSelf-citationHigh-Speed High-Security Public Key Encryption with Keyword Search
Behnia, R., Yavuz, A. A., & Ozmen, M. O. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61176-1_21 · Cited by 13
“[26] proposed an efficient public key encryption scheme called NTRU-based on polynomial rings.”
MethodInteger Version of Ring-LWE and Its Applications
Gu, C. (2019) · Communications in computer and information science · doi:10.1007/978-981-15-0758-8_9 · Cited by 16
“We implemented our NTRU-type public key cryptosystem over the NTL library.”
BackgroundInfluentialSingle Trace Side Channel Analysis on NTRU Implementation
An, S., Kim, S., Jin, S., Kim, H., & Kim, H. S. (2018) · Applied Sciences · doi:10.3390/app8112014 · Cited by 14
“NTRU proposed in 1996 by Hoffstein et al. [5] is an encryption algorithm based on the shortest vector problem.”
MethodDesignated-ciphertext searchable encryption
Liu, Z., Tseng, Y., Tso, R., & Mambo, M. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102709 · Cited by 13
“Another lattice hardness assumption is the NTRU assumption, defined in [27].”
BackgroundEnd-to-end secure group communication for the Internet of Things
Lizardo, A., Barbosa, R., Neves, S., Correia, J., & Araújo, F. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102772 · Cited by 15
LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals
Melchor, C. A., Aragon, N., Dyseryn, V., Gaborit, P., & Zémor, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_3 · Cited by 14
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
Xagawa, K., & Tanaka, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04642-1_17 · Cited by 13
“There are five instantiations of NTRU, NTRU-1998 [ 12 ], NTRU-2001 [13], NTRU- 2005 [14], NTRU-2007 [11], and NTRU-2008 [27,9].”
BackgroundMethodInfluentialWeak Property of Malleability in NTRUSign
Min, S., Yamamoto, G., & Kim, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_33 · Cited by 13
“The centered norm has quasi-multiplicative property, that is, ‖ a(x) ∗ b(x) ‖≈‖ a(x) ‖ ∗ ‖ b(x) ‖ for random polynomials a(x) and b(x) in R, which was well discussed in [9].”
Gröbner bases for public key cryptography
Caboara, M., Caruso, F., & Traverso, C. E. (2008) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1390768.1390811 · Cited by 13
“NTRU [10] is a not a lattice cryptosystem, it is a polynomial algebra cryptosystem allowing a lattice interpretation.”
BackgroundMethodInfluentialNTRU-Like Public Key Cryptosystems beyond Dedekind Domain up to Alternative Algebra
Malekian, E., & Zakerolhosseini, A. (2010) · Transactions on computational science · doi:10.1007/978-3-642-17499-5_2 · Cited by 13
“The NTRU public key cryptosystem which was officially introduced in 1998 [ 10 ], is the only practical lattice-based cryptosystem that finally managed to win public trust after numerous modifications and optimizations [12] and it has now been fully standardized within IEEE P1363.1 NTRUEncrypt [14].”
BackgroundGeneric Forward-Secure Key Agreement Without Signatures
Guilhem, C. D. D. S., Smart, N. P., & Warinschi, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69659-1_7 · Cited by 13
“Many early schemes, such as GGH [13] and NTRUSign [17,15], were eventually broken due to issues with the distribution of the signatures [12,29]; however recently more promising lattice based candidates have been proposed such as [10].”
BackgroundPaterson, K. G., & Villanueva-Polanco, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71667-1_6 · Cited by 15
“In this paper, we examine the feasibility of cold boot attacks against the NTRU public key encryption scheme [12,11].”
MethodSecurity weakness of a lattice-based key exchange protocol
Gupta, D. S., Biswas, G. P., & Nandan, R. (2018) · International Conference on Recent Advances in Information Technology · doi:10.1109/rait.2018.8389018 · Cited by 13
“In the next year 1998, Hoffstein, Pipher and Silverman [22] proposed another lattice-based public key cryptosystem known to be NTRU cryptosystem and in 2001, they [23] also presented a new lattice-based signature scheme called NTRU signature scheme (NSS).”
BackgroundEfficient arithmetic for lattice-based cryptography on GPU using the CUDA platform
Akleylek, S., & Tok, Z. Y. (2014) · Signal Processing and Communications Applications Conference (SIU) · doi:10.1109/siu.2014.6830364 · Cited by 13
“Kuantum bilgisayarlar sonrası kullanılması önerilen algoritmaların başında NTRU gelmektedir [2].”
Multilinear Maps Using Ideal Lattices without Encodings of Zero.Preprint
Gu, C. (2015) · IACR Cryptology ePrint Archive · Cited by 13
Power-based Side Channel Attack Analysis on PQC Algorithms.Preprint
Kamucheka, T., Fahr, M. J., Teague, T., Nelson, A., Andrews, D. A., & Huang, M. (2021) · IACR Cryptology ePrint Archive · Cited by 12
A Comprehensive Survey on Pre Versus Post Quantum Security Schemes for 5G-Enabled IoT Applications
Choudhury, B., Hota, A., Karmakar, M., Saha, S., Nag, A., & Nandi, S. (2025) · IEEE Access · doi:10.1109/access.2025.3608623 · Cited by 22
“NTRU is a ring-based public key crypto-system widely used ever since its introduction in 1998 [166].”
Generative trapdoors for public key cryptography based on automatic entropy optimization
Zhu, S., & Han, Y. (2021) · China Communications · doi:10.23919/jcc.2021.08.003 · Cited by 12
Analogue to NTRU public key cryptosystem by multi-dimensional algebra with high security
Abo-Alsood, H. H., & Yassein, H. R. (2022) · AIP conference proceedings · doi:10.1063/5.0067033 · Cited by 12
BitGC: Garbled Circuits with 1 Bit per Gate
Liu, H., Wang, X. S., Yang, K., & Yu, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91098-2_16 · Cited by 12
“The NTRU cryptosystem, pioneered by Hoffstein, Pipher, and Silverman [HPS98], has been applied in more advanced cryptographic constructions [LTV12, GGH13a].”
Vercauteren, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85538-5_6 · Cited by 12
Identity-based aggregate signcryption in the standard model from multilinear maps
Wang, H., Liu, Z., Liu, Z., & Wong, D. S. (2015) · Frontiers of Computer Science · doi:10.1007/s11704-015-5138-2 · Cited by 12
NTRU Implementation of Efficient Privacy‐Preserving Location‐Based Querying in VANET
Mi, B., Huang, D., & Wan, S. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/7823979 · Cited by 12
“As a relatively new public key cryptosystem developed in 1996, the number theory research unit encryption (NTRU) [40] runs faster compared to other asymmetric encryption schemes and is more competitive to be realized in resource-constraint environments such as mobile devices or smart cards.”
BackgroundOn the Security of LWE Cryptosystem against Subversion Attacks
Yang, Z., Chen, R., Li, C., Qu, L., & Yang, G. (2019) · The Computer Journal · doi:10.1093/comjnl/bxz084 · Cited by 14
Benchmarking of Pre- and Post-Quantum Group Encryption Schemes with Focus on IoT
Prantl, T., Prantl, D., Bauer, A., Iffländer, L., Dmitrienko, A., Kounev, S., & Krupitzer, C. (2021) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/ipccc51483.2021.9679365 · Cited by 12
“24) milliseconds NTRU [13] (3 .”
MethodComparative Analysis of RSA and NTRU Algorithms and Implementation in the Cloud
Harjito, B., Tyas, H. N., Suryani, E., & Wardani, D. W. (2022) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2022.0130321 · Cited by 13
“The NTRU algorithm is a latticebased algorithm which refers to the lattice-based algorithm that makes the NTRU algorithm more resistant to quantum computing attacks [5], [6], [15], [16].”
MethodA quantum algorithm for searching a target solution of fixed weight
Wang, X., Bao, W., & Fu, X.-Q. (2011) · Chinese Science Bulletin · doi:10.1007/s11434-010-4113-4 · Cited by 12
“The NTRU [15] public key cryptosystem, proposed by Jeffrey et al. In 1996, has now been adopted as one of the standard public key algorithms in IEEE P1363 and EESS(Consortium for Efficient Embedded Security).”
BackgroundMethodSparse polynomial multiplication for lattice-based cryptography with small complexity
Akleylek, S., Alkım, E., & Tok, Z. Y. (2015) · The Journal of Supercomputing · doi:10.1007/s11227-015-1570-1 · Cited by 12
KEY EXCHANGE PROTOCOL USING DECOMPOSITION PROBLEM IN NEAR-RING
Ezhilmaran, D., & Muthukumaran, V. (2016) · DergiPark (Istanbul University) · Cited by 12
Characterizing NTRU-Variants Using Group Ring and Evaluating their Lattice Security.
Yasuda, T., Dahan, X., & Sakurai, K. (2015) · Cited by 12
Grote, O., Ahrens, A., & Benavente-Peces, C. (2019) · International Conference on Pervasive and Embedded Computing and Communication Systems · doi:10.5220/0008162800910098 · Cited by 16
“The NTRU algorithm which is based on the principles of the Ring-LWE 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) (Hoffstein et al., 1998).”
MethodA Panorama of Post-quantum Cryptography
Barreto, P. S. L. M., Biasi, F. P., Dahab, R., López-Hernández, J. C., Morais, E., de Oliveira, A. D. S., Pereira, G. C. C. F., & Ricardini, J. E. (2014) · Springer eBooks · doi:10.1007/978-3-319-10683-0_16 · Cited by 16
Efficient and scalable FPGA design of GF(2m) inversion for post-quantum cryptosystems
Galimberti, A., Montanaro, G., & Zoni, D. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2022.3149422 · Cited by 12
“Submitted proposals span over a wide portion of the state of the art in computational theory, including algebraic geometry [6], coding theory [7], and lattice theory [8].”
BackgroundCertification of the QR factor R and of lattice basis reducedness
Villard, G. (2007) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1277548.1277597 · Cited by 12
“…error bound for | R − R using operations in F only. e Our error bound for | R − R is given by a matrix H ∈ F n × n with positive entries such that (see (9) on page 7): e e Since floating point numbers are rational numbers, when R and E are known, (1) provides a rigourous mathematical…”
BackgroundCryptanalysis of the GGH Cryptosystem
Lee, M. S., & Hahn, S. G. (2010) · Mathematics in Computer Science · doi:10.1007/s11786-009-0018-5 · Cited by 12
NTRUSign With a New Perturbation
Hu, Y., Wang, B., & He, W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924662 · Cited by 12
Attacking an AES-Enabled NFC Tag: Implications from Design to a Real-World Scenario
Korak, T., Plos, T., & Hutter, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29912-4_2 · Cited by 12
“Well-known examples are symmetric-key schemes like the Advanced Encryption Standard (AES) [7,9,20] and PRESENT [25], or public-key schemes like Elliptic Curve Cryptography (ECC) [1,2,10,27] and NTRU [11].”
BackgroundNTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model
Steinfeld, R., Ling, S., Pieprzyk, J., Tartary, C., & Wang, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_21 · Cited by 15
A Verifiable (k,n,m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem
Amroudi, A. N., Zaghain, A., & Sajadieh, M. (2017) · Wireless Personal Communications · doi:10.1007/s11277-017-4245-9 · Cited by 12
“Note that, the NTRU cryptosystem, which is a lattice based cryptosystem, has a fast and practical encryption and decryption algorithms [14].”
BackgroundMethodInfluentialLattice Reduction Over Imaginary Quadratic Fields
Lyu, S., Porter, C., & Ling, C. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3036647 · Cited by 12
“To crack the private key based on the given public keyh ∈ R Z[x]/Φm(x) in the celebrated NTRU system, we need to find short vectors in a module-lattice Λ(B) [35], [36], [50], whose 2× 2 basis is defined by”
BackgroundMethodJun, J., & He, C. (2005) · Journal of Zhejiang University. Science A · doi:10.1631/jzus.2005.a0399 · Cited by 12
Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003
Han, D., Kim, M.-H., & Yeom, Y. (2007) · Springer eBooks · doi:10.1007/978-3-540-71677-8_8 · Cited by 12
“In attack against GGH, expected-gaps are small and do not increase as the lattice dimension n increases [12], and in attack against NTRUEncrypt, they increase but are bounded by about 0.25 √ n [7].”
BackgroundInfluentialQuantum Warfare: Definitions, Overview and ChallengesPreprint
Krelina, M. (2021) · arXiv (Cornell University) · Cited by 12
Sowa, J., Hoang, B., Yeluru, A., Qie, S., Nikolich, A., Iyer, R., & Cao, P. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00213 · Cited by 15
A novel identity-based multi-signature scheme over NTRU lattices
Chen, X., Huang, Q., Li, H., Liao, Z., & Susilo, W. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.08.022 · Cited by 11
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Aikata, A., Basso, A., Cassiers, G., Mert, A. C., & Roy, S. S. (2023) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i3.366-390 · Cited by 14
“Our contributions are therefore directly applicable to implementations of algorithms such as SABER [BMD + 20], Scabbard [MKKV21], NTRU [HPS06] or LAC [LLZ + 18].”
MethodNTWE: A Natural Combination of NTRU and LWE
Gärtner, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_12 · Cited by 11
“NTRU was introduced more than 25 years ago as a ring-based public key cryptosystem [12].”
BackgroundChen, Y.-J., Hsu, C.-L., Lin, T., & Lee, J.-S. (2024) · Electronics · doi:10.3390/electronics13081575 · Cited by 14
“The NTRU is more efficient than traditional cryptographic mechanisms and can be implemented in devices with restricted resources, such as AIoT, embedded devices, etc. [22–24].”
BackgroundMethodInfluentialPulido-Gaytan, L. B., & Tchernykh, A. N. (2024) · PLoS ONE · doi:10.1371/journal.pone.0306420 · Cited by 14
Temara, S., Bhagyalakshmi, L., Suman, S. K., Shakunthala, M., Chitra, N. T., & Golla¹, K. (2025) · International Conference on Computer, Electrical & Communication Engineering (ICCECE) · doi:10.1109/iccece61355.2025.10940245 · Cited by 12
A new perturbation algorithm and enhancing security of SFLASH signature scheme
Wang, H., Zhang, H., Guan, H., & Han, H. (2010) · Science China Information Sciences · doi:10.1007/s11432-010-0025-9 · Cited by 11
“There are mainly NTRU [ 2 ], OUT2000 [3], MPKCs [4] and so on, which are currently believed to be resistant to quantum computing based attacks.”
BackgroundOn Ideal Lattices and Learning with Errors Over Rings.
Lyubashevsky, V., Peikert, C., & Regev, O. (2012) · Cited by 11
Architecture and key technologies of cyberspace security
Ling, Z., Yang, M., Wu, W., Luo, J., & Gu, X. (2016) · Scientia Sinica Informationis · doi:10.1360/n112016-00090 · Cited by 14
KeyShield: A Scalable and Quantum-Safe Key Management Scheme
Aldarwbi, M., Ghorbani, A. A., & Lashkari, A. H. (2020) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2020.3046110 · Cited by 11
“…of seven main steps: 1) the key server collects the members’ public keys [ pk 1 · · · pk n ] of a quantum-safe cryptographic system such as NTRU [12] ; 2) the key server generates the members’ secret vectors [ A 1 · · · A n ] ; 3) the key server sends the members’ secret vectors encrypted using…”
BackgroundPerformance Analysis of the Quantum Safe Multivariate Polynomial Public Key Algorithm
Kuang, R., & Barbeau, M. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00052 · Cited by 16
Area-Optimized Constant-Time Hardware Implementation for Polynomial Multiplication
Khan, S., Lee, W., Khalid, A., Majeed, A., & Hwang, S. O. (2022) · IEEE Embedded Systems Letters · doi:10.1109/les.2022.3185265 · Cited by 11
“The NTRU scheme was introduced in Crypto’96 [2] and was approved as IEEE P1363.”
MethodHybrid Dual and Meet-LWE Attack
Bi, L., Lu, X., Luo, J., & Wang, K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22301-3_9 · Cited by 17
“Recently, May [27] introduced a new combinatorial attack, named Meet-LWE, on ternary LWE that significantly improves over Odlyzko’s Meet-in-the-Middle (MitM) attack [24].”
BackgroundAn Efficient Ring Polynomial Multiplication Accelerator for Homomorphic Encryption
Ren, J., Du, G., Li, Z., Jia, X., Liao, Q., Wang, X., & Zhang, D. (2023) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2023.3295614 · Cited by 11
“A branch of solutions developed from latticed theory, especially learning with error (LWE) and ring learning with error (RLWE), have led to new directions such as BGV [1], BFV [2], GSW [3], and schemes in NTRU [4].”
BackgroundLWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)
Dehkordi, M. H., Farahi, S. T., & Mashhadi, S. (2023) · IET Image Processing · doi:10.1049/ipr2.13006 · Cited by 11
Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems
Malygina, E. S., Kutsenko, A. V., Novoselov, S. A., Kolesnikov, N. S., Bakharev, A. O., Сергеевна, Х. И., Shaporenko, A. S., & Tokareva, N. (2023) · Journal of Applied and Industrial Mathematics · doi:10.1134/s1990478923040087 · Cited by 14
“At the Crypto’96 conference and later in the paper [39], the NTRU cryptosystem was presented as an alternative to the RSA cryptosystem [52], which is susceptible to attacks using Shor’s quantum algorithm [11].”
STP‐LWE: A Variant of Learning with Error for a Flexible Encryption
Gao, B., Shi, Y., Yang, C., Li, L., Wang, L., & Yang, Y. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/341490 · Cited by 11
Postquantum SSL/TLS for Embedded Systems
Chang, Y.-A., Chen, M.-S., Wu, J.-S., & Yang, B. (2014) · IEEE International Conference on Service-Oriented Computing and Applications (SOCA) · doi:10.1109/soca.2014.23 · Cited by 11
SN-SEC: a secure wireless sensor platform with hardware cryptographic primitives
Moh’d, A., Aslam, N., Phillips, W., Robertson, W., & Marzi, H. (2012) · Personal and Ubiquitous Computing · doi:10.1007/s00779-012-0563-9 · Cited by 11
Secure Computation on Cloud Storage
Gupta, D. S., & Biswas, G. P. (2015) · Journal of Cases on Information Technology · doi:10.4018/jcit.2015070103 · Cited by 11
R-LWE based lightweight privacy preserving scheme for Smart Grid
Agarkar, A. A., & Agrawal, H. (2016) · International Conference on Computing, Analytics and Security Trends · doi:10.1109/cast.2016.7915004 · Cited by 11
“Lattice based cryptography is based on finding short almost-orthogonalized vectors [26].”
BackgroundOptimizing polynomial convolution for NTRUEncrypt
Dai, W., Whyte, W. F., & Zhang, Z. (2018) · IEEE Transactions on Computers · doi:10.1109/tc.2018.2809723 · Cited by 13
Secure northbound interface for SDN applications with NTRU public key infrastructure
Natanzi, S. B. H., & Majma, M. R. (2017) · International Conference on Knowledge-Based Engineering and Innovation · doi:10.1109/kbei.2017.8325020 · Cited by 11
“An advantage over the RSA is that the NTRU needs O ( ) operation and the length of the O ( ) key, while the RSA operation is performed with O ( ) and has the key length equal to O ( ) [12] , in addition, generating the public key and the private key in the NTRU is much simpler than RSA and for this reason, keys can be…”
MethodNew quantum secure key exchange protocols based on MaTRU
Akleylek, S., & Kaya, N. (2018) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs.2018.8355362 · Cited by 11
“They mainly used the idea of [9], [11].”
BackgroundMethodInfluentialAn Efficient Algorithm for the Shortest Vector Problem
Chuang, Y.-L., Fan, C., & Tseng, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2876401 · Cited by 11
An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives
Easttom, C. (2019) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc.2019.8666459 · Cited by 12
“Furthermore, Nayak, Nanda, Awasthi, and Kumar (2015) provided a general overview of NTRU cryptography.”
BackgroundInfluentialIdentity based blind signature scheme over NTRU lattices
Singh, S., & Padhye, S. (2019) · Information Processing Letters · doi:10.1016/j.ipl.2019.105898 · Cited by 12
Implementation Attacks on Post-Quantum Cryptographic Schemes.
Taha, M. M. I., & Eisenbarth, T. (2015) · Cited by 12
An efficient and light weight polynomial multiplication for ideal lattice-based cryptography
Yadav, V. K., Verma, S., & Venkatesan, S. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09706-8 · Cited by 12
“This FFT based technique was initially used NTRU based encryption scheme [16].”
BackgroundMethodA Pragmatic Analysis of Pre- and Post-Quantum Cyber Security Scenarios
Ali, A. (2021) · International Bhurban Conference on Applied Sciences and Technology (IBCAST) · doi:10.1109/ibcast51254.2021.9393278 · Cited by 11
“Alternate MHPs (see [21], [22] for more details) for designing PKC systems, are also currently being vigorously explored.”
BackgroundPost-quantum blind signcryption scheme from lattice
Yu, H., & Bai, L. (2021) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2000099 · Cited by 12
“Scholars proposed some public key cryptosystems from lattice, such as GGH (Garg et al., 2013), NTRU (Hoffstein et al., 1998), and Regev (Regev, 2009) systems.”
BackgroundKwant, R., Lange, T., & Thissen, K. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_17 · Cited by 11
“This paper studies lattice-based encryption, in particular the NTRU [7] family of encryption schemes and signature schemes and shows how to turn them into klepto schemes with an ECC-based backdoor.”
BackgroundMethodInfluentialQuantum Secure Communication Between Service Provider and Sim
Karacan, E., Karakaya, A., & Akleylek, S. (2022) · IEEE Access · doi:10.1109/access.2022.3186306 · Cited by 12
Entropic Hardness of Module-LWE from Module-NTRU
Boudgoust, K., Jeudy, C., Roux-Langlois, A., & Wen, W. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22912-1_4 · Cited by 11
“The Learning With Errors ( LWE ) [Reg05] and NTRU [HPS98] problems are the most widespread computational assumptions for designing lattice-based cryptosystems.”
BackgroundAn efficient statistical zero-knowledge authentication protocol for smart cards
Dousti, M. S., & Jalili, R. (2015) · International Journal of Computer Mathematics · doi:10.1080/00207160.2015.1011629 · Cited by 11
“For instance, for keys of length N , an NTRU cipher can be decrypted using O ( N 2 ) operations, while an RSA cipher requires O ( N 3 ) operations to be decrypted [17].”
MethodAn efficient quantum meet-in-the-middle attack against NTRU-2005
Wang, H., Ma, Z., & Ma, C.-G. (2013) · Chinese Science Bulletin · doi:10.1007/s11434-013-6020-y · Cited by 13
“There have been several different versions of NTRU [9,10].”
BackgroundChangeable Threshold Signature Scheme Based on Lattice Theory
Feng, T., Gao, Y., & Ma, J. (2010) · International Conference on E-Business and E-Government · doi:10.1109/icee.2010.335 · Cited by 11
“Compared with the traditional public key cryptosystem such as RSA and ECC, NTRU cryptosystem can be run more efficiently [7].”
MethodYan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_8 · Cited by 13
A wrap error attack against NTRUEncrypt
Meskanen, T., & Renvall, A. (2005) · Discrete Applied Mathematics · doi:10.1016/j.dam.2005.03.019 · Cited by 11
“The NTRU cryptosystem was first presented in 1998 [4].”
MethodOn estimating the lattice security of NTRU.
Howgrave-Graham, N., Hoffstein, J., Pipher, J. C., & Whyte, W. (2005) · Cited by 11
Self-citationA signature scheme from Learning with Truncation.Preprint
Hoffstein, J., Pipher, J. C., Whyte, W., & Zhang, Z. (2017) · IACR Cryptology ePrint Archive · Cited by 12
Self-citationA Survey of Microarchitectural Side-channel Vulnerabilities, Attacks and Defenses in CryptographyPreprint
Lou, X., Zhang, T., Jiang, J., & Zhang, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.14244 · Cited by 11
“For instance, NTRU [95] utilizes simple polynomial multiplication in the ring of truncated polynomials.”
MethodAlgebraically Structured LWE, Revisited
Peikert, C., & Pepin, Z. (2024) · Journal of Cryptology · doi:10.1007/s00145-024-09508-3 · Cited by 13
Toward Efficient Homomorphic Encryption for Outsourced Databases through Parallel Caching
Tawose, O. T., Dai, J., Yang, L., & Zhao, D. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3588920 · Cited by 16
“This requirement should not be confused with specific addition and multiplication parameters, such as Symmetria [57] and NTRU [34].”
Emerging Applications and Challenges in Quantum Computing: A Literature Survey
Garewal, I. K., Mahamuni, C. V., & Jha, S. (2024) · International Conference on Artificial Intelligence, Big Data, Computing and Data Communication Systems (icABCD) · doi:10.1109/icabcd62167.2024.10645271 · Cited by 12
“Notable candidates for post-quantum cryptography include NTRUEncrypt, a lattice-based encryption scheme, and McEliece, a code-based encryption system, both of which are considered robust against classical and quantum attacks [40].”
BackgroundNTRU-CLS: Efficient quantum-resistant NTRU lattice-based certificateless signature scheme for VANETs
Xiong, W., Wang, Y., & Wei, Y. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110885 · Cited by 10
Exploring Post-Quantum Cryptographic Algorithms for Secure Data Transmission
Gulomov, S., Рустамович, Х. Т., Ravshanova, M. X., Turdiyev, T. T., & Atabayev, S. S. (2024) · IEEE International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE) · doi:10.1109/piere62470.2024.10805050 · Cited by 13
“By examining current findings, we aim to provide insights into the effectiveness of these algorithms in establishing a robust cryptographic infrastructure ready to resist quantum threats [5].”
PQNTRU: Acceleration of NTRU-Based Schemes via Customized Post-Quantum Processor
Ye, Z., Huang, J., Huang, T. W., Bai, Y., Li, J., Zhang, H., Li, G., Chen, D., Cheung, R. C. C., & Huang, K. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3540647 · Cited by 11
“Specifically, the NTRUEn-crypt [22] consists of the triple integer parameters ( n, p, q ) , where p, q are co-prime number gcd ( p, q ) = 1 with q being considerably larger than p , and n is the degree parameter.”
BackgroundMethodInfluentialComputing with Data Privacy: Steps toward Realization
Archer, D. W., & Rohloff, K. R. (2015) · IEEE Security & Privacy · doi:10.1109/msp.2015.3 · Cited by 10
LWE from non-commutative group rings
Cheng, Q., Zhang, J., & Zhuang, J. (2021) · Designs Codes and Cryptography · doi:10.1007/s10623-021-00973-6 · Cited by 11
“can be done on small numbers. No large number exponentiations are needed, which tend to slow down the other public key cryptosystems. It does have a major drawback in key sizes. The NTRU cryptosystem [20] is the first successful cryptosystem based on lattices. 3.1 Regev’s scheme Regev [32] introduced the Learning With…”
BackgroundInfluential
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.