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 801–900 of 1,000
Security Issues and Solutions in Vehicular Adhoc Network : A Review Approach
Raw, R. S., Kumar, M., & Singh, N. (2013) · doi:10.5121/csit.2013.3535 · Cited by 8
“NTRU cryptosystem [17] is recently adopted by IEEE P1363 working group.”
MethodA secret key encryption scheme based on 1-level QC-LDPC lattices
Bagheri, K., Sadeghi, M., Eghlidos, T., & Panario, D. (2016) · International ISC Conference on Information Security and Cryptology (ISCISC) · doi:10.1109/iscisc.2016.7736446 · Cited by 8
Analysis of decreasing squared-sum of Gram–Schmidt lengths for short lattice vectors
Yasuda, M., Yokoyama, K., Shimoyama, T., Kogure, J., & Koshiba, T. (2017) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2016-0008 · Cited by 8
“Lattice reduction gives a powerful tool to break lattice-based cryptosystems such as [9, 10].”
BackgroundNTRU inverse polynomial algorithm based on circulant matrices using gauss-jordan elimination
Gaithuru, J. N., Salleh, M., & Mohamad, I. (2017) · ICT International Student Project Conference (ICT-ISPC) · doi:10.1109/ict-ispc.2017.8075326 · Cited by 8
“We propose a simplified alternative NTRU inverse algorithm for finding the inverse of a polynomial modulo an integer, applicable in NTRU, defined in any specific field and then show its comparative performance along with the classical NTRU inverse algorithm in [7-9] and the algorithm by Zhao and Su in [6].”
BackgroundMethodInfluentialNTRU inverse polynomial algorithm based on the LU decomposition method of matrix inversion
Gaithuru, J. N., Salleh, M., & Mohamad, I. (2017) · IEEE Conference on Application, Information and Network Security (AINS) · doi:10.1109/ains.2017.8270415 · Cited by 8
“The polynomial inverses Fp and Fq are in the rings Rp, Rq and reduction is done modulo (xN−1), in order to ensure that the parameter size N is not exceeded [6], [7], [8].”
BackgroundMethodAn Efficient NTRU-Based Authentication Protocol in IoT Environment
Jeong, S., Park, K., Park, Y., & Park, Y. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-01177-2_91 · Cited by 8
Current Challenges and Approaches in Securing Communications for Sensors and Actuators
Haas, Z. J., Yang, L., Liu, M.-L., Li, Q., & Li, F. (2013) · Signals and communication technology · doi:10.1007/978-3-642-40009-4_17 · Cited by 8
“They implemented three different public key cryptography schemes (Rabin’s Scheme [14], NtruEncrypt and NtruSign [15], and Elliptic Curve Cryptography [16, 17]) in a sensor node that is embedded with a custom-designed low-power co-processor to handle all the computationintensive tasks.”
MethodHigh-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions.
Györfi, T., Cret, O. A., Hanrot, G., & Brisebarre, N. (2012) · Cited by 8
Quantum-Resistance Authentication and Data Transmission Scheme for NB-IoT in 3GPP 5G Networks
Yu, P., Cao, J. P., Ma, M., Li, H., Niu, B., & Li, F. (2019) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2019.8885686 · Cited by 11
“With the development of lattice cryptography, more and more researchers have proposed new cryptographic schemes based on lattice difficulties [23], [24].”
BackgroundQuantum Key Search for Ternary LWE
van Hoof, I., Kirshanova, E., & May, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_7 · Cited by 14
Ranasinghe, D. C., & Cole, P. H. (2006) · Cited by 7
An end-to-end security architecture to collect, process and share wearable medical device data
Rohloff, K. R., & Polyakov, Y. (2015) · IEEE International Conference on e-Health Networking, Applications and Services (Healthcom) · doi:10.1109/healthcom.2015.7454578 · Cited by 8
“Of particular interest to our architecture are variants of the NTRU lattice encryption scheme [17] which was not originally design for homomorphic encryption properties.”
BackgroundWorst-Case to Average-Case Reductions for Module Lattices.
Roux-Langlois, A., & Stehlé, D. (2012) · Cited by 8
Aspects of hardware methodologies for the NTRU public-key cryptosystem
Wilhelm, K. (2008) · RIT Scholar Works (Rochester Institute of Technology) · Cited by 8
Low-power electroencephalography sensing data RF transmission: hardware architecture and test
Hu, F., Hao, Q., Qiu, M., Wu, Y., Frye, J. R., Pontillo, D. F., Finamore, J., Bhutani, A., McGarvey, Z., & Phillips, D. B. (2009) · doi:10.1145/1540373.1540389 · Cited by 8
Quantum Encrypted Messaging Application: Harnessing Quantum Mechanics for Secure Communication
Sharon, R. G., Kumar, A. S., Mayan, J. A., & Catherine, A. (2024) · International Conference on Device Intelligence, Computing and Communication Technologies (DICCT) · doi:10.1109/dicct61038.2024.10533142 · Cited by 7
Secure kNN for Distributed Cloud Environment Using Fully Homomorphic Encryption
Yuuya, F., Hashimoto, S., Sakai, K., Fukumoto, S., Sun, M.-T., & Ku, W. (2025) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2025.3561586 · Cited by 10
“Among homomorphic encryption schemes [23], [43], [44], [45], [46], BGV [23] encryption with the SV packing [24] presents high performance in homomorphic evaluations in [41].”
Secure Lattice-Based Signature Scheme for Internet of Things Applications
Prajapat, S., Gautam, D., Kumar, P., Jangirala, S., Das, A. K., & Sikdar, B. (2025) · IEEE Access · doi:10.1109/access.2025.3565200 · Cited by 7
“A reasonable high speed, low memory requirements and easily created short keys are some features offered by a new public key cryptosystem NTRU [18].”
Mala, D. J., Rastogi, A., Raj, A., & Manori, V. (2025) · IEEE Access · doi:10.1109/access.2025.3607474 · Cited by 9
“Hoffstein et al. [12] presented NTRU, a public key cryptographic system built using a lattice-based cryptographic system.”
HybridPKE: A forward-secure non-interactive quantum-safe hybrid key exchange scheme
Choudhary, S., & Gupta, A. K. (2022) · Engineering Science and Technology an International Journal · doi:10.1016/j.jestch.2022.101094 · Cited by 8
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors
Takeshita, J., Karl, R., Gong, T., & Jung, T. (2023) · Journal of Cryptology · doi:10.1007/s00145-023-09450-w · Cited by 8
“Our new schemes are key-homomorphic adaptations of the ideas underlying the LPR and NTRU cryptosystems [38,40], adapted to the specific application of PSA.”
BackgroundMethodInfluentialRQC Revisited and More Cryptanalysis for Rank-Based Cryptography
Bidoux, L., Briaud, P., Bros, M., & Gaborit, P. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3337945 · Cited by 20
“Examples of such an approach are NTRU [9] or MDPC [10] cryptosystems where the masking consists in knowing a very small weight vector of the given public matrix.”
BackgroundDecentralized Distributed Federated Learning Based on Multi-Key Homomorphic Encryption
Shang, M., Zhang, D., & Li, F. (2023) · International Conference on Data Security and Privacy Protection (DSPP) · doi:10.1109/dspp58763.2023.10405290 · Cited by 11
“In 2012, L´opez-Alt [10] et al. proposed a hierarchical multi-key fully homomorphic encryption scheme based on the NTRU cryptosystem [11], using linearisation and mode-swapping techniques, but it is not practical due to high decryption complexity and storage requirements.”
MethodNovel Hybrid Post-Quantum Encryption Design on Embedded Devices
Cherkaoui, I., Ali, O., & Horgan, J. (2024) · IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) · doi:10.1109/etfa61755.2024.10710884 · Cited by 8
“…here on CRYSTALS-Kyber [15] the most widely used so far, though not deployed, and intensively researched public-key encryption algorithm chosen finalist of the NIST competition along with NTRUEncrypt [16] (Dilithium and Falcon for signatures, and FrodoKEM for the Key Encapsulation Mechanism (KEM)).”
MethodAlgebraic attack on NTRU using Witt vectors and Gröbner bases
Bourgeois, G., & Faugère, J. (2009) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2009.011 · Cited by 7
“The public parameters of NTRU (we refer to [15] for a complete description of NTRU) are: N a prime number (for instance N = 251), q = 2 a power”
MethodKey Recovery Attacks Against NTRU-Based Somewhat Homomorphic Encryption Schemes
Chenal, M., & Tang, Q. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23318-5_22 · Cited by 7
EPiC: Efficient Privacy-Preserving Counting for MapReduce
Vo-Huu, T. D., Blaß, E.-O., & Noubir, G. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26850-7_29 · Cited by 7
The Low-Area FPGA Design for the Post-Quantum Cryptography Proposal Round5
Andrzejczak, M. (2019) · Annals of Computer Science and Information Systems · doi:10.15439/2019f230 · Cited by 7
“Before polynomial multiplication is executed, one of the polynomials must be lifted to the so called NTRU-ring [21].”
BackgroundLoki: A Lightweight LWE Method with Rogue Bits for Quantum Security in IoT Devices
Singh, R., Hussain, M. M., Sahay, M., Indu, S., Kaushik, A. K., & Singh, A. K. (2020) · Smart innovation, systems and technologies · doi:10.1007/978-981-15-7062-9_54 · Cited by 7
Homomorphic Comparison Methods: Technologies, Challenges, and Opportunities
Babenko, M. G., Tchernykh, A. N., Golimblevskaia, E., Pulido-Gaytan, L. B., & Avetisyan, A. I. (2020) · International Conference on Engineering and Telecommunication (EnT) · doi:10.1109/ent50437.2020.9431252 · Cited by 8
“…project includes the Brakerski-Gentry-Vaikuntanathan (BGV) [3], Brakerski [4] /Fan-Vercauteren [5] (BFV), Gentry-Sahai-Waters (GSW) [6], YASHE [7], Hoffstein-Pipher-Silverman (HPS) [8], López-Tromer-Vaikuntanathan (LTV) [9], and Cheon-Kim-Kim-Song (CKKS) [10] homomorphic encryption schemes.”
AVRNTRU: Lightweight NTRU-based Post-Quantum Cryptography for 8-bit AVR Microcontrollers
Cheng, H., Grobschadl, J., Rønne, P. B., & Ryan, P. Y. A. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474033 · Cited by 7
“N is called degree parameter and determines the quotient ring R = Z[x]/(x − 1) in which all arithmetic operations take place [1], [9].”
BackgroundTowards Quantum Large-Scale Password Guessing on Real-World Distributions
Dürmuth, M., Golla, M., Markert, P., May, A., & Schlieper, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92548-2_22 · Cited by 11
“Likewise, passwords could also be encrypted using a quantum-resistant authenticated encryption scheme like NTRU [27].”
MethodHow to Find Ternary LWE Keys Using Locality Sensitive Hashing
Kirshanova, E., & May, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92641-0_12 · Cited by 10
Quantum-Safe Group Key Establishment Protocol from Lattice Trapdoors
Gebremichael, T., Gidlund, M., Hancke, G. P., & Jennehag, U. (2022) · Sensors · doi:10.3390/s22114148 · Cited by 7
“To recover s , each user U i ∈ G uses its short-basis trapdoor S i to compute: The vector x is then lifted to its canonical representative [26] x ∈ [ q 2 , q 2 ) m , from which we obtain e = x t ( S − 1 ) Computing s , given e , is straightforward, as shown in [13].”
Non-interactive verifiable LWE-based multi secret sharing scheme
Kiamari, N., Dehkordi, M. H., & Mashhadi, S. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-13347-4 · Cited by 7
“Three important categories of post-quantum cryptography are Lattice-based, Hash based and Code based cryptography [3, 5, 13, 14, 17, 20, 23, 27, 39].”
BackgroundA Generalization of NTRUEncrypt —Cryptosystem Based on Ideal Lattice
Zheng, Z., Liu, F., Huang, W., Xu, J., & Tian, K. (2022) · Journal of Information Security · doi:10.4236/jis.2022.133010 · Cited by 7
“For the background materials, we refer to [3] [6] [17] [18] [19] and [20].”
Improved Lattice Enumeration Algorithms by Primal and Dual Reordering Methods
Yamamura, K., Wang, Y., & Fujisaki, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08896-4_8 · Cited by 7
“The security of lattice-based cryptography such as NTRU [8] and LWE-based schemes [12] depend on the hardness of some lattice problems, such as SVP, CVP, and their variants.”
The Complexity of the Shortest Vector Problem
Bennett, H. (2023) · ACM SIGACT News · doi:10.1145/3586165.3586172 · Cited by 17
Guo, Q., & Mårtensson, E. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_11 · Cited by 10
“9 Notice that we cannot increase the values of b 1 and b 2 too much, because then the other indices of (13) are not guaranteed to be equal to 0. ward for other LWE/LWR-based KEMs such as FrodoKEM [34], but might also be applicable to KEMs based on NTRU. e .g., NTRU [12] and NTRU prime [9].”
BackgroundInfluentialMulti-Keyword Searchable Identity-Based Proxy Re-Encryption from Lattices
Zhuang, E.-S., & Fan, C. (2023) · Mathematics · doi:10.3390/math11183830 · Cited by 7
Toward Understanding Efficient Privacy-Preserving Homomorphic Comparison
Pulido-Gaytan, L. B., Tchernykh, A. N., Leprévost, F., Bouvry, P., & Goldman, A. (2023) · IEEE Access · doi:10.1109/access.2023.3315655 · Cited by 7
“They include BGV [2], Gentry-Sahai-Waters (GSW) [17], YASHE [18], Hoffstein-Pipher-Silverman (HPS) [19], and López-Tromer-Vaikuntanathan (LTV) [20] schemes.”
A General NTRU-Like Framework for Constructing Lattice-Based Public-Key Cryptosystems
Pan, Y., & Deng, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27890-7_9 · Cited by 7
“The NTRU cryptosystem proposed by Hoffstein, Pipher, Silverman [14] is the most practical lattice-based scheme known to date.”
BackgroundMethodInfluentialStudy on NTRU Decryption Failures
Yu, W., He, D., & Zhu, S. (2005) · International Conference on Information Technology and Applications · doi:10.1109/icita.2005.266 · Cited by 7
“An example is given at the end of this paper.”
BackgroundReduced Gröbner bases and Macaulay–Buchberger Basis Theorem over Noetherian rings
Francis, M., & Dukkipati, A. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.01.001 · Cited by 7
A novel peer-to-peer SMS security solution using a hybrid technique of NTRU and AES-Rijndael
Albakri, S. H., & Kiah, M. L. M. (2010) · Scientific Research and Essays · doi:10.5897/sre.9000096 · Cited by 7
Private Proximity Testing on Steroids: An NTRU-based Protocol
Patsakis, C., Kotzanikolaou, P., & Bouroche, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24858-5_11 · Cited by 7
Cloud Storage Third-Party Data Security Scheme Based on Fully Homomorphic Encryption
Chen, J. (2016) · International Conference on Network and Information Systems for Computers (ICNISC) · doi:10.1109/icnisc.2016.042 · Cited by 7
“Encryption algorithms such as McEliece [5], GGH [6], NTRU [7] are recently a hot topic of cryptography research based on ring theory.”
MethodNFC Secure Payment and Verification Scheme with CS E-Ticket
Fan, K., Song, P., Du, Z., Zhu, H., Li, H., Yang, Y., Li, X., & Yang, C. (2017) · Security and Communication Networks · doi:10.1155/2017/4796373 · Cited by 7
Maturity and Performance of Programmable Secure Computation.
Archer, D. W., Bogdanov, D., Benny Pinkas, B., & Pullonen, P. (2015) · Cited by 7
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.
Smart, N. P., & Vercauteren, F. (2009) · Cited by 7
Accelerating the Development of NTRU Algorithm on Embedded Systems
Camacho-Ruiz, E., Martínez‐Rodríguez, M. C., Sánchez-Solano, S., & Brox, P. (2020) · Conference on Design of Circuits and Integrated Systems · doi:10.1109/dcis51330.2020.9268647 · Cited by 7
“The first version of NTRU was proposed in [6].”
BackgroundGadget-Based iNTRU Lattice Trapdoors
Genise, N., & Li, B. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65277-7_27 · Cited by 8
“(RLWE) [26,35] and the NTRU learning problem [22,32].”
BackgroundPost-quantum Certificates for Electronic Travel Documents
Pradel, G., & Mitchell, C. J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-66504-3_4 · Cited by 9
“Its hardness assumption is based on the ShortInteger-Solution (SIS) [1] problem over NTRU lattices [22].”
MethodEfficient Multiplier and FPGA Implementation for NTRU Prime
Wu, H., & Gao, X. (2021) · Conference proceedings - Canadian Conference on Electrical and Computer Engineering · doi:10.1109/ccece53047.2021.9569160 · Cited by 7
Kim, B. G., Wong, D., & Yang, Y. S. (2023) · International Journal on Cryptography and Information Security · doi:10.5121/ijcis.2023.13401 · Cited by 11
Cryptanalysis of an NTRU-Based Proxy Encryption Scheme from ASIACCS’15
Liu, Z., Pan, Y., & Zhang, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_9 · Cited by 7
Key Recovery Attacks on NTRU without Ciphertext Validation Routine
Han, D., Hong, J., Han, J. W., & Kwon, D. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45067-x_24 · Cited by 7
Efficiency Improvement for NTRU.
Buchmann, J. A., Döring, M., & Lindner, R. (2007) · Cited by 7
Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction
Seidel, T. E., Socek, D., & Sramka, M. (2004) · Designs Codes and Cryptography · doi:10.1023/b:desi.0000029235.59808.77 · Cited by 7
On the Bit Security of NTRUEncrypt
Näslund, M., Shparlinski, I. E., & Whyte, W. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_5 · Cited by 7
“We do not discuss the decryption procedure and thus the structure on the sets Lf ,Lg ,Lφ,Lm which maximizes the chance of unambiguous decryption (rather we refer to [12, 13] for details).”
BackgroundInfluentialRevisiting fully homomorphic encryption schemes and their cryptographic primitives
Zhang, Z. (2014) · Research Online (University of Wollongong) · Cited by 6
An Identification Scheme Based on Sparse Polynomials
Banks, W. D., Lieman, D. B., & Shparlinski, I. E. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_6 · Cited by 7
“The recently discovered idea of using polynomials with restricted coefficients in cryptography has already found several cryptographic applications such as the NTRU cryptosystem [7], the ENROOT cryptosystem [4] and the PASS identification scheme [6]; see also [5].”
BackgroundMcEliece Cryptosystem Based On Extended Golay CodePreprint
Bhatia, A. S., & Kumar, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.06246 · Cited by 8
“The extended binary Golay code G 24 is a [24, 12, 8] code, which encodes 12 bits of data into a word of 24-bit length in such a way that any 3-bit errors can be corrected or any 7-bit errors can be detected.”
BackgroundSieving for shortest vectors in lattices using angular locality-sensitive hashingPreprint
Laarhoven, T. (2014) · TU/e Research Portal · Cited by 7
On the Spinor Genus and the Distinguishing Lattice Isomorphism Problem
Ling, C., Liu, J., & Mendelsohn, A. R. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0894-2_11 · Cited by 6
“Lattices have been studied for almost 30 years by the cryptographic community, since works by Ajtai [1, 2] gave worst-case to average-case reductions for lattice problems and an encryption scheme whose hardness was based on such worst-case lattice problems, as well as the introduction of NTRU [21].”
BackgroundIdentity based proxy blind signature scheme using NTRU lattices
Singh, S., Rawal, S., Padhye, S., & Tiwari, N. (2025) · Information and Computation · doi:10.1016/j.ic.2025.105284 · Cited by 6
Cryptanalysis of Tropical Encryption Scheme Based on Double Key Exchange
Jiang, X., Huang, H., & Pan, G. (2023) · Journal of Cyber Security and Mobility · doi:10.13052/jcsm2245-1439.1224 · Cited by 6
Palma, D., & Montessoro, P. L. (2024) · IEEE Access · doi:10.1109/access.2024.3512003 · Cited by 9
Energy-Efficient Flexible RNS-CKKS Processor for FHE-Based Privacy-Preserving Computing
Kwon, H., Lee, H., Jung, G., & Lee, Y. (2024) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2024.3510917 · Cited by 6
“They are, of course, transmitted in encrypted to protect sensitive data for now, but conventional cryptography algorithms are partial homomorphic encryption (HE), which cannot fully support computation in encrypted form, so they should be decrypted into the original message on the server [3], [4].”
SecureMedZK - A Blockchain-based Approach with Zero-Knowledge Rollups for Secure EHR
Pongallu, D. R., Arun, S. S., & Verma, R. (2025) · IEEE International Conference on AI in Cybersecurity (ICAIC) · doi:10.1109/icaic63015.2025.10848761 · Cited by 7
“PBFT keeps the network secure and intact in the case of node failure, which maintains the system's stability [13].”
Fast public-key encryption scheme based on Chinese remainder theorem
Wang, B., Wei, Y., & Hu, Y. (2009) · Frontiers of Electrical and Electronic Engineering in China · doi:10.1007/s11460-009-0024-z · Cited by 6
Adaptively Secure Hierarchical Identity-Based Encryption over Lattice
Zhang, L., & Wu, Q. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-64701-2_4 · Cited by 6
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $
Bajard, J.-C., Marrez, J., Plantard, T., & Véron, P. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2022018 · Cited by 8
A retrospective study on NTRU cryptosystem
Mittal, S., & Ramkumar, K. R. (2022) · AIP conference proceedings · doi:10.1063/5.0095312 · Cited by 6
A Survey of Cryptography and Key Management Schemes for Wireless Sensor Networks
Sen, J. (2023) · IntechOpen eBooks · doi:10.5772/intechopen.112277 · Cited by 6
Hybrid Encryption Technique to Enhance Security of Health Data in Cloud Environment
Dutta, A., Bose, R., Roy, S., & Sutradhar, S. (2023) · Archives of Pharmacy Practice · doi:10.51847/raeh8fhbt6 · Cited by 8
“The program then employs honey encryption to protect the data against password-guessing attacks and generates honey words for the user to input to decrypt the data [14, 16].”
NTRU in Quaternion Algebras of Bounded Discriminant
Ling, C., & Mendelsohn, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_10 · Cited by 7
Improving OTP Authentication with PQC Algorithms
Khorkheli, L., Bourne, D., Chakravarty, V., Abraham, S., Satrya, G. B., & Mnaouer, A. B. (2024) · Global Information Infrastructure and Networking Symposium · doi:10.1109/giis59465.2024.10449920 · Cited by 6
“The NTRU cryptographic algorithm [24] provides compact and efficiently generated keys, speedy operations, and low memory requirements.”
BackgroundCompact Encryption Based on Module-NTRU Problems
Bai, S., Jangir, H., Lin, H., Ngo, T., Wen, W., & Zheng, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62743-9_13 · Cited by 8
“As evidence, many promising candidates in the recent Introduced in the pioneering work of Hoffstein, Pipher and Silverman [HPS98], the NTRU problem asks: input a polynomial h in ring R q = Z q [ x ] / ( P ( x )) , find two polynomials f, g ∈ R q with small magnitudes such that h ≡ g/f (mod q )…”
BackgroundHoffstein, J., Pipher, J. C., & Silverman, J. H. (2014) · Undergraduate texts in mathematics · doi:10.1007/978-1-4939-1711-2_7 · Cited by 6
Self-citationMaurer, U. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44577-3_5 · Cited by 6
Sharing secret using lattice construction
Asaad, S., Khorasgani, H. A., Eghlidos, T., & Aref, M. (2014) · International Symposium on Telecommunications · doi:10.1109/istel.2014.7000831 · Cited by 6
“The first steps have already been taken by introducing some lattice based cryptosystems, namely GGH, NTRU and LWE basedcryptosystems [3], [4] and [5].”
BackgroundEnergy-efficient, secure group key agreement for ad hoc networks
Halford, T. R., Courtade, T. A., & Chugg, K. M. (2013) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2013.6682706 · Cited by 6
“Recent advances in lattice-based cryptography (e.g., the NTRU cryptosystem) are paving the way for the development of energy-efficient PKAs (cf., [4] [5]); the second issue, however, has received considerably less attention in the literature.”
BackgroundEfficient interleaved Montgomery modular multiplication for lattice-based cryptography
Akleylek, S., & Tok, Z. Y. (2014) · IEICE Electronics Express · doi:10.1587/elex.11.20140960 · Cited by 6
A public key algorithm for optical communication based on lattice cryptography
Abdallah, W., Hamdi, M., & Boudriga, N. A. (2009) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2009.5202365 · Cited by 6
On Acceleration and Scalability of Number Theoretic Private Information Retrieval
Ünal, E., & Savaş, E. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2456021 · Cited by 6
“As the comparison circuit is very simple , a SWFHE based on a variant of NTRU [ 17 ] encryp - tion scheme becomes almost practical for PIR implementa - tion .”
MethodInfluentialSecure architectures of future emerging cryptography SAFEcrypto
O'Neill, M. P., O’Sullivan, E., McWilliams, G., Saarinen, M.-J. O., Rafferty, C., Khalid, A., Howe, J., del Pino, R., Abdalla, M. F., Regazzoni, F., et al. (2016) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/2903150.2907756 · Cited by 6
“The NTRU cryptosystem [8] introduced the concept of using polynomial rings, which resulted in significant savings in efficiency, and this concept inspired later efficient ring-based schemes.”
BackgroundMethodDemand Response Management Using Lattice-Based Cryptography in Smart Grids
Desai, S. K., Dua, A., Kumar, N., Das, A. K., & Rodrigues, J. J. P. C. (2018) · Globecom · doi:10.1109/glocom.2018.8647560 · Cited by 6
“A few attempts made by engineers for the security of smart grid using LBC use N th Degree Truncated Polynomial Ring (NTRU) based methods [13] that are not feasible in the domain of smart grids because they are computationally heavy.”
MethodSecurity in Wireless Sensor Network and IoT: An Elliptic Curves Cryptosystem based Approach
Teguig, E. H., & Touati, Y. (2018) · IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON) · doi:10.1109/uemcon.2018.8796578 · Cited by 6
“Approaches based on public key algorithms have been developed [17-20].”
MethodBI-NTRU Encryption Schemes: Two New Secure Variants of NTRU
Seck, M., & Sow, D. (2019) · Communications in computer and information science · doi:10.1007/978-3-030-36237-9_13 · Cited by 7
Li, Z., Ling, S., Xing, C., & Yeo, S. L. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2967047 · Cited by 6
“On the other hand, early lattice-based encryption schemes include the Ajtai-Dwork Encryption [1], Goldreich-Goldwasser-Halevi (GGH) encryption [20] and NTRU encryption [23].”
MethodStudying lattice reduction algorithms improved by quick reordering technique
Wang, Y., & Takagi, T. (2020) · International Journal of Information Security · doi:10.1007/s10207-020-00501-y · Cited by 6
A general construction for monoid-based knapsack protocols
Micheli, G., & Schiavina, M. (2014) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-98258 · Cited by 6
Privacy-preserving remote deep-learning-based inference under constrained client-side environment
Boulemtafes, A., Derhab, A., Braham, N. A. A., & Challal, Y. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-03312-8 · Cited by 7
Constant Time Algorithms for ROLLO-I-128
Melchor, C. A., Aragon, N., Bellini, E., Caullery, F., Makarim, R. H., & Marcolla, C. (2021) · SN Computer Science · doi:10.1007/s42979-021-00761-y · Cited by 7
“As stated by the submission documentation all ROLLO variants follow the approach inaugurated by the public key encryption protocol NTRU in 1998 [HPS98].”
MethodPQ-FLAT: A New Quantum-Resistant And Lightweight Authentication Approach for M2M Devices
Karacan, E., Akleylek, S., & Karakaya, A. (2021) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs52919.2021.9486341 · Cited by 7
Blanco-Chacón, I. (2020) · Irish Mathematical Society Bulletin · doi:10.33232/bims.0086.17.46 · Cited by 6
Biswas, C., & Dutta, R. (2022) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-022-03864-3 · Cited by 6
“López-Alt et al. (2012) introduced the notion of multi-key FHE along with a candidate construction based on N -th degree Truncated polynomial Ring Units ( NTRU) encryption (Hoffstein et al. 1998).”
Choosing Parameters for the Subfield Lattice Attack Against Overstretched NTRU
Duong, D. H., Yasuda, M., & Takagi, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69659-1_5 · Cited by 6
“The NTRU encryption scheme is one of the first cryptosystems based on lattices proposed in 1998 by Hoffstein, Pipher and Silverman [11].”
MethodInfluentialAn improved Fully Homomorphic Encryption model based on N-Primes
Mohammed, M. A., & Abed, F. S. (2019) · Kurdistan Journal of Applied Research · doi:10.24017/science.2019.2.4 · Cited by 6
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.