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 401–500 of 1,000
Park, S.-W., & Lee, I.-Y. (2013) · Journal of Information Processing Systems · doi:10.3745/jips.2013.9.3.461 · Cited by 27
“∗ → → KIPS Tr. Comp. and Comm. Sys. Step2 : 은행은 와 공개된 서명 시스템을 이용하여 , 의 타당성을 인증하고 임의의 다항식 를 선택하여 사용자에게 전송한다.”
Explicit Hard Instances of the Shortest Vector Problem
Buchmann, J. A., Lindner, R., & Rückert, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88403-3_6 · Cited by 33
“There have been several approaches to measure the effectiveness of known lattice reduction algorithms, especially in the context of the NTRU cryptosystem [20].”
MethodMedical Image Encryption: An Application for Improved Padding Based GGH Encryption Algorithm
Sokouti, M., Zakerolhosseini, A., & Sokouti, B. (2016) · The Open Medical Informatics Journal · doi:10.2174/1874431101610010011 · Cited by 27
“In 1998, Hoffstein and Silverman, presented a new lattice-based cryptography using the shortest vector problem (SVP) which works on polynomials [34].”
BackgroundImproving the Efficiency of Homomorphic Encryption Schemes
Hu, Y. (2013) · Digital WPI · Cited by 34
Cryptography and Secure Communication
Blahut, R. E. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139013673 · Cited by 45
Attacking ECDSA-Enabled RFID Devices
Hutter, M., Medwed, M., Hein, D. M., & Wolkerstorfer, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_32 · Cited by 29
“In respect to these facts, many light-weight solutions have been proposed such as NTRU [8], XTR [19], and elliptic-curve based schemes.”
BackgroundFully Homomorphic Encryption for Mathematicians
Silverberg, A. (2013) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/606/12143 · Cited by 27
Post-quantum cryptography for automotive systems
Fritzmann, T., Vith, J., Flórez, D., & Sepúlveda, J. (2021) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2021.104379 · Cited by 26
Evaluation and Comparison of Lattice-Based Cryptosystems for a Secure Quantum Computing Era
Sabani, M. E., Savvas, I. Κ., Poulakis, D., Garani, G., & Makris, G. C. (2023) · Electronics · doi:10.3390/electronics12122643 · Cited by 38
“The NTRU cryptographic scheme is based firstly on three well-chosen parameters ( N , p , q ) , such that N is a fixed positive large integer, p and q , is not necessary to be prime but are relatively prime, e.g., gcd ( p , q ) = 1 and q will be always larger than p [44].”
BackgroundMethodInfluentialEfficient architecture and implementation for NTRUEncrypt system
Liu, B., & Wu, H. (2015) · IEEE International Midwest Symposium on Circuits and Systems (MWSCAS) · doi:10.1109/mwscas.2015.7282143 · Cited by 26
“NTRU was firstly developed by Hoffstein, Pip her and Sil verman from Brown University in 1996 [3].”
MethodApplicability of Public Key Infrastructures in Wireless Sensor Networks
Román, R., & Alcaraz, C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73408-6_22 · Cited by 26
“NTRUEncrypt is much faster both for encrypting and for verification operations than RSA, since it uses simple polynomial multiplications.”
MethodAchieving NTRU with montgomery multiplication
O'Rourke, C. M., & Sunar, B. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1190585 · Cited by 26
“modular multiplication for both integers and binary polynomials and NTRU’s polynomial multiplications.”
BackgroundLyubashevsky, V., & Prest, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46800-5_30 · Cited by 27
Short Generators Without Quantum Computers: The Case of Multiquadratics
Bauch, J., Bernstein, D. J., de Valence, H., Lange, T., & van Vredendaal, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_2 · Cited by 26
“For example, the attack does not break a more complicated homomorphic encryption system introduced in Gentry’s thesis [28,30]; it does not break the classic NTRU system [32]; and it does not break the BCNS [12] and New Hope [3] systems.”
BackgroundSingle Trace Analysis on Constant Time CDT Sampler and Its Countermeasure
Kim, S., & Hong, S. (2018) · Applied Sciences · doi:10.3390/app8101809 · Cited by 27
“Meanwhile, NTRU was proposed in 1996 by Hoffstein, Pipher, and Silverman [16].”
MethodCryptanalysis of the Smart-Vercauteren and Gentry-Halevi's Fully Homomorphic Encryption.
Gu, C., & Jixing, G. (2011) · Cited by 25
A quantum secure direct communication protocol using entangled beam pairs
He, R., Ma, J.-G., & Wu, J. (2019) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/127/50006 · Cited by 25
“One possible solution is to use quantum protocols such as lattice code [1].”
MethodKolberg, J., Bauspieß, P., Gomez‐Barrero, M., Rathgeb, C., Dürmuth, M., & Busch, C. (2019) · IEEE International Workshop on Information Forensics and Security · doi:10.1109/wifs47025.2019.9034982 · Cited by 25
“The memory requirements of the ring-based public key cryptosystem NTRU [11] are low.”
BackgroundMethodXu, D., Wang, X., Hao, Y., Zhang, Z., Hao, Q., & Zhou, Z. (2022) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2022.3174205 · Cited by 25
DIVRS: Data integrity verification based on ring signature in cloud storage
Tian, M., Zhang, Y., Zhu, Y., Wang, L., & Xiang, Y. (2022) · Computers & Security · doi:10.1016/j.cose.2022.103002 · Cited by 25
Too Many Hints – When LLL Breaks LWE
May, A., & Nowakowski, J. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8730-6_4 · Cited by 25
“While Ajtai-Dwork focussed on the hardness guarantees of lattice-based crypto, the invention of the NTRU cryptosystem of Hoffstein, Pipher and Silverman [HPS98] with its compact lattice bases as public keys was a cornerstone for the practicality of lattice schemes.”
BackgroundMethodInfluentialOn handling insider attacks in wireless sensor networks
Krauß, C., Schneider, M., & Eckert, C. M. (2008) · Information Security Technical Report · doi:10.1016/j.istr.2008.10.011 · Cited by 25
“Newer cryptosystems based on Elliptic Curve Cryptography (ECC) [168], such as NTRU [107] and XTR [148], have been proposed to achieve the same level of security with smaller key sizes and higher computational efficiency.”
Research on NTRU Algorithm for Mobile Java Security
Shen, X., Du, Z., & Chen, R. (2009) · International Conference on Embedded Computing · doi:10.1109/embeddedcom-scalcom.2009.72 · Cited by 25
“Preliminary experimental results show the advantages of NTRU over RSA, such as, at the similar security level, the key size of NTRU is less than a quarter of that of RSA, and the speed of NTRU is much faster than that of RSA; the key generation is more than 200 times faster, the encryption is…”
BackgroundShortest Lattice Vectors in the Presence of Gaps.
Liu, M., Wang, X., Xu, G., & Zheng, X. (2011) · Cited by 25
Cryptography Standards in Quantum Time: New Wine in an Old Wineskin?
Chen, L. (2017) · IEEE Security & Privacy · doi:10.1109/msp.2017.3151339 · Cited by 29
Xagawa, K. (2010) · Cited by 25
Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
Alperin-Sheriff, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46447-2_11 · Cited by 29
Additively Homomorphic UC Commitments with Optimal Amortized Overhead
Cascudo, I., Damgård, I., David, B., Giacomelli, I., Nielsen, J. B., & Trifiletti, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46447-2_22 · Cited by 23
Physical Protection of Lattice-Based Cryptography
Khalid, A., Oder, T., Valencia, F. A., Neill, M. O., Güneysu, T. E., & Regazzoni, F. (2018) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3194554.3194616 · Cited by 24
“As one of the first lattice-based cryptosystems Hoffstein, Pipher, and Silverman introduced the encryption scheme NTRU [14] in”
BackgroundTwo quantum Ising algorithms for the shortest-vector problem
Joseph, D., Callison, A., Ling, C., & Mintert, F. (2021) · Physical Review A · doi:10.1103/physreva.103.032433 · Cited by 33
SoK: How (not) to Design and Implement Post-quantum Cryptography
Howe, J., Prest, T., & Apon, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75539-3_19 · Cited by 25
On the Energy Costs of Post-Quantum KEMs in TLS-based Low-Power Secure IoT
Schöffel, M., Lauer, F., Rheinländer, C. C., & Wehn, N. (2021) · IEEE/ACM International Conference on Internet-of-Things Design and Implementation (IoTDI) · doi:10.1145/3450268.3453528 · Cited by 30
“[20] and built the basis for various cryptosystems.”
BackgroundChallenges of post-quantum digital signing in real-world applications: a survey
Tan, T. G., Szałachowski, P., & Zhou, J. (2022) · International Journal of Information Security · doi:10.1007/s10207-022-00587-6 · Cited by 36
“– Falcon (Fast-Fourier Lattice-based Compact Signatures over NTRU, www.falcon-sign.info) is based on GPV [34] by applying the SIS problem over NTRU lattices [44].”
MethodA new post-quantum multivariate polynomial public key encapsulation algorithm
Kuang, R., Perepechaenko, M., & Barbeau, M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03712-5 · Cited by 33
NTRU-KE: A Lattice-based Public Key Exchange Protocol.Preprint
Lei, X., & Liao, X. (2013) · IACR Cryptology ePrint Archive · Cited by 35
BITRU: Binary Version of the NTRU Public Key Cryptosystem via Binary Algebra
Al-Saidi, N. M. G., & Hassan, R. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071101 · Cited by 24
“The number theory research unit (NTRU) public key cryptosystem is a new generation of public key cryptosystems based on lattice hard problem introduced in 1996 by three mathematicians, namely Jeffery Hoffstein, Joseph Silverman, and Jill Piper [7].”
BackgroundEfficient Multi-Key FHE With Short Extended Ciphertexts and Directed Decryption Protocol
Li, N., Zhou, T., Yang, X., Han, Y., Liu, W., & Tu, G. (2019) · IEEE Access · doi:10.1109/access.2019.2913943 · Cited by 24
Sieving for shortest vectors in ideal lattices: a practical perspective
Bos, J. W., Naehrig, M., & van de Pol, J. (2017) · International Journal of Applied Cryptography · doi:10.1504/ijact.2017.089353 · Cited by 24
Aggregating Falcon Signatures with LaBRADOR
Aardal, M. A., Aranha, D. F., Boudgoust, K., Kolby, S., & Takahashi, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68376-3_3 · Cited by 23
Post-quantum Cryptography: A Review on Cryptographic Solutions for the Era of Quantum Computing
Singh, M., Sood, S. K., & Bhatia, M. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10412-7 · Cited by 32
TESLA: Tightly-Secure Efficient Signatures from Standard Lattices.
Alkım, E., Bindel, N., Buchmann, J. A., Dagdelen, Ö., & Schwabe, P. (2015) · TUbilio (Technical University of Darmstadt) · Cited by 23
HILA5 Pindakaas: On the CCA Security of Lattice-Based Encryption with Error Correction
Bernstein, D. J., Bruinderink, L. G., Lange, T., & Panny, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89339-6_12 · Cited by 23
“HILA5’s design is based on Ring Learning With Errors (RLWE) over NTRU NTT rings.”
MethodInfluentialA Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks
Sun, X., Yu, F. R., Zhang, P., Xie, W., & Peng, X. (2020) · Sensors · doi:10.3390/s20154253 · Cited by 23
“Based on the NTRU [56], López-Alt et al. [57] constructed a multi-key FHE scheme.”
MethodSecurity and privacy in the Internet of Things: threats and challenges
Badr, Y., Zhu, X., & Alraja, M. N. (2021) · Service Oriented Computing and Applications · doi:10.1007/s11761-021-00327-z · Cited by 29
“After the experimental research stage of these years, there are several well-benchmarked asymmetric cryptographic algorithms like Rabin [87], NtruEncrypt [88], RSA [89] and elliptic curve cryptography (ECC) [90].”
MethodResearch on Secure Communication on In-Vehicle Ethernet Based on Post-Quantum Algorithm NTRUEncrypt
Zhu, Y., Liu, Y., Wu, M., Li, J., Liu, S., & Zhao, J. (2022) · Electronics · doi:10.3390/electronics11060856 · Cited by 23
Improved Homomorphically Encrypted Biometric Identification Using Coefficient Packing
Bauspieß, P., Olafsson, J., Kolberg, J., Drozdowski, P., Rathgeb, C., & Busch, C. (2022) · International Workshop on Biometrics and Forensics (IWBF) · doi:10.1109/iwbf55382.2022.9794523 · Cited by 25
Public-Key Cryptography Based on Tropical Circular Matrices
Huang, H., Li, C., & Deng, L. (2022) · Applied Sciences · doi:10.3390/app12157401 · Cited by 25
A Survey on NIST Selected Third Round Candidates for Post Quantum Cryptography
Hasija, T., Ramkumar, K. R., Kaur, A., Mittal, S. K., & Singh, K. K. (2022) · International Conference on Communication and Electronics Systems (ICCES) · doi:10.1109/icces54183.2022.9835864 · Cited by 24
Privacy‐preserving CNN feature extraction and retrieval over medical images
Cai, G., Wei, X., & Li, Y. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22991 · Cited by 27
A novel and quantum-resistant handover authentication protocol in IoT environment
Zhang, S., Du, X., & Liu, X. (2023) · Wireless Networks · doi:10.1007/s11276-023-03342-4 · Cited by 25
“In this part, we will describe the Number Theory Research Unit (NTRU) encryption algorithm officially shown in [39], the communication model, and the security requirements.”
MethodScalable and Popularity-Based Secure Deduplication Schemes With Fully Random Tags
Ha, G., Jia, C., Huang, Y., Chen, H., Li, R., & Jia, Q. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3285173 · Cited by 23
“The re-encryption is implemented based on NTRU [28], [40], in which the polynomial coefficients are relatively small, and the polynomial multiplications can be efficiently performed using the Fast Fourier Transform (FFT) [43].”
MethodRoadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures
Shaller, A., Zamir, L., & Nojoumian, M. (2023) · Information and Computation · doi:10.1016/j.ic.2023.105112 · Cited by 27
“The first scheme of this family is NTRU, proposed in 1998 by Ho ff stein et al. [17].”
BackgroundSecurity and Privacy Solutions for Low-Cost RFID Systems
Ranasinghe, D. C., Engels, D. W., & Cole, P. H. (2005) · International Conference on Intelligent Sensors, Sensor Networks and Information Processing · doi:10.1109/issnip.2004.1417485 · Cited by 23
Shaheen, S. H., Yousaf, M., & Jalil, M. (2017) · International Conference on Emerging Technologies · doi:10.1109/icet.2017.8281747 · Cited by 23
“The attack analysis of NTRU along with recommendations for its secure use will be presented in future research work.”
MethodInfluentialSecurity in Wireless Sensor Networks
Sen, J. (2012) · CRC Press eBooks · doi:10.1201/b13092-21 · Cited by 24
High Performance Implementation of a Public Key Block Cipher - MQQ, for FPGA Platforms
El-Hadedy, M., Gligoroski, D., & Knapskog, S. J. (2008) · International Conference on ReConFigurable Computing and FPGAs (ReConFig) · doi:10.1109/reconfig.2008.11 · Cited by 23
“…Unbalanced Oil and Vinegar (UOV) by Kipnis et al., [11]; • McEliece PKC based on error correcting codes [15]; • Rabin’s digital signature method [19]; • PKCs based on lattice reduction problems [1], [7] and on lattice problems over rings such as NTRU [9]; • PKCs based on braid groups [12];…”
MethodA Scan-Based Side Channel Attack on the NTRUEncrypt Cryptosystem
Kamal, A. A., & Youssef, A. (2012) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1109/ares.2012.14 · Cited by 23
“Throughout the rest of the paper, we focus on NTRUEncrypt with the widely used parameters: p = 3 and q in the form of 2 [11].”
MethodAn Improvement of Key Generation Algorithm for Gentry’s Homomorphic Encryption Scheme
Ogura, N., Yamamoto, G., Kobayashi, T., & Uchiyama, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16825-3_6 · Cited by 23
“Especially, they explain why the 334-dimensional NTRU lattices [11] have not been solved.”
BackgroundRivest, R. L., & Weis, S. A. (2006) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 23
Cyber-physical defense in the quantum Era
Barbeau, M., & Garcia-Alfaro, J. (2022) · Scientific Reports · doi:10.1038/s41598-022-05690-1 · Cited by 22
“Candidate PQC families include code-based 9 , hash-based 10 , multivariate 11 , lattice-based 12,13 and supersingular isogeny-based 14 cryptosystems.”
When NTT Meets Karatsuba: Preprocess-then-NTT Technique Revisited
Zhu, Y., Liu, Z., & Pan, Y. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88052-1_15 · Cited by 21
An Efficient Implementation of NTRU Encryption in Post-Quantum Internet of Things
Agus, Y. M., Murti, M. A., Kurniawan, F., Cahyani, N. D. W., & Satrya, G. B. (2020) · doi:10.1109/ict49546.2020.9239560 · Cited by 22
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Biasse, J., Bonnetain, X., Kirshanova, E., Schrottenloher, A., & Song, F. (2022) · IET Information Security · doi:10.1049/ise2.12081 · Cited by 25
Revisiting algebraic attacks on MinRank and on the rank decoding problem
Bardet, M., Briaud, P., Bros, M., Gaborit, P., & Tillich, J. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01265-x · Cited by 38
“This type of codes made it possible to build McEliece schemes that can be viewed as the rank metric analogue of NTRU in the Euclidean metric [43] or of the MDPC cryptosystem in the Hamming metric [47], where the trapdoor is given by small weight vectors which allow efficient decoding.”
BackgroundHELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Duc, A., & Vaudenay, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38553-7_6 · Cited by 26
“In lattice-based cryptosystem, one has to mention NTRU [33] based on the hardness of the shortest vector problem in a particular class of lattices.”
BackgroundFirst-order collision attack on protected NTRU cryptosystem
Zheng, X., Wang, A., & Wei, W. (2013) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2013.04.008 · Cited by 22
Strengthening hardware implementations of NTRUEncrypt against fault analysis attacks
Kamal, A. A., & Youssef, A. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0061-7 · Cited by 22
“The NTRU encryption algorithm, also known as NTRUEncrypt, is a parameterized family of lattice-based public key cryptosystems [1,2].”
MethodSecuring M2M With Post-Quantum Public-Key Cryptography
Shih, J.-R., Hu, Y., Hsiao, M.-C., Chen, M.-S., Shen, W.-C., Yang, B., Wu, A.-Y. A., & Cheng, C.-M. (2013) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2013.2244772 · Cited by 22
“NTRUEncrypt is a lattice-based cryptosystem, whose security is based on the hardness of the shortest vector problem in high-dimensional euclidean lattices [9].”
BackgroundReduced memory meet-in-the-middle attack against the NTRU private key
van Vredendaal, C. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000206 · Cited by 23
“NTRU [ 12 ] is a ring-based public-key cryptosystem that so far has survived quantum attacks (e.g. [ 9 , 30 ]).”
BackgroundFarahmand, F., Dang, V. B., Nguyen, D. T., & Gaj, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_2 · Cited by 22
Kumar, K. B. A., Mohith, L. S., Jain, K., Krishnan, P., Venkatachalam, N., & Buyya, R. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3572949 · Cited by 28
“These include public key encryption schemes [26] and digital signatures, with NTRU noted for its resistance to full-timing attacks and high performance [26].”
Data sharing using proxy re-encryption based on DNA computing
Elhadad, A. (2019) · Soft Computing · doi:10.1007/s00500-019-04041-z · Cited by 22
“While in Nuñez et al. (2015), the authors proposed two proxy re-encryption techniques called NT RU ReEncrypt and PS − NT RU ReEncrypt based on NTRU cryptosystem (Ansi 2010; Hoffstein et al. 1998).”
MethodA review of the tropical approach in cryptography
Ahmed, K., Pal, S. K., & Mohan, R. (2022) · Cryptologia · doi:10.1080/01611194.2021.1994486 · Cited by 21
Zheng, Z. (2022) · Financial Mathematics and Fintech · doi:10.1007/978-981-19-0920-7 · Cited by 25
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
Güneysu, T. E., Lyubashevsky, V., & Pöppelmann, T. (2014) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2346177 · Cited by 21
“One notable exception is the NTRU public-key encryption scheme [34], which has essentially remained unbroken since its introduction.”
BackgroundGröbner bases of ideals invariant under a commutative group
Faugère, J., & Svartz, J. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465944 · Cited by 21
Revisiting the Hybrid Attack on Sparse Secret LWE and Application to HE Parameters
Son, Y., & Cheon, J. H. (2019) · doi:10.1145/3338469.3358941 · Cited by 22
“" NTRU [28], which also serves as another foundation for past decade Itis well-knownthat for NTRU , ahybrid of lattice reduction and meet-in-the-middle attack ( the hybrid attack of the most powerful attacks for choosing NTRU parameters [27].”
BackgroundFarahmand, F., Nguyen, D. T., Dang, V. B., Ferozpuri, A., & Gaj, K. (2019) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2019.00042 · Cited by 21
“This candidate is a substantially revised version of the earlier NTRU encryption schemes, such as an early variant proposed in 1996 [7], and its extended version standardized by IEEE in 2008 [8].”
BackgroundTranscript Secure Signatures Based on Modular Lattices
Hoffstein, J., Pipher, J. C., Schanck, J. M., Silverman, J. H., & Whyte, W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_9 · Cited by 21
Self-citationFaugère, J., & Svartz, J. (2012) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2442829.2442856 · Cited by 21
“Svartz}@lip6.fr ABSTRACT We propose an ef.cient algorithm to solve polynomial systems of which equations are globally invariant under an action of the symmetric group SN acting on the variable xi with s(xi) = xs(i) and the number of variables is a multiple of N.”
MethodImperfect Decryption and an Attack on the NTRU Encryption Scheme.
Proos, J. (2003) · Cited by 21
Privacy-preserving Federated Learning based on Multi-key Homomorphic EncryptionPreprint
Ma, J., Naas, S., Sigg, S., & Lyu, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.06824 · Cited by 21
“[15] proposed the first MK-FHE scheme known as LTV12, which is based on the NTRU encryption system [16].”
MethodPower Analysis Attacks and Countermeasures on NTRU-Based Wireless Body Area Networks
Wang, A., Zheng, X., & Wang, Z. (2013) · KSII Transactions on Internet and Information Systems · doi:10.3837/tiis.2013.05.009 · Cited by 20
“NTRU cryptosystem [4, 5] is based on the algebraic structures of polynomial ring An element f R will be written as a polynomial or a vector modulo means reducing the coefficients modulus and the inverse of mod is defined as the polynomial 1 The integer decides the ring and and are respectively…”
BackgroundMethodInfluentialCrockett, E., & Peikert, C. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978402 · Cited by 21
“As mentioned above, there are many implementations of various lattice- and ring-based cryptographic schemes, such as NTRU (Prime) encryption [36, 6], the SWIFFT hash function [41], digital signature schemes like [33] and BLISS [20], key-exchange protocols [10, 2, 9], and FHE libraries like HElib [34].”
BackgroundMethodLeakage Resilient One-Way Functions: The Auxiliary-Input Setting
Komargodski, I. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53641-4_6 · Cited by 24
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices
Bernard, O., & Roux-Langlois, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_12 · Cited by 28
BAT: Small and Fast KEM over NTRU Lattices
Fouque, P.-A., Kirchner, P., Pornin, T., & Yu, Y. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i2.240-265 · Cited by 27
“In this light, a natural choice is NTRU [39], as its structure reduces the data to one ring element.”
BackgroundMethodKey-Based Data Deduplication via Homomorphic NTRU for Internet of Vehicles
Huang, D., Zhou, J., Mi, B., Kuang, F., & Liu, Y. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3205627 · Cited by 20
“Lemma 1 ([24]): and .”
Method$\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
Aumasson, J.-P., Finiasz, M., Meier, W., & Serge Vaudenay, B. (2007) · Springer eBooks · doi:10.1007/978-3-540-73458-1_15 · Cited by 20
“Results are presented in Table 3. The key generation time of TCHo is of course way higher than for any other public key cryptosystem, however, encryption and decryption speed are close to those of RSA or elliptic curve cryptosystems [20]. NTRU [ 17 ] is however much faster.”
MethodResultSurvey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks
Lata, M., & Kumar, A. (2014) · International Journal of Computer Network and Information Security · doi:10.54039/ijcnis.v6i1.572 · Cited by 20
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
del Pino, R., Lyubashevsky, V., & Pointcheval, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44618-9_15 · Cited by 20
“There are very efficient publickey encryption schemes (and thus Key Encapsulation Mechanisms) based on the NTRU [14,15] and Ring-LWE problems [6,22,24,30], as well as digital signature schemes that are also based on NTRU [7,8,13] and Ring-LWE [11,21].”
Postquantum Opportunities: Lattices, Homomorphic Encryption, and Supersingular Isogeny Graphs
Lauter, K. (2017) · IEEE Security & Privacy · doi:10.1109/msp.2017.3151338 · Cited by 20
A non-commutative cryptosystem based on quaternion algebras
Bagheri, K., Sadeghi, M., & Panario, D. (2017) · Designs Codes and Cryptography · doi:10.1007/s10623-017-0451-4 · Cited by 22
“An attempt at finding the private key ( f , g ) leads to solving SVP in L NTRU [11], while an attempt at obtaining the message m leads to finding CVP in L NTRU [20].”
BackgroundMethodInfluentialD-NTRU: More efficient and average-case IND-CPA secure NTRU variant
Wang, B., Lei, H. C., & Hu, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.037 · Cited by 20
Fault Analysis of the NTRUEncrypt Cryptosystem
Kamal, A. A., & YOUSSEF, A. (2011) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e94.a.1156 · Cited by 20
A matrix formulation for NTRU cryptosystem
Nayak, R., Sastry, C. V., & Pradhan, J. (2008) · The ... IEEE International Conference on Networks/The IEEE International Conference on Networks · doi:10.1109/icon.2008.4772602 · Cited by 20
A Digital Signature Scheme Based on CVP ∞
Plantard, T., Susilo, W., & Win, K. T. (2008) · Springer eBooks · doi:10.1007/978-3-540-78440-1_17 · Cited by 20
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems.
Laarhoven, T., Pol, V. D. J., & Weger, D. B. B. (2012) · TU/e Research Portal · Cited by 21
Secure and Scalable Internet of Things Model Using Post-Quantum MACsec
Choi, J., & Lee, J.-W. (2024) · Applied Sciences · doi:10.3390/app14104215 · Cited by 28
A Thorough Treatment of Highly-Efficient NTRU Instantiations
Duman, J., Hövelmanns, K., Kiltz, E., Lyubashevsky, V., Seiler, G., & Unruh, D. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31368-4_3 · Cited by 19
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.