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 901–1,000 of 1,000
Cryptanalysis of Internet of Things (IoT) Wireless Technology
Mirtskhulava, L., Globa, L. S., Meshveliani, N., & Gulua, N. (2019) · International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo) · doi:10.1109/ukrmico47782.2019.9165363 · Cited by 7
“Main arithmetic operation for securing the NTRU cryptosystem relies on two mixing polynomial systems using prime p and q integers reduction modulo for encryption and unfixing ones for decryption [2].”
BackgroundMethodQTRU: A Lattice Attack Resistant Version of NTRU PKCS Based on Quaternion Algebra
Malekian, E., Zakerolhosseini, A., & Mashatan, A. (2009) · Cited by 6
A lower dimension lattice attack on NTRU
Yang, Z., Fu, S., Qu, L., & Li, C. (2017) · Science China Information Sciences · doi:10.1007/s11432-017-9175-y · Cited by 6
Practical Evaluation of Masking for NTRUEncrypt on ARM Cortex-M4
Schamberger, T., Mischke, O., & Sepúlveda, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-16350-1_14 · Cited by 6
Generating a Random String with a Fixed Weight
Drucker, N., & Gueron, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-20951-3_13 · Cited by 8
A Generic Conversion with Optimal Redundancy
Cui, Y., Kobara, K., & Imai, H. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_9 · Cited by 6
“Thus, it is convenient to implement both deterministic primitive like RSA or Rabin, and probabilistic primitive like ElGamal with our conversion, even NTRU [16].”
MethodCryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems
Bao, F., Deng, R. H., Geiselmann, W., Schnorr, C. P., Steinwandt, R., & Wu, H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_11 · Cited by 6
Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS
Schanck, J. M. (2015) · UWSpace (University of Waterloo) · Cited by 6
A usability study of post-quantum algorithms
Kindberg, M. (2017) · Lund University Publications Student Papers (Lund University) · Cited by 7
New Fully Homomorphic Encryption over the Integers.Preprint
Gu, C. (2011) · IACR Cryptology ePrint Archive · Cited by 6
Karakaya, A. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110415 · Cited by 7
CBPSPX: A CUDA-Based Batch Parallel Optimization of Post-Quantum Signature SPHINCS +
Wu, J., Yu, Y., Chen, Z., Yang, H., Li, C., & Liu, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3585558 · Cited by 6
“In 2022, Señor et al. [14] improved the performance of NTRU scheme [15] by using existing hardware peripherals in modern microcontrollers for IoT.”
The Mathematical Foundation of Post-Quantum Cryptography
Zong, C. (2025) · Research · doi:10.34133/research.0801 · Cited by 12
“The computational hardness of integer factorization is the security guarantee of the RSA cryptosystem.”
FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism
Glabush, L., Longa, P., Naehrig, M., Peikert, C., Stebila, D., & Virdia, F. (2025) · IACR Communications in Cryptology · doi:10.62056/ayivom2hd · Cited by 9
A Broadcast Attack against NTRU Using Ding's Algorithm.
Pan, Y., & Deng, Y. (2010) · Cited by 5
Gagliardoni, T., Karvelas, N. P., & Katzenbeisser, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_23 · Cited by 5
“quantum adversaries, new cryptographical constructions [25, 7, 4] have been proposed, that are based on mathematical problems which are believed to be quantum-hard [32, 35, 13].”
BackgroundAn Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2019) · HAL · doi:10.48550/arxiv.1910.00810 · Cited by 5
Using Error-Correcting Codes to Ensure Information Security of Unmanned Vehicles and IoT Systems
Pankov, K. N., & Глухов, М. М. (2022) · 2018Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO) · doi:10.1109/synchroinfo55067.2022.9840949 · Cited by 5
2F - A New Method for Constructing Efficient Multivariate Encryption Schemes
Smith-Tone, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_10 · Cited by 5
“The first post-quantum cryptosystem to employ modulus switching was NTRU, see [31].”
MethodSinai, N. K., & In, H. P. (2024) · IEEE Access · doi:10.1109/access.2024.3351830 · Cited by 8
Secure data sharing technology of medical privacy data in the Web 3.0
Guo, S., Chen, C., & Tong, Q. (2024) · IET Blockchain · doi:10.1049/blc2.12086 · Cited by 5
Unveiling Samsung Quantum Galaxy: Securing Smartphones With Quantum and Post-Quantum Cryptography
Alibrahim, O. (2025) · IEEE Access · doi:10.1109/access.2025.3563826 · Cited by 8
“For secure messaging, the SMP is enabled, and encryption algorithms, preferably post-quantum cryptographic algorithms such as SPHINCS+ [17] or NTRUEncrypt [46], are configured to ensure end-to-end encryption for all message exchanges.”
On Algebraic Homomorphic Encryption and Its Applications to Doubly-Efficient PIR
Okada, H., Player, R., Pohmann, S., & Weinert, C. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91095-1_2 · Cited by 5
Silverman, J. H., Smart, N. P., & Vercauteren, F. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30598-9_20 · Cited by 5
“NTRU [7] is a public key encryption scheme whose security is based on a polynomial factorisation problem in the ring Zq[X](X − 1).”
InfluentialSelf-citationA Novel Combinatorial Public Key Cryptosystem
Wang, B., & Hu, Y. (2010) · Informatica · doi:10.15388/informatica.2010.308 · Cited by 5
Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC’08
Li, H., Liu, R., Nitaj, A., & Pan, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93638-3_26 · Cited by 5
“Based on GGH framework, Hoffstein, Howgrave-Graham, Pipher, Sil-verman, and Whyte [10] presented the NTRUSign as a more efficient lattice-based signature scheme.”
MethodMoldovyan, N. A., & Abrosimov, I. K. (2019) · Vestnik of Saint Petersburg University Applied Mathematics Computer Science Control Processes · doi:10.21638/11701/spbu10.2019.205 · Cited by 5
Hashim, H. R., Molnár, A., & Tengely, S. (2021) · Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti · doi:10.21857/yrvgqtexl9 · Cited by 5
Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures
Das, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-66626-2_9 · Cited by 5
Lightweight and Low-Latency AES Accelerator Using Shared SRAM
Lee, J. S., Choi, P., & Kim, D. K. (2022) · IEEE Access · doi:10.1109/access.2022.3156291 · Cited by 8
“Similarly, the proposed method can be applicable to other ideal lattice-based cryptosystems, such as NTRU [19].”
MethodSecured and Quantum Resistant Key Exchange Cryptography Methods – A Comparison
Bansod, S., & Ragha, L. L. (2022) · Interdisciplinary Research in Technology and Management (IRTM) · doi:10.1109/irtm54583.2022.9791580 · Cited by 5
Threshold Homomorphic Encryption From Provably Secure NTRU
Xu, K., Tan, B. H. M., Wang, L., Aung, K. M. M., & Wang, H. (2022) · The Computer Journal · doi:10.1093/comjnl/bxac126 · Cited by 5
Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
Koblitz, N., Samajder, S., Sarkar, P., & Singha, S. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2022082 · Cited by 5
Security Analysis of Hybrid Attack for NTRU-Class Encryption Schemes
Levina, A. B., Kadykov, V., & Valluri, M. R. (2023) · IEEE Access · doi:10.1109/access.2023.3321693 · Cited by 8
“The NTRU encryption scheme was proposed by Hoffstein, Pipher, and Silverman in 1998 [9].”
MethodKwak, H., Lee, D., Song, Y., & Wagh, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-54773-7_16 · Cited by 9
“L´opez-Alt et al. [33] designed the first MKHE from NTRU [29], and [22, 37, 39] studied multi-key variants of GSW [26].”
BackgroundToken open secure and practical NTRU-based updatable encryption
Song, Y., Gao, H., Wang, S., Ma, C., & Sun, K. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-05962-9 · Cited by 5
“In the research of NTRU-like encryption system, Hoffstein et al. [11] proposed the NTRU public-key cryptosystem in 1996, which is based on the NTRU assumption on the NTRU lattice.”
Performance comparison of quantum-safe multivariate polynomial public key encapsulation algorithm
Kuang, R., Perepechaenko, M., Toth, R., & Barbeau, M. (2024) · EURASIP Journal on Information Security · doi:10.1186/s13635-024-00170-7 · Cited by 5
More Efficient Lattice-Based Electronic Voting from NTRU
Hough, P., Sandsbråten, C., & Silde, T. (2025) · IACR Communications in Cryptology · doi:10.62056/a69qudhdj · Cited by 5
“Our analysis and applications can naturally be extended to the module setting, so for ease of presentation, we use the basic (polynomial) NTRU formulation [HPS98].”
Somewhat Homomorphic Encryption from Linear Homomorphism and Sparse LPN
Corrigan-Gibbs, H., Henzinger, A., Kalai, Y. T., & Vaikuntanathan, V. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91124-8_1 · Cited by 9
NTRU-MCF: A Chaos-Enhanced Multidimensional Lattice Signature Scheme for Post-Quantum Cryptography
Wang, R., Yuan, B., Yuan, M., & Li, Y. (2025) · Sensors · doi:10.3390/s25113423 · Cited by 6
“Recent studies [14,15] indicate that increasing lattice dimensions exponentially amplifies SVP complexity, offering a promising avenue for enhanced quantum resistance.”
Signing and Verifying Certificates by NTRU and RSA Algorithms
Elbasheer, M. O., & Mohammed, T. (2015) · International Conference on Cloud Computing · doi:10.1109/cloudcomp.2015.7149655 · Cited by 5
“As a result the use of NTRU can help because of the creations of key is easy, also its high speed, and appropriate with low memory requirements [14].”
BackgroundA general construction for monoid-based knapsack protocols
Micheli, G., & Schiavina, M. (2014) · Advances in Mathematics of Communications · doi:10.3934/amc.2014.8.343 · Cited by 5
“After the idea of public key cryptography was presented in [1], only few more public key encryption schemes were developed such as the RSA [2], the El Gamal [3], the McEliece cryptosystem [4], the NTRU [5] or the HFE [6] (for an overview [7, 8]).”
MethodLower Bounds of Shortest Vector Lengths in Random NTRU Lattices
Bi, J., & Cheng, Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29952-0_18 · Cited by 5
On Public Key Encryption from Noisy Codewords
Ben‐Sasson, E., Bentov, I., Damgård, I., Ishai, Y., & Ron‐Zewi, N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49387-8_16 · Cited by 5
“For instance, it does not capture the code-based McEliece cryptosystem and its variants [30] [35], as well as lattice-and LWE-based cryptosystems such as [2] [18] [21] [38] [29] [4] [34] [31].”
BackgroundA Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples
Montgomery, H. W. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_15 · Cited by 5
Characterizing overstretched NTRU attacks
Micheli, G. D., Heninger, N., & Shani, B. (2020) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2015-0055 · Cited by 5
Homomorphic Encryption for Big Data Security A Survey
AL‐Rummana, G. A., & Shende, G. N. (2018) · International Journal of Computer Sciences and Engineering · doi:10.26438/ijcse/v6i10.503511 · Cited by 5
The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem
Budroni, A., & Tenti, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-23696-0_3 · Cited by 5
“In [1], Aggarwal, Joux, Prakash, and Santha introduced a new public-key encryption scheme similar to the NTRU cryptosystem [2] that employs the properties of Mersenne numbers.”
MethodExplicit hard instances of the shortest vector problem.Preprint
Buchmann, J. A., Lindner, R., Rückert, M., & Schneider, M. (2008) · IACR Cryptology ePrint Archive · Cited by 4
Efficient (Ideal) lattice sieving using cross-polytope LSH
Becker, A. A., & Laarhoven, T. (2015) · Cited by 5
Heterogeneous Implementation of a Voronoi Cell-Based SVP Solver
Falcão, G., Cabeleira, F., Mariano, A., & Santos, L. P. (2019) · IEEE Access · doi:10.1109/access.2019.2939142 · Cited by 5
“As time went by, several cryptosytems have been proposed [4], [10], [15], [19], [20], in order to anticipate the rise of this so-called post-quantum era.”
BackgroundSecurity Vulnerabilities of Four Signature Schemes From NTRU Lattices and Pairings
Shim, K. (2020) · IEEE Access · doi:10.1109/access.2020.2990413 · Cited by 5
“Signature schemes, GGH [4] and NTRUSign [5], using NTRU lattices were proposed, but were completely broken in [10] due to the leakage of some secret information for their lattice trapdoors.”
MethodSieving for Shortest Vectors in Ideal Lattices.
Schneider, M. (2011) · Cited by 5
Lattice signatures using NTRU on the hardness of worst‐case ideal lattice problems
Das, D., Saraswat, V., & Basu, K. (2020) · IET Information Security · doi:10.1049/iet-ifs.2019.0580 · Cited by 5
“The lattice-based encryption schemes have seen a lot of improvements, in both computational and space requirements, in the last decade and many provably-secure schemes [3, 5, 8, 9], almost as practical as the NTRU [7], have been proposed.”
BackgroundMethodEfficient and Secure Implementation of NTRUEncrypt Using Signed Sliding Window Method
Kim, T., & Lee, M. (2020) · IEEE Access · doi:10.1109/access.2020.3008182 · Cited by 6
“the attacker can recover the distances between consecutive nonzero coefficients, bb[1]− bb[0], bb[2]− bb[1], etc.”
BackgroundInfluentialA Highly Parallel Constant-Time Almost-Inverse Algorithm
Venier, D., & Cheung, R. C. C. (2020) · IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC) · doi:10.1109/icspcc50002.2020.9259505 · Cited by 5
“An embedding of GF(2 n ) in R r has been utilized by Silverman[2] in NTRU as a way to speed up operations over the field.”
BackgroundInfluentialBeckwith, L., & Diehl, W. (2020) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/icfpt51103.2020.00025 · Cited by 5
“The NTRU submission is based on a much earlier spec-ification published in 1998 [22], which builds its security upon SVP.”
MethodA Constant-time AVX2 Implementation of a Variant of ROLLO
Chou, T., & Liou, J.-H. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.152-174 · Cited by 5
“In other words, both schemes are NTRU-like [HPS98].”
BackgroundCryptographic Primitives in Blockchain Technology: A mathematical introduction
Bolfing, A. (2020) · doi:10.1093/oso/9780198862840.001.0001 · Cited by 7
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
Boudgoust, K., Sakzad, A., & Steinfeld, R. (2022) · Designs Codes and Cryptography · doi:10.1007/s10623-022-01083-7 · Cited by 5
“5 log2 q for PASS Encrypt and 3 log2 q for PV Regev Encrypt and thus placing them in the same range as NTRU [14] and the P-LWE-based Regev scheme [19].”
BackgroundMethodResultInfluentialModular Framework for Constructing IoT-Server AKE in Post-Quantum Setting
Liu, B., Tang, Q., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3187537 · Cited by 5
Quantum and Post-Quantum Cybersecurity Challenges and Finance Organizations Readiness
Arshad, R., & Riaz, Q. (2022) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-6684-5284-4.ch016 · Cited by 5
Survey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks
Lata, M., & Kumar, A. M. (2022) · International Journal of Communication Networks and Information Security (IJCNIS) · doi:10.17762/ijcnis.v6i1.572 · Cited by 23
“Jeffrey Hoffstein et al. founded this asymmetric primitive in 1996 [55] and then it was approved for standardization in 2009 by IEEE.”
MethodApplication of NTRU Cryptographic Algorithm for securing SCADA communication
Premnath, A. P. (2020) · Digital Scholarship - UNLV (University of Nevada Reno) · doi:10.34917/5363933 · Cited by 5
Distribution of inverses in polynomial rings
Banks, W. D., & Shparlinski, I. E. (2001) · Indagationes Mathematicae · doi:10.1016/s0019-3577(01)80012-4 · Cited by 5
“These questions are motivated by applications to the recently discovered NTRU cryptosystem [2], whose public keys are related to inverses of polynomials from certain very special sets.”
BackgroundBTRU, A Rational Polynomial Analogue of NTRU Cryptosystem
Thakur, K., & P., B. (2016) · International Journal of Computer Applications · doi:10.5120/ijca2016910769 · Cited by 8
A practical k-anonymous recommender system
Zigomitros, A., Papageorgiou, A., & Patsakis, C. (2016) · 2016 7th International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa.2016.7785379 · Cited by 5
“Initially, the client sends a message which is one NTRU encryption, so the cost is 604B.”
BackgroundInfluentialInteger Reconstruction Public-Key Encryption
Ferradi, H., & Naccache, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-31578-8_23 · Cited by 5
PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density
Ping, Y., Wang, B., Tian, S., Zhou, J., & Ma, H. (2019) · Information · doi:10.3390/info10020075 · Cited by 5
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
Sipasseuth, A., Plantard, T., & Susilo, W. (2019) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2016-0066 · Cited by 5
Cloud-Assisted Asynchronous Key Transport with Post-Quantum Security
Davies, G. T., Galteland, H., Gjøsteen, K., & Jiang, Y. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-55304-3_5 · Cited by 4
Q-NTRU Cryptosystem for IoT Applications
Guma'a, O. S., Hussein, Q. M., & Al-Ta’i, Z. T. M. (2019) · Journal of Southwest Jiaotong University · doi:10.35741/issn.0258-2724.54.4.15 · Cited by 5
Master-Key KDM-Secure ABE via Predicate Encoding
Feng, S., Gong, J., & Chen, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75245-3_20 · Cited by 5
Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
Zhu, Z.-W., & Huang, R. (2021) · Applied Sciences · doi:10.3390/app112110332 · Cited by 5
Improvements on Reductions among Different Variants of SVP and CVP
Hu, G., & Pan, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-05149-9_3 · Cited by 5
Public Key Identification Based on the Equivalence of Quadratic Forms
Hartung, R. J., & Schnorr, C.-P. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74456-6_31 · Cited by 5
Addressing Insecurities and Violations of Privacy
Ranasinghe, D. C., & Cole, P. H. (2007) · Springer eBooks · doi:10.1007/978-3-540-71641-9_6 · Cited by 5
“Early research indicates that NTRU is generally faster, relatively easier to implement both in hardware and software than other public key cryptosystems such as RSA, and needs only a modest size memory [ 59 ].”
BackgroundInfluentialSurvey on computationally hard problems and their applications to cryptography
Abdouli, A. S. A., Baek, J., & Yeun, C. Y. (2011) · International Conference for Internet Technology and Secured Transactions · Cited by 5
Garg, S. (2015) · doi:10.1145/2714451 · Cited by 5
Identity-based encryption based on DHIES
Chen, Y., Charlemagne, M., Guan, Z., Hu, J., & Chen, Z. (2010) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1755688.1755699 · Cited by 5
A Novel Mutual RFID Authentication Protocol with Low Complexity and High Security
Rostampour, S., Namin, M. E., & Hosseinzadeh, M. (2014) · International Journal of Modern Education and Computer Science · doi:10.5815/ijmecs.2014.01.02 · Cited by 5
“Assume that all the parameters are chosen properly, is shown that the polynomial which indeed is the original message [12].”
BackgroundAnalysis and Performance Characteristics of Cryptosystem using Image Files
NareshReddy, A., Nayak, R., & Baboo, S. S. (2012) · International Journal of Computer Applications · doi:10.5120/8340-1561 · Cited by 5
Gebotys, C. H. (2009) · Springer eBooks · doi:10.1007/978-1-4419-1530-6_5 · Cited by 5
Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices
Martins, P., Eynard, J., Bajard, J.-C., & Sousa, L. A. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2690420 · Cited by 5
“The principle of such scheme was extended to q-ary ideal lattices through theNTRU scheme [8].”
MethodA Third-Party Mobile Payment Scheme Based on NTRU Against Quantum Attacks
Xia, Y., Ying, C., Lin, G., & Sun, Z. (2019) · IEEE Access · doi:10.1109/access.2019.2911363 · Cited by 5
“On this basis, Hoffstein et al in [23] proposed a public key cryptosystem NTRU based on polynomial ring.”
BackgroundPractical Lattice Basis Sampling Reduction.
Buchmann, J. A., & Ludwig, C. (2005) · Cited by 5
On the Hardware Implementation Efficiency of Cryptographic Primitives
Román, R., Alcaraz, C., Sklavos, N., López, J., & Zhou, J. (2008) · Cited by 5
Cryptographic Applications of Sparse Polynomials over Finite Rings
Banks, W. D., Lieman, D. B., Shparlinski, I. E., & To, T. V. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45247-8_17 · Cited by 5
“The idea of using polynomials with restricted coefficients in cryptography, though fairly new, has already found several cryptographic applications such as the NTRU cryptosystem [10], the ENROOT cryptosystem [6], the PASS identification scheme [9, 11], and the SPIFI identification scheme [2]; see also [8].”
MethodDousti, M. S., & Jalili, R. (2013) · IACR Cryptology ePrint Archive · Cited by 5
Public Key Cryptosystems with Noisy Secret Keys.Preprint
Herder, C. H., Fuller, B. W., van Dijk, M., & Devadas, S. (2017) · IACR Cryptology ePrint Archive · Cited by 5
New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation.Preprint
Agrawal, S. (2018) · IACR Cryptology ePrint Archive · Cited by 5
Mersin, A. (2007) · İYTE (İZMİR YÜKSEK TEKNOLOJİ ENSTİTÜSÜ) · Cited by 5
Whyte, W. F., & Hoffstein, J. (2011) · Springer eBooks · doi:10.1007/978-1-4419-5906-5_464 · Cited by 5
Self-citationArithmétique modulaire pour la cryptographie
Plantard, T. (2005) · HAL · Cited by 5
Drăgoi, V. (2017) · theses.fr (ABES) · doi:10.70675/768c8e60zc3e6z4c17za728zec57125eed6b · Cited by 11
Devaraj, P., Basha, S. K. M. H., Santhosh, N. N. P., & Panda, N. (2026) · Future Internet · doi:10.3390/fi18030165 · Cited by 10
Fouque, P.-A., Gajland, P., de Groote, H., Janneck, J., & Kiltz, E. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25327-9_1 · Cited by 4
“By leveraging NTRU lattices, introduced by Hoffstein, Pipher, and Silverman [HPS98,HHP + 03], Falcon benefits from their ring structure.”
Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
Xu, J., Hu, L., & Sun, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34129-8_5 · Cited by 4
“…for public key cryptography to research secure and fast asymmetric encryption cryptosystems relying on other hard mathematical problems such as lattice problems (e.g., Atjai-Dwork [1], GGH [5] and NTRU [6] public key cryptosystems) and combinatorial problems (e.g., knapsack trapdoors [8]).”
BackgroundAn algebraic algorithm for breaking NTRU with multiple keys
Bai, S., Jangir, H., Ngo, T., & Youmans, W. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01473-z · Cited by 5
“Following the groundbreaking work of [20, 21], the NTRU assumption has been used extensively in cryptography.”
InfluentialPost-quantum cryptography : a study of the decoding of QC-MDPC codes
Vasseur, V. (2026) · doi:10.70675/732852a5z1ca0z491dz8a02z51f0a24611b7 · Cited by 3
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.