The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
NTRU: A ring-based public key cryptosystem
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 701–800 of 1,000
On Constrained Implementation of Lattice-based Cryptographic Primitives and Schemes on Smart Cards.
Boorghany, A., Bayat-Sarmadi, S., & Jalili, R. (2014) · Cited by 10
An innovative tripternion algebra for designing NTRU - like cryptosystem with high security
Shahhadi, S. H., & Yassein, H. R. (2022) · AIP conference proceedings · doi:10.1063/5.0067023 · Cited by 10
A Deterministic Polynomial Public Key Algorithm over a Prime Galois Field GF(p)
Kuang, R. (2021) · Asia Conference on Computers and Communications (ACCC) · doi:10.1109/accc54619.2021.00020 · Cited by 15
Authorized Update in Multi-user Homomorphic Encrypted Cloud Database
Parbat, T., & Chatterjee, A. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3221148 · Cited by 10
“Hence, performance improvement and cipher and/or key size reduction are the main objectives for next in-line works in this direction as detailed in [7], [8], [21], [27], [43], [46] etc.”
BackgroundMethodQuantum Rewinding for Many-Round Protocols
Lai, R. W. F., Malavolta, G., & Spooner, N. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22318-1_4 · Cited by 10
“…h × ℓ q in the support of ( Enc ( pk , b 1 ) , . . . , Enc ( pk , b ℓ )) , and all vectors x ∈ R ℓ where ∥ x ∥ ≤ β , it holds that: Examples of encryption schemes that satisfy the above property are NTRU [HPS98,SS11] (for h = 1 ) and Regev encryption based on (Ring)-LWE [Reg05,LPR10] (for h > 1 ).”
Certificateless ring signature from NTRU lattice for electronic voting
Yu, H., & Hui, W. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103496 · Cited by 10
Practical Improvements on BKZ Algorithm
Zhao, Z., & Ding, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-34671-2_19 · Cited by 10
“The security of it is mainly based on some lattice problems, such as learning with error problem (LWE) [10,18,27] and NTRU problem [14].”
BackgroundA non‐associative lattice‐based public key cryptosystem
Malekian, E., & Zakerolhosseini, A. (2011) · Security and Communication Networks · doi:10.1002/sec.297 · Cited by 10
“[1], has attracted the industry’s attention in recent years due to such distinguished features as high efficiency, low power consumption, and cost-effective implementation.”
BackgroundEfficient Quasigroup Block Cipher for Sensor Networks
Battey, M., & Parakh, A. (2012) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2012.6289294 · Cited by 11
“Further, public key systems such as NTRU [10] and elliptic curve cryptosystems [2] have lower power consumptions compared to RSA however compared to secret key systems they are much more computationally expensive.”
BackgroundOn the Geometry of Cyclic Lattices
Fukshansky, L., & Sun, X. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9608-3 · Cited by 10
“In fact, cyclic lattices are used in the well known NTRU cryptosystem [10], [9] (also see, for instance [22] and [23] for some details) and are further discussed in the context of post-quantum cryptography [3].”
MethodPortable Implementation of Lattice-Based Cryptography Using JavaScript
Yuan, Y., Cheng, C.-M., Kiyomoto, S., Miyake, Y., & Takagi, T. (2015) · International Symposium on Computing and Networking · doi:10.1109/candar.2015.36 · Cited by 10
“Specifically, we have chosen two schemes from the NTRU family, the original NTRU scheme [17] and one of its derivatives [36, 6]; the latter we shall refer to as NTRU-IEEE07.”
BackgroundMethodInfluentialA New Self-Certified Signature Scheme Based on NTRUSing for Smart Mobile Communications
Li, D., Chen, H., Zhong, C., Li, T., & Wang, F. (2017) · Wireless Personal Communications · doi:10.1007/s11277-017-4385-y · Cited by 10
ECC Based-Approach for Keys Authentication and Security in WSN
Teguig, E. H., Touati, Y., & Ali-Chérif, A. (2017) · IEEE GCC Conference and Exhibition (GCCCE) · doi:10.1109/ieeegcc.2017.8447901 · Cited by 10
“The benefit of using ECC is due to a smaller key size, leading to reduce storage and transmission requirements providing the same level of security comparatively to RSA-based methods where key size is larger.”
MethodInfluentialModular lattice signatures, revisited
Das, D., Hoffstein, J., Pipher, J. C., Whyte, W., & Zhang, Z. (2019) · Designs Codes and Cryptography · doi:10.1007/s10623-019-00694-x · Cited by 10
“In practice, it is natural to instantiate the scheme with NTRU lattices [25] to get optimized signatures as was done in BLISS [13] and DLP [11].”
BackgroundMethodSelf-citationAbiega-L'Eglisse, A. F. D., Delgado-Vargas, K. A., Valencia-Rodriguez, F. Q., Gonzalez-Quiroga, V. G., Gallegos-García, G., & Nakano-Miyatake, M. (2020) · IEEE Access · doi:10.1109/access.2020.3040324 · Cited by 13
“They compared different combinations of key exchange schemes, such as ECDHE [12], BCNS15 [6], NewHope [9], NTRU [13] and Frodo [7].”
MethodFast and Error-Free Negacyclic Integer Convolution Using Extended Fourier Transform
Klemsa, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-78086-9_22 · Cited by 12
Kuang, R., & Barbeau, M. (2021) · Conference proceedings - Canadian Conference on Electrical and Computer Engineering · doi:10.1109/ccece53047.2021.9569200 · Cited by 11
Modern Cryptography Volume 2: A Classical Introduction to Informational and Mathematical Principle
Zheng, Z., Tian, K., & Liu, F. (2022) · Financial Mathematics and Fintech · doi:10.1007/978-981-19-7644-5 · Cited by 14
An Algebraic Broadcast Attack against NTRU
Ding, J., Pan, Y., & Deng, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31448-3_10 · Cited by 10
Analytical study of implementation issues of NTRU
Tata, P. G., Narumanchi, H., & Emmadi, N. (2014) · International Conference on Advances in Computing, Communications and Informatics (ICACCI) · doi:10.1109/icacci.2014.6968468 · Cited by 9
Authenticating Privately over Public Wi-Fi Hotspots
Cassola, A., Blaß, E.-O., & Noubir, G. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813647 · Cited by 10
“New lattice-based PIR has received significant attention in recent years [2, 22, 29, 35] for their improved speed in comparison to number-theoretic algorithms, allowing for faster processing.”
BackgroundMethodDing, J., & Lindner, R. (2007) · TUbilio (Technical University of Darmstadt) · Cited by 10
EPiC: efficient privacy-preserving counting for MapReduce
Vo-Huu, T. D., Blaß, E.-O., & Noubir, G. (2018) · Computing · doi:10.1007/s00607-018-0634-5 · Cited by 10
How to Compute on Encrypted Data
Vaikuntanathan, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34931-7_1 · Cited by 10
On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption.
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2013) · Cited by 11
NTRU over the Eisenstein Integers
Jarvis, K. (2011) · uO Research (University of Ottawa) · doi:10.20381/ruor-4492 · Cited by 10
“35 4.1 ETRU Encryption and Decryption Speed . . . . . . . . . . . . . . . 78 5.1 Lattice reduction on LET . . . . . . . . . . . . . . . . . . . . . . . . 93 5.2 Lattice reduction on LET ∗ . . . . . . . . . . . . . . . . . . . . . . . . 94 5.3 Lattice reduction on LNT . . . . . . . . . . . . . . . . . . . . . . . . 96…”
BackgroundMethodInfluentialNew NTRU Records with Improved Lattice Bases
Kirshanova, E., May, A., & Nowakowski, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_7 · Cited by 10
“The NTRU cryptosystem [HPS98] from 1998 can be considered a blueprint for most efficient lattice-based constructions [BDK + 18,FHK + 18].”
BackgroundQuantum-Safe HIBE: Does It Cost a Latte?
Zhao, R. K., McCarthy, S., Steinfeld, R., Sakzad, A., & O'Neill, M. P. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3347880 · Cited by 8
Compact and efficient KEMs over NTRU lattices
Liang, Z., Fang, B., Zheng, J., & Zhao, Y. (2024) · Computer Standards & Interfaces · doi:10.1016/j.csi.2023.103828 · Cited by 11
“Actually, NTRU-based KEM schemes [10], [16], [30], [32] have ciphertexts of the form c = phr + m mod q, where p is the message space modulus, h is the public key, r is the randomness, and m is the message to be encrypted.”
BackgroundMethodInfluentialImproved Provable Reduction of NTRU and Hypercubic Lattices
Bambury, H., & Nguyễn, P. Q. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62743-9_12 · Cited by 12
“For the original NTRU [31] from the 90s and for Falcon [24], this does not hold but can be taken care of by a mild heuristic assumption on the projection of secret vectors over random subspaces related to lattice reduction: similar yet stronger assumptions were made and checked in the context of…”
InfluentialEfficient iNTRU-based public key authentication keyword searchable encryption in cloud computing
Yao, Y., Chen, H., Wang, K., Yu, H., Wang, Y., & Wang, Q. (2024) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2024.103231 · Cited by 10
Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile Cloud
Miao, Y., Wang, G., Li, X., Li, H., Choo, K. R., & Deng, R. H. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2024.3482321 · Cited by 9
Secure Messaging in Post Quantum Cryptography using NTRUEncryption
Kaveri, S. P., Radhakrishnan, I., & Honnavalli, P. B. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10725587 · Cited by 9
“[11][14].”
Kodete, C. S., Thuraka, B., & Pasupuleti, V. (2024) · International Conference on Computer and Applications (ICCA) · doi:10.1109/icca62237.2024.10927942 · Cited by 9
“A study on autonomous vehicles, for example, demonstrated that lattice-based encryption could secure vehicle-to-vehicle (V2V) communications without significant performance overhead [13].”
A Secure and Efficient Mutual Authentication Protocol for Low-Cost RFID Systems
Poulopoulos, G., Markantonakis, K., & Mayes, K. E. (2009) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1109/ares.2009.83 · Cited by 11
“Public key encryption algorithms require much more gates than symmetric, even when efficient schemes are used such as NTRU [7], setting such a solution also prohibitive for low-cost R 978-0-7695-3564-7/09 $25.00 © 2009 IEEE DOI 10.1109/ARES.2009.83 706 RFID systems.”
MethodInfluentialEfficient Linkable Ring Signature Scheme over NTRU Lattice with Unconditional Anonymity
Ye, Q., Wang, M., Meng, H., Xia, F., & Yan, X. (2022) · Computational Intelligence and Neuroscience · doi:10.1155/2022/8431874 · Cited by 10
Multi-key Fully Homomorphic Encryption without CRS from RLWE
Luo, F., Wang, H., Al-Kuwari, S. M., & Han, W. (2023) · Computer Standards & Interfaces · doi:10.1016/j.csi.2023.103742 · Cited by 9
A Comparative Study of Secure Outsourced Matrix Multiplication Based on Homomorphic Encryption
Babenko, M. G., Golimblevskaia, E., Tchernykh, A. N., Shiriaev, E. M., Ermakova, T., Pulido-Gaytan, L. B., Valuev, G., Avetisyan, A. I., & Gagloeva, L. A. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7020084 · Cited by 9
Efficient Implementation of NTRU Cryptography using Residue Number System
Zalekian, A., Esmaeildoust, M., & Kaabi, A. (2015) · International Journal of Computer Applications · doi:10.5120/ijca2015905527 · Cited by 9
Searchable Encryption Scheme on the Cloud via Fully Homomorphic Encryption
Liu, J., Han, J.-L., & Wang, Z. (2016) · International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC) · doi:10.1109/imccc.2016.201 · Cited by 9
“Multikey Fully Homomorphic Encryption Scheme Follow the Gentry’s blueprint, a multikey somewhat homomorphic encryption scheme was constructed based on the modified NTRU (Number Theory Research Unit) encryption scheme [4, 5,6,7].”
MethodAn Existential Unforgeable Signature Scheme Based on Multivariate Quadratic Equations
Shim, K., Park, C.-M., & Koo, N. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70694-8_2 · Cited by 9
“code-based cryptography (McEliece encryption [37]), lattice-based cryptography (NTRU [30]), hash-based cryptography (Merkle’s hash-tree signatures [38]), and multivariate quadratic (MQ) cryptography (HFEv- [40], UOV [33]).”
BackgroundA Public-Key Encryption Scheme Based on Non-linear Indeterminate Equations
Akiyama, K., Goto, Y., Okumura, S., Takagi, T., Nuida, K., & Hanaoka, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_11 · Cited by 9
Paul, S., & Niethammer, M. (2019) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0019 · Cited by 11
“Variants of this system exist, such as NTRUEncrypt, which is a public-key encryption scheme and NTRUSign, which is a lattice-based signature scheme.”
BackgroundIntroduction to Blockchain Technology
Bolfing, A. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.003.0006 · Cited by 11
A Fully Decentralized Infrastructure for Subscription-based IoT Data Trading
Lin, C.-H. V., Huang, C., Yuan, Y.-H., & Yuan, Z. (2020) · International Congress on Blockchain and Applications · doi:10.1109/blockchain50366.2020.00027 · Cited by 9
“The access control can be enabled via encryption with NTRU [16], a quantum secure cryptosystem, or Pre-shared key (PSK), to prevent random users retrieving the data from channels.”
MethodLattice Attacks on NTRU Revisited
Bi, J., & Han, L. (2021) · IEEE Access · doi:10.1109/access.2021.3076598 · Cited by 9
“The NTRU cryptosystem [13] is one of fastest public-key cryptosystems, which consists of encryption (called NTRU-Encrypt) and digital signatures (called NTRUSign).”
BackgroundMethodInfluentialNTRU-Based Fully Homomorphic Signature
Li, R., Wang, F., Zhang, R., & Chen, K. (2022) · Security and Communication Networks · doi:10.1155/2022/9942717 · Cited by 9
Improved lattice enumeration algorithms by primal and dual reordering methods
Yamamura, K., Wang, Y., & Fujisaki, E. (2022) · IET Information Security · doi:10.1049/ise2.12083 · Cited by 10
Efficiently Masking Polynomial Inversion at Arbitrary Order
Krausz, M., Land, G., Richter-Brockmann, J., & Güneysu, T. E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_15 · Cited by 15
“The finalist NTRU is based on the original work by Hoffstein et al. [20] and on the work by H¨ulsing et al. [21].”
BackgroundMethodInfluentialSome Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
Boudgoust, K., Gachon, E., & Pellet-Mary, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15979-4_17 · Cited by 9
“Many structured lattice assumptions, such as Ring-LWE [SSTX09,LPR10], NTRU [HPS98] or Module-LWE [LS15] can be solved with an SVP solver in module lattices of small rank ( ≥ 2).”
Programmable RNS lattice-based parallel cryptographic decryption
Martins, P., Sousa, L. A., Eynard, J., & Bajard, J.-C. (2015) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2015.7245723 · Cited by 9
“This type of cryptography appeared during the 90s, with proposals such as GGH [2] and NTRU [3].”
MethodA New Ring Signature Scheme from NTRU Lattice
Wang, C., & Wang, H. (2012) · International Conference on Computational and Information Sciences · doi:10.1109/iccis.2012.31 · Cited by 9
“Since then many lattice-based cryptographic primitives have been proposed [14] [7] [10] [17].”
BackgroundJha, R., & Saini, A. K. (2011) · International Conference on Communication Systems and Network Technologies · doi:10.1109/csnt.2011.23 · Cited by 9
“The NTRU algorithm uses a mixing system based on polynomial algebra and reduction modulo two numbers p and q.”
MethodPrivacy-Preserving Biometric Authentication and Matching via Lattice-Based Encryption
Patsakis, C., van Rest, J., Choraś, M., & Bouroche, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29883-2_11 · Cited by 9
“One of the most well known lattice based algorithms is NTRU [24].”
BackgroundMethodMalina, L., Ricci, S., Dzurenda, P., Smékal, D., Hajný, J., & Gerlich, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-41025-4_8 · Cited by 14
Dynamic multi-key FHE in symmetric key setting from LWE without using common reference matrix
Biswas, C., & Dutta, R. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-02980-w · Cited by 10
“Consequently, lattice-based cryptographic constructions (Hoffstein et al. 1998; Stehlé and Steinfeld 2011; Applebaum et al. 2009; Dodis et al. 2016; Agrawal et al. 2010; Cash et al. 2012) are potential candidates for the post-quantum era.”
BackgroundEfficient FPGA implementation of RNS Montgomery multiplication using balanced RNS bases
Ahsan, J., Esmaeildoust, M., Kaabi, A., & Zarei, V. (2022) · Integration · doi:10.1016/j.vlsi.2021.12.006 · Cited by 9
Enhanced model for PKI certificate validation in the mobile banking
Elbasheer, M. O., & Bashier, E. B. M. (2013) · INTERNATIONAL CONFERENCE ON COMPUTING, ELECTRICAL AND ELECTRONIC ENGINEERING · doi:10.1109/icceee.2013.6633984 · Cited by 535
“Moreover, if a comparison made between CRL, OCSP and a short-lived certificate, it consider far more efficient than CRLs and OCSP, and require no client-side changes [13].”
BackgroundMethodOn lower bounds for Information Set Decoding over Fq and on the effect of Partial Knowledge
Niebuhr, R., Persichetti, E., Cayrel, P.-L., Bulygin, S., & Buchmann, J. A. (2017) · HAL · doi:10.1504/ijicot.2017.081458 · Cited by 10
Efficient post-quantum secure deterministic wallet scheme
Hu, M., Liu, Z., & Zhou, Y. (2024) · Cybersecurity · doi:10.1186/s42400-024-00216-w · Cited by 8
“…including the standard lattice given above, the compact lattices defined over polynomial rings (Lyubashevsky et al. 2010) (i.e., number rings) of the form R = Z [ X ] /(� n ( X )) for a cyclotomic polynomial � n ( X ) = X n + 1 , and the more compact NTRU lat-tices (Hoffstein et al. 1998).”
BackgroundRing Signatures for Deniable AKEM: Gandalf’s Fellowship
Gajland, P., Janneck, J., & Kiltz, E. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68376-3_10 · Cited by 8
“Lemma 2 (NTRU Trapdoor Generation [HPS98,Pre15]).”
SCOPE: Schoolbook-Originated Novel Polynomial Multiplication Accelerators for NTRU-Based PQC
Tu, Y., Bai, S., Xiong, J., & Xie, J. (2024) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2024.3458872 · Cited by 8
Bagchi, P., Bera, B., Das, A. K., & Sikdar, B. (2025) · ACM Transactions on Sensor Networks · doi:10.1145/3715696 · Cited by 8
“For example, QFT can be used to attack the f th degree truncated polynomial ring used in the NTRU cryptosystem [25].”
Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives
Bhoi, S. S., Arakala, A., Corman, A. B., & Rao, A. (2025) · Cryptography · doi:10.3390/cryptography9020031 · Cited by 15
“The GSW scheme is based on the Learning With Errors (LWE) problem and employs an approximate eigenvector approach to achieve fully homomorphic encryption.”
Preprocessing optimisation: revisiting recursive‐BKZ lattice reduction algorithm
Haque, M. M., & Pieprzyk, J. (2018) · IET Information Security · doi:10.1049/iet-ifs.2017.0400 · Cited by 8
RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices
Blanco-Chacón, I. (2021) · Journal of Algebra and Its Applications · doi:10.1142/s0219498822502188 · Cited by 10
Uncompressed 8K-video-transmission System for Remote Production Secured by Post-quantum Cryptography
Yamaguchi, T., Kimura, N., Mochida, Y., Mizuno, K., Takasugi, K., Sakae, C., Saito, T., & Shirai, D. (2023) · IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB) · doi:10.1109/bmsb58369.2023.10211442 · Cited by 8
“For example, NTRU is a type of PQC based on a lattice problem [4].”
BackgroundMethodA Generic Construction of an Anonymous Reputation System and Instantiations from Lattices
Blömer, J., Bobolz, J., & Porzenheim, L. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8724-5_13 · Cited by 8
Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
Conrad, J., Eisert, J., & Seifert, J. (2024) · Quantum · doi:10.22331/q-2024-07-04-1398 · Cited by 24
“It is interesting that this class of NTRU-GKP codes thus shares characteristics of both scaled-as well as concatenated GKP codes.”
BackgroundMethodInfluentialLossy Cryptography from Code-Based Assumptions
Dao, Q., & Jain, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68382-4_2 · Cited by 15
New Secret Keys for Enhanced Performance in (T)FHE
Bergerat, L., Chillotti, I., Ligier, D., Orfila, J.-B., Roux-Langlois, A., & Tap, S. (2024) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3658644.3670376 · Cited by 8
A Ciphertext-Only Attack Against the Cai-Cusick Lattice-Based Public-Key Cryptosystem
Pan, Y., & Deng, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2103790 · Cited by 8
“After their results, several lattice-based cryptosystems [8], [9], [5], [7], [11], [12], [2] have been proposed.”
Utsunomiya, Y., Toyoda, K., & Sasase, I. (2016) · Journal of Information Processing · doi:10.2197/ipsjjip.24.109 · Cited by 8
“For example, the NTRU cryptosystem [4] is a cryptosystem with both additive and multiplicative homomorphisms [5].”
BackgroundMethodComputing the M = UU t Integer Matrix Decomposition
Geißler, K., & Smart, N. P. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40974-8_18 · Cited by 8
Algebraic generalization of Diffie–Hellman key exchange
Partala, J. (2017) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2017-0015 · Cited by 10
Risk based Security Enforcement in Software Defined Network
Tripathy, B. K., Das, D. P., Jena, S. K., & Bera, P. (2018) · Computers & Security · doi:10.1016/j.cose.2018.07.010 · Cited by 8
Performance Evaluation of Post-quantum Public-Key Cryptography in Smart Mobile Devices
Chikouche, N., & Ghadbane, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-02131-3_9 · Cited by 8
Provably Secure NTRUEncrypt over Any Cyclotomic Field
Wang, Y., & Wang, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-10970-7_18 · Cited by 8
Post-quantum key exchange for the TLS protocol from the ring learning with errors problem.
Bos, J. W., Costello, C., Naehrig, M., & Stebila, D. (2014) · QUT ePrints (Queensland University of Technology) · Cited by 8
Fully homomorphic encryption based on the ring learning with rounding problem
Luo, F., Wang, F., Wang, K., & Chen, K. (2019) · IET Information Security · doi:10.1049/iet-ifs.2018.5427 · Cited by 8
Securing GOOSE: The Return of One-Time Pads
Boakye-Boateng, K., & Lashkari, A. H. (2019) · IEEE International Carnahan Conference on Security Technology (ICCST) · doi:10.1109/ccst.2019.8888435 · Cited by 9
“[23] encryption algorithm in ensuring security of SCADA.”
MethodQuantum-resistant Lattice-based Authentication for V2X Communication in C-ITS
Ha, S., Lee, H., Won, D., & Lee, Y. (2020) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1109/imcom48794.2020.9001682 · Cited by 9
“Moreover, if all parameters set as the recommended in [18], [22], then our scheme offers 2(1)28 post-quantum security.”
BackgroundCertificateless based Quantum Cryptosystem for Ad-Hoc UWB-IR
Miri, J., Nsiri, B., & Bouallègue, R. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07449-1 · Cited by 8
“The NTRU Encrypt [25] is based on arithmetic in a polynomial ring R = Z(x)∕((x − 1), q) set up by the parameter set (N, p, q).”
BackgroundTESLAC: Accelerating Lattice-Based Cryptography with AI Accelerator
Wan, L., Zheng, F., & Lin, J. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90019-9_13 · Cited by 8
A Novel Certificateless Multi-signature Scheme over NTRU Lattices
Chen, X., Huang, Q., & Huang, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-93206-0_21 · Cited by 8
Custom TTA Operations for Accelerating Kyber Algorithm
Akçay, L., & Örs, B. (2021) · National Conference on Electrical and Electronics Engineering (ELECO) · doi:10.23919/eleco54474.2021.9677863 · Cited by 7
AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE
Choudhary, S., & Gupta, A. K. (2022) · International Journal of Information Technology · doi:10.1007/s41870-022-00888-y · Cited by 8
Ouroboros: An Efficient and Provably Secure KEM Family
Aragon, N., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zémor, G. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3168439 · Cited by 8
Felderhoff, J., Pellet-Mary, A., & Stehlé, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_24 · Cited by 8
“It was noticed very early that the NTRU problem can be interpreted in terms of Euclidean lattices [HPS98,CS97].”
FPGA implementation of BIKE for quantum-resistant TLS
Galimberti, A., Galli, D., Montanaro, G., Fornaciari, W., & Zoni, D. (2022) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd57027.2022.00078 · Cited by 8
“Submitted proposals span over a wide portion of state of the art in computational theory, including algebraic geometry [9], coding theory [10], and lattice theory [11].”
BackgroundA Polynomial Multiplication Accelerator for Faster Lattice Cipher Algorithm in Security Chip
Xu, C., Yu, H., Xi, W., Zhu, J., Chen, C., & Jiang, X. (2023) · Electronics · doi:10.3390/electronics12040951 · Cited by 8
Quantum-Resistant MACsec and IPsec for Virtual Private Networks
Gazdag, S.-L., Grundner-Culemann, S., Heider, T., Herzinger, D., Schärtl, F., Cho, J. Y., Guggemos, T., & Loebenberger, D. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30731-7_1 · Cited by 10
NEV: Faster and Smaller NTRU Encryption Using Vector Decoding
Zhang, J., Feng, D., & Yan, D. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8739-9_6 · Cited by 9
“, p = 3 in [11, 24, 25, 43]) with a publicly known ring element v ∈ R∗ q .”
BackgroundMethodAlgebraic Cryptanalysis of CTRU Cryptosystem
Vats, N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69733-6_24 · Cited by 8
“NTRU [ 8 ]was proposed in 1996 as a fast public key encryption system.”
BackgroundA Key Encapsulation Mechanism for NTRU
Stam, M. (2005) · Lecture notes in computer science · doi:10.1007/11586821_27 · Cited by 8
An Improvement and a New Design of Algorithms for Seeking the Inverse of an NTRU Polynomial
Zhao, N., & Su, S. (2011) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2011.201 · Cited by 8
Lattice Polly Cracker cryptosystems
Caboara, M., Caruso, F., & Traverso, C. E. (2010) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2010.10.004 · Cited by 9
“, 1997) and NTRU (Hoffstein et al., 1998) do not have this property.”
BackgroundInfluentialEfficient Implementation of NTRU Cryptosystem Using Sliding Window Methods
Lee, M., Jung Woo, K. I. M., Song, J. E., & Park, K. (2012) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e96.a.206 · Cited by 8
Improving BDD Cryptosystems in General Lattices
Rose, M., Plantard, T., & Susilo, W. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21031-0_12 · Cited by 9
“NTRU was proposed in 1998 by Hoffstein, Pipher and Silverman [21].”
MethodAn efficient broadcast attack against NTRU
Li, J., Pan, Y., Liu, M., & Zhu, G. (2012) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2414456.2414467 · Cited by 8
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.