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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems
Weis, S. A., Sarma, S. E., Rivest, R. L., & Engels, D. W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39881-3_18 · Cited by 1,382
“Continued research into efficient symmetric encryption algorithms, such as TEA [32, 33], may yield algorithms appropriate for low-cost RFID devices.”
BackgroundMethodInfluentialA Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
“To obtain a practical and applicable FHE scheme, one of the crucial steps is taken by showing the construction of an FHE scheme from NTRU-Encrypt, which is an old encryption scheme proposed by Hoffstein, Pipher, and Silver-manin in [Hoffstein et al. 1998].”
BackgroundMethodBernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
“In the 1990s Hoffstein, Pipher, and Silverman [16] introduced an encryption system “NTRU” that has much smaller keys than McEliece’s system and that remains unbroken today.”
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
“Based on the idea from the NTRU cryptosystem [43] of working with elements over polynomial rings rather than over the integers, and following a series of works on this topic [58], [56], [63], [71], Lyubashevsky et al.”
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
“A parallel line of work that utilizes ideal lattices in cryptography dates back to the NTRU cryptosystem [22].”
BackgroundOn-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
“The investigated public key algorithms include Rabin’s Scheme [34], NtruEncrypt [ 35 ], RSA [30], and Elliptic Curve Cryptography (ECC) [36, 37].”
MethodLattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
“On the encryption front, lattice-based schemes have been making a lot of progress with recent provably-secure schemes [39] [28] [24] [41] being almost as practical as (and actually looking quite similar to) the deployed NTRU [20] encryption scheme, which in turn has many advantages over number theory-based schemes.”
MethodOn Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
“Influenced by the heuristic design of the NTRU cryptosystem [16], Micciancio [23] proposed a “compact,” efficient one-way function using a ring-based variant of SIS that he showed to be at least as hard as worst-case problems on cyclic lattices.”
MethodFully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Smart, N. P., & Vercauteren, F. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_25 · Cited by 808
“Various cryptographic schemes make use of lattices, sometimes just to argue about their security (such as NTRU [11]), in other cases lattices are vital to understand the workings of the scheme algorithms (such as [9]).”
BackgroundFHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
Ducas, L., & Micciancio, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_24 · Cited by 745
Candidate Multilinear Maps from Ideal Lattices
Garg, S., Gentry, C., & Halevi, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_1 · Cited by 744
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
Strong Authentication for RFID Systems Using the AES Algorithm
Feldhofer, M., Dominikus, S., & Wolkerstorfer, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_26 · Cited by 715
“NTRU [5] has been proposed for RFID system implementations, but it was shown to have some security weaknesses [2,11].”
BackgroundBetter Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
“Clearly, the above key sizes are still too large for many applications, but this is a consequence of the quadratic overhead inherent to the use “standard” LWE . By using the compact “ring-based” variant of LWE and cryptosystem from [22] (which is related to the heuristic NTRU scheme [ 18 ] and the theoretically sound…”
MethodMicciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
“The lattices used by NTRU, named convolutional modular lattices in [29], are lattices in even (2)Some care is required to prevent the matrix entries from becoming too big during intermediate steps of the computation.”
BackgroundMethodInfluentialWorst-case to average-case reductions for module lattices
Langlois, A., & Stehlé, D. (2015) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 643
“To circumvent this inherent inefficiency, Micciancio [21,23] — inspired from the efficient NTRU encryption scheme [15] that can itself be interpreted in terms of lattices — initiated an approach that consists in changing the SIS and LWE problems to variants involving structured matrices.”
MethodFernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
“For example, lattice-based schemes like NTRU [118] or NewHope [119] often require to manage keys in the order of a few thousand bits.”
BackgroundInfluentialBKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
“First, these benchmarks were all computed with only usage 1: NTRU [18] " never observed a noticeable improvement from the pruning procedure, so the pruning procedure was not called " and used β ≤ 25, while [39] [23] use β ≤ 30.”
BackgroundMethodInfluentialHalevi, S., & Shoup, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44371-2_31 · Cited by 559
“The characteristics that define the “hardware platform” for HElib are common to many contemporary HE schemes, including the ring-LWE variants of BGV [6] and Brakerski’s scale-invariant scheme [4], the NTRU-based HE scheme [13, 16], and maybe even some LWE-based schemes [5].”
BackgroundMethodFiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Lattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557
“The most ubiquitous public-key cryptographic primitives, encryption schemes [18,26] and digital signatures [24,15], already have somewhat practical lattice-based instantiations.”
BackgroundRFID Systems and Security and Privacy Implications
Sarma, S. E., Weis, S. A., & Engels, D. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_33 · Cited by 547
“More expensive RFID devices already offer symmetric encryption and public key algorithms such as NTRU [10,13].”
MethodA Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Security and Privacy for 6G: A Survey on Prospective Technologies and Challenges
Nguyen, V.-L., Lin, P.-C., Cheng, B.-C., Hwang, R.-H., & Lin, Y.-D. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3108618 · Cited by 515
“Quantum-safe cryptographic schemes [95] are prospective technologies for secure communications in 6G,”
BackgroundPost-quantum key exchange - a new hope.Preprint
Alkım, E., Ducas, L., Pöppelmann, T., & Schwabe, P. (2015) · IACR Cryptology ePrint Archive · Cited by 586
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
“In particular, this includes the highly efficient constructions developed by the company NTRU [12, 13].”
BackgroundMethodA survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
“Although this study has demonstrated that public key encryption can be achieved with an average power consumption less then 20 W using the NtruEncrypt cryptosystem [111], we note that this algorithm has not yet proved its resistance to cryptanalysis.”
BackgroundA roadmap for security challenges in the Internet of Things
Riahi Sfar, A., Natalizio, E., Challal, Y., & Chtourou, Z. (2018) · Digital Communications and Networks · doi:10.1016/j.dcan.2017.04.003 · Cited by 480
“This high speed algorithm, noted for its simplicity of computation is convenient for energy-constrained devices [73].”
BackgroundMethodPrivacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 459
“Tangle Mixing [181] is one of these proposals, which makes use of a NTRU public key cryptosystem [182] to anonymize the transactions.”
MethodMaking NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
“At the ANTS'98 conference, the NTRU authors gave an improved presentation including a thorough assessment of its practical security against lattice attacks [15].”
BackgroundPrivacy‐preserving federated learning based on multi‐key homomorphic encryption
Ma, J., Naas, S., Sigg, S., & Lyu, X. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22818 · Cited by 421
“[15] proposed the first MK-FHE scheme known as LTV12, which is based on the NTRU encryption system [16].”
MethodImproved Security for a Ring-Based Fully Homomorphic Encryption Scheme
Bos, J. W., Lauter, K., Loftus, J., & Naehrig, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-45239-0_4 · Cited by 421
“Recently, López-Alt et al. [15] proposed an FHE scheme based on the work by Stehlé and Steinfeld [23] in which a provably secure version of NTRUEncrypt [12] is presented with security based on standard problems in ideal lattices.”
MethodSecuring wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
“Gaubatz, Kaps, and Sunar [64] showed the feasibility of implementing the Rabin scheme [65] and the NtruEncrypt scheme [66] on a customized hardware platform.”
MethodGama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
“In fact, if we compute the Hermite factor corresponding to each NTRU instance broken in [15] using BKZ, similarly to Table 3, we obtain a Hermite factor of the”
BackgroundMethodInfluentialStatus report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Zero Trust Architecture (ZTA): A Comprehensive Survey
Syed, N. F., Shah, S. W., Shaghaghi, A., Anwar, A., Baig, Z., & Doss, R. (2022) · IEEE Access · doi:10.1109/access.2022.3174679 · Cited by 406
“Likewise, another approach that is referred to as NTRU is proposed in [115].”
BackgroundAn Efficient and Parallel Gaussian Sampler for Lattices
Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_5 · Cited by 372
“These include NTRU lattices [10], as well as the family of lattices for which Ajtai [3] first demonstrated worst-case hardness.”
BackgroundEfficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
“In parallel to the provably secure schemes, there have also been heuristic proposals [11, 12].”
BackgroundStatus report on the first round of the NIST post-quantum cryptography standardization process
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., et al. (2019) · doi:10.6028/nist.ir.8240 · Cited by 364
Lattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Minimalist Cryptography for Low-Cost RFID Tags
Juels, A. (2003) · Cited by 357
The impact of quantum computing on present cryptography
Mavroeidis, V., Vishi, K., D., M., & Jøsang, A. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090354 · Cited by 361
“NTRU was published in 1996 by Hoffstein et al. [67].”
BackgroundMethodWitness encryption and its applications
Garg, S., Gentry, C., Sahai, A., & Waters, B. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488667 · Cited by 333
“Second, for some suitable integer modulus q, it uses the quotient ring O/(q) = Zq[x]/(Φm(x)), similar to the NTRU encryption scheme [23].”
MethodPost-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem
Bos, J. W., Costello, C., Naehrig, M., & Stebila, D. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.40 · Cited by 329
“3https://github.com/NTRUOpenSourceProject/ntru-crypto Notation.”
BackgroundInfluentialAttribute-Based Encryption for Circuits from Multilinear Maps
Garg, S., Gentry, C., Halevi, S., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_27 · Cited by 328
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
“NTRU [101] is a lattice-based encryption scheme introduced by Hoffstein et al. in 1996, with a provisional patent filed, and granted in 2000 [102].”
MethodFrodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
Fernandez-Carames, T. M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958788 · Cited by 317
“It is currently being tested CECPQ2, which merges X25519 with instantiations of NTRU (HRSS (Hu¨lsing, Rijneveld, Schanck, Schwabe) and SXY (Saito, Xagawa,Yamakawa)) for the post-quantum part.”
BackgroundInfluentialRobotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
“This solution aims to provide additional secret coding, data aggregation, data protection and communications for network addressing and the targeted control of robotic devices.”
NTRUSign: Digital Signatures Using the NTRU Lattice
Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J. H., & Whyte, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_9 · Cited by 302
Self-citationStatus report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
“1 One notable exception is the NTRU public-key encryption scheme [17], which has”
BackgroundMethodInfluentialBonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2012) · Journal of Cryptology · doi:10.1007/s00145-011-9105-2 · Cited by 297
“, [27, 30, 29, 25, 49, 45]), a lattice has a ‘master trapdoor’ in the form of a short basis, i.”
BackgroundNew lattice-based cryptographic constructions
Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 292
Public Key Cryptography in Sensor Networks—Revisited
Gaubatz, G., Kaps, J.-P., & Sunar, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30496-8_2 · Cited by 289
“The second algorithm, NtruEncrypt [12], was introduced in 1996 by Hoffstein, Pipher and Silverman.”
BackgroundMethodSecurity and Privacy in Radio-Frequency Identification Devices
Weis, S. A. (2003) · Cited by 320
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
“This is perhaps due to the inherent hardness of ring-based cryptographic constructions that are used in [10] as well as in our work.”
MethodPost-Quantum Lattice-Based Cryptography Implementations: A Survey
Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R. (2019) · ACM Computing Surveys · doi:10.1145/3292548 · Cited by 277
“Ideal Lattices NTRU [89] NTRU Prime[115] Ring-Lizard (RLizard) [103, 104] trunc8 [116] HILA5 [66, 117] R.”
MethodInfluentialA Survey on Wireless Sensor Network Security
Sen, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.1529 · Cited by 273
“ing the right selection of algorithms and associated parameters, optimization, and low power techniques [23, 24,100]. The investigated public key algorithms include Rabin’s Scheme [101], Ntru-Encrypt [102], RSA [98], and Elliptic Curve Cryptography (ECC) [103,104]. Most studies in the literature focus on RSA and ECC a…”
MethodLi, J., Lu, H., & Guizani, M. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2308215 · Cited by 276
“Many existing PKC schemes are available to be utilized in the PKC-based pseudonym generation, such as RSA [28], HFE [29] and NTRU [30].”
MethodSaber: Module-LWR Based Key Exchange, CPA-Secure Encryption and CCA-Secure KEM
D’Anvers, J.-P., Karmakar, A., Sinha Roy, S., & Vercauteren, F. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-89339-6_16 · Cited by 271
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-48965-0_8 · Cited by 268
“This operation corresponds to the product of the corresponding polynomials modulo X − 1, and for large n, a computation via FFTs as above was suggested to be used in the ring-based encryption scheme NTRUEncrypt in [18].”
MethodSWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
“Special classes of lattices (with closely related, but somewhat different structure than ours) also have been used before in practical constructions (most notably, the NTRU encryption scheme [13] and LASH hash function [3]), but without any security proofs.”
A Systematic Review of Homomorphic Encryption and Its Contributions in Healthcare Industry
Munjal, K., & Bhatia, R. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00756-z · Cited by 269
“NTRU-based FHE scheme NTRU-based encryption is an old encryption technique proposed by [50] in 1998.”
MethodEfficient Identity-Based Encryption over NTRU Lattices
Ducas, L., Lyubashevsky, V., & Prest, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45608-8_2 · Cited by 258
The Learning with Errors Problem (Invited Survey)
Regev, O. (2010) · 2010 IEEE 25th Annual Conference on Computational Complexity · doi:10.1109/ccc.2010.26 · Cited by 255
“One natural way to achieve this goal (which is related to the idea underlying the heuristic design of the NTRU cryptosystem [HPS98]) is to assume that there is some structure in the LWE (or SIS) samples.”
BackgroundA Decade of Lattice Cryptography
Peikert, C. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831139 · Cited by 256
The Two Faces of Lattices in Cryptology
Nguyen, P. Q., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44670-2_12 · Cited by 252
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 251
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
Okamoto, T., & Pointcheval, D. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_13 · Cited by 248
“Furthermore, such a trapdoor problems is not so rare (Diffie-Hellman [12], factorization, RSA [37], elliptic curves [22], McEliece [24], NTRU [19], etc).”
BackgroundGeneralized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Micciancio, D. (2007) · computational complexity · doi:10.1007/s00037-007-0234-9 · Cited by 242
“It should be noted that the class of cyclic lattices used here seems related to (although different from) the class of “convolutional modular lattices” as used by NTRU [16], a commercial cryptosystem that is receiving considerable attention because of its speed and short keys, and represents”
InfluentialEfficient Algorithms for Supersingular Isogeny Diffie-Hellman
Costello, C., Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53018-4_21 · Cited by 230
“1 An exception here is NTRUEncrypt [25], which has comparable public key sizes – see”
BackgroundMethodHomomorphic Encryption Standard
Albrecht, M., Chase, M., Chen, H., Ding, J., Goldwasser, S., Gorbunov, S., Halevi, S., Hoffstein, J., Laine, K., Lauter, K., et al. (2021) · Protecting Privacy through Homomorphic Encryption · doi:10.1007/978-3-030-77287-1_2 · Cited by 213
Self-citationA Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes
Bajard, J.-C., Eynard, J., Hasan, M. A., & Zucca, V. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-69453-5_23 · Cited by 229
“In addition to encryption/signature schemes ([15, 24, 18, 8, 20, 21]), identity-based encryption [9], multilinear maps [11, 16], lattices are also involved in homomorphic encryption (HE).”
BackgroundState of the art in ultra-low power public key cryptography for wireless sensor networks
Gaubatz, G., Kaps, J.-P., Ozturk, E., & Sunar, B. (2005) · Third IEEE International Conference on Pervasive Computing and Communications Workshops · doi:10.1109/percomw.2005.76 · Cited by 233
“Based on [ 4 , 3] we found the number of convolution operations to be 1, 2, 4 and 1 for encryption, decryption, signature generation and verification, respectively.”
BackgroundPost-quantum Key Exchange for the Internet and the Open Quantum Safe Project
Stebila, D., & Mosca, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-69453-5_2 · Cited by 219
“Concurrently, Hoffstein, Pipher, and Silverman [26] created the NTRU public key encryption scheme with can be viewed as involving algebraically structured lattices.”
BackgroundInfluentialHalevi, S., & Shoup, V. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_25 · Cited by 202
Strengthening EPC tags against cloning
Juels, A. (2005) · Proceedings of the 4th ACM workshop on Wireless security · doi:10.1145/1080793.1080805 · Cited by 208
“These algorithms include identification or digital-signature schemes such as the classic Guillou-Quisquater algorithm [10] and also newer algorithms like the NTRU cryptosystem [ 11 ].”
MethodReducing Key Length of the McEliece Cryptosystem
Berger, T. P., Cayrel, P.-L., Gaborit, P., & Otmani, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02384-2_6 · Cited by 205
“high-speed encryption and decryption compared with other public-key cryptosystems which involve for instance modular exponentiations (even faster than the NTRU cryptosystem [15]), 2.”
BackgroundPrivacy–Enhancing Face Biometrics: A Comprehensive Survey
Meden, B., Rot, P., Terhorst, P., Damer, N., Kuijper, A., Scheirer, W. J., Ross, A., Peer, P., & Struc, V. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3096024 · Cited by 205
“In a follow–up to this work, Kolberg et al. [253], also investigated another homomorphic encryption scheme, i.e., N–th degree truncated polynomial ring (NTRU) [264].”
BackgroundExtending the EPC network: the potential of RFID in anti-counterfeiting
Staake, T., Thiesse, F., & Fleisch, E. (2005) · Proceedings of the 2005 ACM symposium on Applied computing · doi:10.1145/1066677.1067041 · Cited by 201
Security Challenges, Issues and Their Solutions For Vanet
Shringar Raw, R., Kumar, M., & Singh, N. (2013) · International Journal of Network Security & Its Applications · doi:10.5121/ijnsa.2013.5508 · Cited by 192
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Howgrave-Graham, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_9 · Cited by 185
“There are many good descriptions of how the NTRU cryptosystem works [9,10,11,14], but in this paper we directly take on the problem of recovering the private key from the public information, so we do not need to delve into details of encryption and decryption.”
BackgroundMethodInfluentialAlbrecht, M., Bai, S., & Ducas, L. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53018-4_6 · Cited by 187
Lightweight Authentication Protocols for Low-Cost RFID Tags
Vajda, I. (2003) · Cited by 190
Quantum technology for military applications
Krelina, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00113-y · Cited by 176
“For example, latticebased cryptography [84], supersingular elliptic curve isogeny cryptography [85], hashbased [86] cryptography, multivariate-based [87] cryptography, code-based cryptography [88] and symmetric key quantum resistance.”
MethodNtru prime: Reducing attack surface at low cost
Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-72565-9_12 · Cited by 177
“Lyubashevsky– Peikert–Regev cryptosystem [87] original NTRU cryptosystem [64] “NTRU LPRime” “Streamlined NTRU Prime””
BackgroundMethodInfluentialImproving Lattice Based Cryptosystems Using the Hermite Normal Form
Micciancio, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44670-2_11 · Cited by 173
“What sets NTRU apart from all other lattice based functions is the use of a class of lattices with special structure: convolutional modular lattices.”
BackgroundMethodInfluentialLightweight Mutual Authentication for IoT and Its Applications
Li, N., Liu, D., & Nepal, S. (2017) · IEEE Transactions on Sustainable Computing · doi:10.1109/tsusc.2017.2716953 · Cited by 166
“NTRU [6] is a lattice based public key cryptosystem proposed in 1996.”
BackgroundInfluentialAn evaluation of a multiple interface design solution for bloated software
McGrenere, J., Baecker, R. M., & Booth, K. S. (2002) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/503376.503406 · Cited by 169
Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware
Pöppelmann, T., & Güneysu, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33481-8_8 · Cited by 167
“A notable exception to this is the ad-hoc designed NTRU encryption system (defined in Zp[x]/〈x− 1〉) [30] for which several implementation results and also two standards have been published over the years (e.”
BackgroundFlush, Gauss, and Reload – A Cache Attack on the BLISS Lattice-Based Signature Scheme
Groot Bruinderink, L., Hülsing, A., Lange, T., & Yarom, Y. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53140-2_16 · Cited by 167
“Lattices using polynomials modulo x n +1 are often called NTRU lattices after the NTRU encryption scheme [14].”
BackgroundMethodTowards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
Pöppelmann, T., & Güneysu, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-43414-7_4 · Cited by 163
“This is a huge advantage to heuristic and patentprotected schemes like NTRU [29], which are just related to lattice problems but might suffer from yet not known weaknesses and had to repeatedly raise their parameters as immediate reaction to attacks [28].”
BackgroundFaster exponential time algorithms for the shortest vector problem
Micciancio, D., & Voulgaris, P. (2010) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973075.119 · Cited by 177
“An interesting feature common to all sieve algorithms is that they can be slightly optimized to take advantage of the structure of certain lattices used in practical cryptographic constructions, like the NTRU lattices [11], or the cyclic lattices of [18].”
BackgroundA Survey on Fully Homomorphic Encryption: An Engineering Perspective
Martins, P., Sousa, L. A., & Mariano, A. (2017) · ACM Computing Surveys · doi:10.1145/3124441 · Cited by 177
“The NTRU cryptosystem (Hoffstein et al. 1998) is an LBC lacking provable security.”
BackgroundEstimate All the {LWE, NTRU} Schemes!
Albrecht, M. R., Curtis, B. R., Deo, A., Davidson, A., Player, R., Postlethwaite, E. W., Virdia, F., & Wunderer, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_19 · Cited by 213
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.