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 501–600 of 1,000
Bauspieß, P., Kolberg, J., Drozdowski, P., Rathgeb, C., & Busch, C. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3199944 · Cited by 24
“For the keyword search, the publicly available C++ implementation of the lattice-based PEKS scheme by Behnia et al. [8] based on the NTRU cryptosystem [32] was applied.”
MethodBroadcast Attacks against Lattice-Based Cryptosystems
Plantard, T., & Susilo, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_28 · Cited by 19
“NTRU was originally proposed in 1998 by Hoffstein, Pipher and Silverman [34].”
MethodAccelerating SWHE Based PIRs Using GPUs
Dai, W., Doröz, Y., & Sunar, B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48051-9_12 · Cited by 18
“ATV-SWHE Scheme: The NTRU scheme [19] was originally proposed as a public key encryption scheme.”
A Lightweight Implementation of NTRU Prime for the Post-quantum Internet of Things
Cheng, H., Dinu, D., Großschädl, J., Rønne, P. B., & Ryan, P. Y. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-41702-4_7 · Cited by 20
Exploring Lattice-based Post-Quantum Signature for JWT Authentication: Review and Case Study
Alkhulaifi, A., & El-Alfy, E.-S. M. (2020) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2020-spring48590.2020.9129505 · Cited by 25
“In 1998, a new public-key encryption scheme is proposed based on the hardness of the shortest vector problem [17].”
BackgroundLossiness and Entropic Hardness for Ring-LWE
Brakerski, Z., & Döttling, N. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64375-1_1 · Cited by 19
Accelerating Lattice Reduction with FPGAs
Detrey, J., Hanrot, G., Pujol, X., & Stehlé, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14712-8_8 · Cited by 19
“These include the lattice attacks against knapsack-based cryptosystems [38,33], NTRU [21,22], and lattice-based cryptosystems [16,3,35,43,5,15,28,39,49].”
BackgroundA lattice-based threshold secret sharing scheme
Khorasgani, H. A., Asaad, S., Eghlidos, T., & Aref, M. (2014) · International ISC Conference on Information Security and Cryptology (ISCISC) · doi:10.1109/iscisc.2014.6994043 · Cited by 21
“The potential resistance of lattice based cryptography against quantum computers provides an appropriate platform for designing new public key cryptosystems for secure transmission of data [1], [2] and [3].”
BackgroundA Lattice Based Public Key Cryptosystem Using Polynomial Representations
Paeng, S.-H., Jung, B. E., & Ha, K.-C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_22 · Cited by 19
“The authors of NTRU guessed the following conjecture based on experiments [5]: Conjecture 1.”
BackgroundLattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP
Mukherjee, T., & Stephens-Davidowitz, N. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_8 · Cited by 20
Quantum Attacks and Defenses for Proof-of-Stake
Khalifa, A. M., Bahaa-Eldin, A. M., & Sobh, M. (2019) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces48960.2019.9068181 · Cited by 24
“The first NTRU cryptosystem was described in [31].”
MethodOn the Ideal Shortest Vector Problem over Random Rational Primes
Pan, Y., Xu, J., Wadleigh, N., & Cheng, Q. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_20 · Cited by 23
Post-quantum Cryptography in 6G
Partala, J. (2021) · Computer communications and networks · doi:10.1007/978-3-030-72777-2_20 · Cited by 22
Dhanush, C. S., & Jain, K. (2023) · International Conference on Augmented Intelligence and Sustainable Systems (ICAISS) · doi:10.1109/icaiss58487.2023.10250627 · Cited by 18
Niță, Ș. L., & Mihăilescu, M. I. (2023) · Springer eBooks · doi:10.1007/978-3-031-43214-9_3 · Cited by 18
Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes
Dahab, R., Galbraith⋆, S. D., & Morais, E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17470-9_17 · Cited by 18
Attacks on the AJPS Mersenne-Based Cryptosystem
de Boer, K., Ducas, L., Jeffery, S., & de Wolf, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_5 · Cited by 28
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Wunderer, T. (2018) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2016-0044 · Cited by 23
Agarkar, A. A., & Agrawal, H. (2019) · Heliyon · doi:10.1016/j.heliyon.2019.e01321 · Cited by 20
Lightweight Cryptography and RFID: Tackling the Hidden Overheads
Poschmann, A. Y., Robshaw, M. J. B., Vater, F., & Paar, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_10 · Cited by 18
Realizing Stateful Public Key Encryption in Wireless Sensor Network
Baek, J., Tan, H. C., Zhou, J., & Wong, J. W. (2008) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-0-387-09699-5_7 · Cited by 18
Key exchange protocols over noncommutative rings. The case of
Climent, J., Navarro, P. R., & Tortosa, L. (2012) · International Journal of Computer Mathematics · doi:10.1080/00207160.2012.696105 · Cited by 21
“In [17], the authors present a PKC based on rings (the NTRU cryptosystem).”
BackgroundPerformance Analysis of Public key Cryptographic Systems RSA and NTRU
Challa, N., & Pradhan, J. (2007) · Cited by 18
A Novel NTRU-Based Handover Authentication Scheme for Wireless Networks
Chen, R., & Peng, D. (2017) · IEEE Communications Letters · doi:10.1109/lcomm.2017.2786228 · Cited by 18
“More details can be found in previous studies [10].”
ResultLBRAKA: Lattice-Based Robust Authenticated Key Agreement for VANETs
Liu, G., Li, W., Yuan, C., Wang, N., Ma, C., Mu, N., Liu, Z., Liu, Y., & Xiang, T. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3515072 · Cited by 17
“Consequently, it may not be suitable for [13], which adopts the number theory research unit (NTRU) encryption algorithm [29] and can guarantee the anonymity of mobile devices.”
A lattice based authentication for low-cost RFID
Moustaine, E. E., & Laurent, M. (2012) · IEEE International Conference on RFID Technology and Applications (RFID-TA) · doi:10.1109/rfid-ta.2012.6404569 · Cited by 17
“If 𝑣1, 𝑣2,..., 𝑣𝑘 are linearly independent vectors of R𝑛, then a lattice 𝐿 generated by 𝑣1, 𝑣2,..., 𝑣𝑘 is the set: 𝐿 = { ∑︀𝑘 𝑖=1𝑎𝑖𝑣𝑖 | ∀𝑖 ∈ {1, ..., 𝑘}, 𝑎𝑖 ∈ Z} The Shortest Vector Problem (SVP): Given a base B (set of vectors linearly independent) of a lattice 𝐿, find the…”
NTRU Algorithm: Nth Degree Truncated Polynomial Ring Units
Kamal, A., Ahmad, K., Hassan, R. B., & Khujamatov, H. (2021) · EAI/Springer Innovations in Communication and Computing · doi:10.1007/978-3-030-60890-3_6 · Cited by 17
Lattice‐based cryptosystems in standardisation processes: A survey
Wang, A., Xiao, D., & Yu, Y. (2022) · IET Information Security · doi:10.1049/ise2.12101 · Cited by 26
Performance Impact of PQC KEMs on TLS 1.3 Under Varying Network Characteristics
Henrich, J., Heinemann, A., Wiesmaier, A., & Schmitt, N. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49187-0_14 · Cited by 24
Multi-Phase Quantum Resistant Framework for Secure Communication in SCADA Systems
Ghosh, S., Zaman, M., Joshi, R., & Sampalli, S. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3378474 · Cited by 26
On error distributions in ring-based LWE
Castryck, W., Iliashenko, I., & Vercauteren, F. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000280 · Cited by 18
“One idea to address this [14, 16] is to use a ring structure Rq = Z[x]/(q, f(x)) for some monic degree n polynomial f(x) ∈ Z[x] through the isomorphism (a priori of modules)”
MethodARMv8 SIKE: Optimized Supersingular Isogeny Key Encapsulation on ARMv8 Processors
Jalali, A., Azarderakhsh, R., Kermani, M. M., Campagna, M., & Jao, D. (2019) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2019.2920869 · Cited by 17
“The submitted public-key post-quantum cryptography (PQC) proposals are based on five different hard problems and they are categorized as code-based cryptography [2], (ring) lattice-based cryptography [3], [4], hash-based cryptography [5], multivariate cryptography [6], and isogeny-based cryptography [7].”
BackgroundHu, F., Hao, Q., Łukowiak, M., Sun, Q., Wilhelm, K., Radziszowski, S., & Wu, Y. (2010) · IEEE Transactions on Information Technology in Biomedicine · doi:10.1109/titb.2010.2049204 · Cited by 17
“We propose to use a very efficient, low overhead, public key encryption algorithm to support a high level of security. Such an algorithm is NTRU [5], [ 6 ].”
MethodTessaro, S., & Wilson, D. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54631-0_15 · Cited by 17
“For LWE and NTRU, the best previously known construction was obtained by using the construction of [DKXY02].”
BackgroundMethodInfluentialGaithuru, J. N., Bakhtiari, M., Salleh, M., & Muteb, A. M. (2015) · Malaysian Software Engineering Conference (MySEC) · doi:10.1109/mysec.2015.7475227 · Cited by 25
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis
Mariano, A., Laarhoven, T., Correia, F. J. G., Rodrigues, M., & Falcão, G. (2017) · IEEE Access · doi:10.1109/access.2017.2748179 · Cited by 19
“The NTRU cryptosystem [49], closely related to cryptography based on the ring-LWE problem, is the first and to date perhaps the only lattice-based cryptosystem which was commercialized into a product.”
BackgroundA High-Speed Constant-Time Hardware Implementation of NTRUEncrypt SVES
Farahmand, F., Sharif, M. U., Briggs, K., & Gaj, K. (2018) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2018.00036 · Cited by 17
“In Table VIII, we compare the results of our hardware implementation of NTRUEncrypt SVES with the results of the high-speed implementation of a leading PQC candidate, Classic McEliece [17], at the same claimed security level, generated using open-source code available at [18].”
BackgroundInfluentialPrivate AI: Machine Learning on Encrypted Data
Lauter, K. (2022) · SEMA SIMAI Springer series · doi:10.1007/978-3-030-86236-7_6 · Cited by 16
Comparison between Subfield and Straightforward Attacks on NTRU.Preprint
Kirchner, P., & Fouque, P.-A. (2016) · IACR Cryptology ePrint Archive · Cited by 17
Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers
Lueks, W., Alpár, G., Hoepman, J.-H., & Vullers, P. (2015) · IFIP advances in information and communication technology · doi:10.1007/978-3-319-18467-8_31 · Cited by 16
Verified NTT Multiplications for NISTPQC KEM Lattice Finalists: Kyber, SABER, and NTRU
Hwang, V., Liu, J., Seiler, G., Shi, X., Tsai, M.-H., Wang, B.-Y., & Yang, B. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i4.718-750 · Cited by 16
Randomized Half-Ideal Cipher on Groups with Applications to UC (a)PAKE
Santos, B. F. D., Gu, Y., & Jarecki, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_5 · Cited by 17
“This includes several post-quantum LWE-based KEM proposals in the NIST competition, including Saber [23], Kyber [14], McEliece [2], NTRU [35], Frodo [3], and possibly others.”
Algorithm-Hardware Co-Design of Split-Radix Discrete Galois Transformation for KyberKEM
Li, G., Chen, D., Mao, G., Dai, W., Sanka, A. I., & Cheung, R. C. C. (2023) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2023.3270971 · Cited by 18
“The finalists include three lattice-based cryptography (i.e. CRYSTALS-KyberKEM [2], NTRU [3], SABER [4]), and one code-based cryptography (i.e. Classic McEliece [5]).”
Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
Xu, K., Tan, B. H. M., Wang, L., Aung, K. M. M., & Wang, H. (2023) · Theoretical Computer Science · doi:10.1016/j.tcs.2023.114026 · Cited by 17
Reddy, N. M., Budati, A. K., Islam, S., & Ramesh, G. (2023) · Earth Science Informatics · doi:10.1007/s12145-023-01194-2 · Cited by 16
“The key sizes of SIDH are smaller than its PQC (Post Quantum Cryptography) counterparts such as the ones explored in (Jeffrey et al., 1998; Bernstein, 2006; Mike, 2015).”
Towards Building Quantum Resistant Blockchain
Chauhan, S., Ojha, V. P., Yarahmadian, S., & Carvalho, D. B. (2023) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet58911.2023.10389558 · Cited by 20
“The KEM category encompasses schemes like Classic McEliece [22], which is code-based; Crystals-Kyber [36], a suite of algebraic lattices utilizing Kyber primitives for KEM; NTRU [37], a lattice-based scheme; and Saber [38], a lattice-based scheme utilizing learning with rounding.”
BackgroundMethodImproved Alternating-Moduli PRFs and Post-quantum Signatures
Alamati, N., Policharla, G.-V., Raghuraman, S., & Rindal, P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68397-8_9 · Cited by 18
“Other examples include early lattice-based construction such as NTRU [41].”
BackgroundEfficient multiplication architecture over truncated polynomial ring for NTRUEncrypt system
Liu, B., & Wu, H. (2016) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2016.7527455 · Cited by 16
“As one of the most well-known post-quantum public key cryptographic systems, NTRU (Nth Degree Truncated Polynomial Ring Unit) system, proposed by Hoffstein, Pipher and Silverman in 1996 [1], is defined over a truncated polynomial ring with divisor polynomial f(x) = x − 1.”
BackgroundEvolution of the McEliece Public Key Encryption Scheme
Bucerzan, D., Drăgoi, V., & Kalachi, H. T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69284-5_10 · Cited by 16
Identity‐based proxy signature over NTRU lattice
Wu, F., Yao, W., Zhang, X., Wang, W., & Zheng, Z. (2018) · International Journal of Communication Systems · doi:10.1002/dac.3867 · Cited by 17
Blockchain Framework for Peer-to-Peer Energy Trading with Credit Rating
Yang, J., Paudel, A., & Gooi, H. B. (2019) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesgm40551.2019.8973709 · Cited by 16
“Figure 2 shows a process of the two-direction ring-based algorithm [10] to express the way prosumers passing the tokens around.”
BackgroundA Compact Full Hardware Implementation of PQC Algorithm NTRU
Qin, Z., Tong, R., Wu, X., Bai, G., Wu, L., & Su, L. (2021) · International Conference on Communications, Information System and Computer Engineering (CISCE) · doi:10.1109/cisce52179.2021.9446042 · Cited by 16
Portable Implementation of Lattice-based Cryptography using JavaScript
Yuan, Y., Cheng, C.-M., Kiyomoto, S., Miyake, Y., & Takagi, T. (2016) · International Journal of Networking and Computing · doi:10.15803/ijnc.6.2_309 · Cited by 16
New lattice based cryptographic constructions
Regev, O. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780601.780603 · Cited by 16
Zhang, X., Chi, C., & Ding, R. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88052-1_17 · Cited by 18
NTRU‐based sensor network security: a low‐power hardware implementation perspective
Hu, F., Wilhelm, K., Schab, M. W., Łukowiak, M., Radziszowski, S., & Xiao, Y. (2008) · Security and Communication Networks · doi:10.1002/sec.39 · Cited by 16
“NTRU Cryptosystems Inc. has made public some of their own hardware design works [9,10], while other significant works include References [4,6] from the Worcester Polytechnic Institute.”
BackgroundInfluentialAlgorithmic Self-Assembly of DNA Tiles and its Application to CryptanalysisPreprint
Pelletier, O., & Weimerskirch, A. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0110009 · Cited by 16
“A typical value for q is 64 or 128 [5] which means that more than 4,000 di erent tile classes are needed.”
BackgroundInfluentialA new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2qPreprint
Ariffin, M. R. K., Asbullah, M. A., Abu, N. A., & Mahad, Z. (2013) · arXiv (Cornell University) · Cited by 16
Liu, D., Li, N., Kim, J., & Nepal, . (2017) · IACR Cryptology ePrint Archive · Cited by 19
LRCPA: Lattice-Based Robust and Conditional Privacy-Preserving Authentication for VANETs
Liu, G., Li, H., Le, J., Wang, N., Liu, Y., & Xiang, T. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3485671 · Cited by 17
“Zhang et al. presented a quantum-resistant handover authentication scheme [13] based on the number theory research unit (NTRU) encryption algorithm [23], which can ensure the anonymity of mobile devices.”
Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board
Li, X., Wang, H., Li, Z., Wu, L., Wei, X., Su, Y., & Lu, R. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3380258 · Cited by 16
“Intheliterature Intheliterature[21], López-Altetal.proposedaMulti-keyFullyHomomorphic EncryptionScheme(MFHE)basedon[22],[23]andconstructed On-the-FlyMulti-partyComputation.”
Faster NTRU-based Bootstrapping in less than 4 ms
Li, Z., Lu, X., Wang, Z., Wang, R., Liu, Y., Zheng, Y., Zhao, L., Wang, K., & Hou, R. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i3.418-451 · Cited by 18
“We recall the learning with errors (LWE) [Reg09], Ring learning with errors (RLWE) [LPR13], and NTRU [HPS98] problems, which are instantiated in FHE schemes.”
MethodJoshi, A., Bhalgat, P., Chavan, P. P., Chaudhari, T., & Patil, S. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-9743-1_3 · Cited by 20
A Secure Platform of Wireless Sensor Networks
Moh’d, A., Marzi, H., Aslam, N., Phillips, W., & Robertsona, W. (2011) · Procedia Computer Science · doi:10.1016/j.procs.2011.07.017 · Cited by 15
“NTRU [19] is much faster, for both encrypting and for verification operations than RSA.”
BackgroundAn Efficient Quasigroup Block Cipher
Battey, M., & Parakh, A. (2012) · Wireless Personal Communications · doi:10.1007/s11277-012-0959-x · Cited by 16
“Further, public key systems such as NTRU [11] and elliptic curve cryptosystems [12] have lower power consumptions compared to RSA however compared to secret key systems they are much more computationally expensive.”
BackgroundScalable, Practical VoIP Teleconferencing With End-to-End Homomorphic Encryption
Rohloff, K. R., Cousins, D. B., & Sumorok, D. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2639340 · Cited by 16
“In particular, our approach is based on recent advances in latticebased homomorphic encryption and is a simplification of the LTV scheme [5] which is itself an NTRU-like cryptosystem [6].”
MethodA Constant Time Full Hardware Implementation of Streamlined NTRU Prime
Marotzke, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-68487-7_1 · Cited by 19
An Algebraic Approach to the Rank Support Learning Problem
Bardet, M., & Briaud, P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_23 · Cited by 19
Sliding Window Method for NTRU
Lee, M., Kim, J. W., Song, J. E., & Park, K. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72738-5_28 · Cited by 15
A Complete Public-Key Cryptosystem
Grigoriev, D. Y., Hirsch, E. A., & Pervyshev, K. (2009) · journal of Groups complexity cryptology · doi:10.1515/gcc.2009.1 · Cited by 15
“We present a public-key cryptosystem which is complete for the class that contains all “traditional” public-key encryption schemes as well as probabilistic encryption of Goldwasser and Micali [2], one of the first encryptions schemes, Ajtai-Dwork cryptosystem [3], which is based on lattice problems, and NTRU [4].”
MethodFinding Shortest Lattice Vectors in the Presence of Gaps
Wei, W., Liu, M., & Wang, X. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16715-2_13 · Cited by 14
NTRU modular lattice signature scheme on CUDA GPUs
Dai, W., Sunar, B., Schanck, J. M., Whyte, W. F., & Zhang, Z. (2016) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcsim.2016.7568376 · Cited by 15
“However, lattice based signature schemes naturally have large signature sizes compared to RSA and ECC based solutions.”
BackgroundThe computer for the 21st century: present security & privacy challenges
Oliveira, L. B., Pereira, F. M. Q., Misoczki, R., Aranha, D. F., Borges, F., Nogueira, M., Wangham, M. S., Wu, M. H., & Liu, J. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0095-2 · Cited by 22
A Group-Based NTRU-Like Public-Key Cryptosystem for IoT
Li, S., Xu, H., Li, M., & Zhou, X. (2019) · IEEE Access · doi:10.1109/access.2019.2920860 · Cited by 17
“Hoffstein, Pipher and Silverman [11] proposed the NTRU (Number Theory Research Unit) public-key cryptosystem.”
BackgroundCryptographic Functions from Worst-Case Complexity Assumptions
Micciancio, D. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_13 · Cited by 15
“The novelty in Micciancio’s work [27] (which sets it apart from [17]), is that lattices with special structure are used to build very efficient cryptographic functions that also have strong provable security guarantees, similar to those of Ajtai’s original proposal [3] and subsequent work [10, 26, 29].”
BackgroundMethodResultInfluentialLattice-based cryptography: a practical implementation
Rose, M. (2011) · Research Online (University of Wollongong) · Cited by 15
Code-based Post-Quantum CryptographyPreprint
Balamurugan, C., Singh, K., Ganesan, G., & Rajarajan, M. (2021) · Preprints.org · doi:10.20944/preprints202104.0734.v1 · Cited by 15
“Certain candidate families of post-quantum schemes have been realized including 37 code-based [4], hash-based [5], multivariate [6], lattice-based [7,8] and isogeny-based [9] 38 solutions.”
BackgroundIshaq, M. H., & Al-Anesi, B. (2025) · International Conference on Advanced Innovations in Smart Cities (ICAISC) · doi:10.1109/icaisc64594.2025.10959635 · Cited by 16
“Lattice-based cryptography, particularly NTRUEncrypt and Kyber, offers strong security guarantees against quantum attacks due to the hardness of lattice problems such as the Learning with Errors (LWE) problem [12].”
Module-Lattice-Based Key-Encapsulation Mechanism Performance Measurements
Nagy, N., Alnemer, S., Alshuhail, L. M., Alobiad, H., Almulla, T., Alrumaihi, F. A., Ghadra, N., & Nagy, M. (2025) · Sci · doi:10.3390/sci7030091 · Cited by 19
Pablos, J. I. E., Marriaga, M. E., & del Pozo, Á. L. P. (2022) · IEEE Access · doi:10.1109/access.2022.3222389 · Cited by 16
“The NTRU submission for Round 3 is a merger of two different previous submissions, namely NTRUEncrypt and NTRU-HRSS-KEM ([26]), both based in the NTRU cryptosystem ([27]).”
MethodA polynomial time algorithm for breaking NTRU encryption with multiple keys
Kim, J., & Lee, C. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01233-5 · Cited by 15
“NTRU encryption is a widely recognized core cryptosystem in lattice-based cryptography due to its simplicity, efficiency, and various cryptosystems [3, 5, 9, 10, 13, 16–18, 20, 22, 23, 25, 27, 32, 33].”
BackgroundRen, X., Xu, M., Niyato, D. T., Kang, J., Xiong, Z., Qiu, C., Yao, H., & Wang, X. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3520803 · Cited by 44
“The implementations of these postquantum lattice-based schemes require the storage and utilization of large keys [98].”
On the Efficiency of Provably Secure NTRU
Cabarcas, D., Weiden, P., & Buchmann, J. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_2 · Cited by 14
Lightweight Cryptography and RFID: Tackling the Hidden Overhead
Poschmann, A. Y., Robshaw, M. J. B., Vater, F., & Paar, C. (2010) · KSII Transactions on Internet and Information Systems · doi:10.3837/tiis.2010.04.002 · Cited by 14
“Gaubatz et al. [9] have investigated the hardware efficiency of the NTRUen-crypt algorithm [18, 26] with the following parameter set ( N, p, q ) = (167 , 3 , 128) that offers a security level of around 57 bits.”
MethodQuantum Cryptanalysis of NTRU.
Fluhrer, S. R. (2015) · Cited by 14
Parallel Implementation of BDD Enumeration for LWE
Kirshanova, E., May, A., & Wiemer, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_31 · Cited by 14
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices
Bagheri, K., Sadeghi, M., & Eghlidos, T. (2017) · IEEE Access · doi:10.1109/access.2017.2765538 · Cited by 13
“on arithmetics in polynomial rings [6].”
Hybrid dual attack on LWE with arbitrary secrets
Bi, L., Lu, X., Luo, J., Wang, K., & Zhang, Z. (2022) · Cybersecurity · doi:10.1186/s42400-022-00115-y · Cited by 18
“The very first hybrid attack was proposed by Howgrave-Graham (2007) to analyze NTRU (Hoffstein et al. 1998).”
BackgroundInfluentialFaster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication
Paksoy, İ. K., & Cenk, M. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3191111 · Cited by 15
“NTRU key encapsulation mechanism (KEM) is a merger of NTRUEncrypt and NTRUHRSS-KEM submissions of the rst round, and it is based on the classical NTRU system proposed by Ho stein, Pipher, and Silverman [16, 17].”
MethodCoron, J.-S., Gérard, F., Trannoy, M., & Zeitoun, R. (2023) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i2.180-211 · Cited by 14
Ring-LWE Cryptography for the Number Theorist
Elias, Y., Lauter, K., Özman, E., & Stange, K. E. (2016) · Association for Women in Mathematics series · doi:10.1007/978-3-319-30976-7_9 · Cited by 15
Gaithuru, J. N., & Bakhtiari, M. (2014) · Malaysian Software Engineering Conference (MySEC) · doi:10.1109/mysec.2014.6986028 · Cited by 14
“Security is also assured by the fact that it is difficult to find very short vectors in most of the lattices [14].”
BackgroundMethodMPSign: A Signature from Small-Secret Middle-Product Learning with Errors
Bai, S., Das, D., Hiromasa, R., Roşca, M., Sakzad, A., Stehlé, D., Steinfeld, R., & Zhang, Z. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45388-6_3 · Cited by 16
A new design of NTRU encryption with high security and performance level
Yassein, H. R., Abidalzahra, A. A., & Al-Saidi, N. M. G. (2021) · AIP conference proceedings · doi:10.1063/5.0042312 · Cited by 14
Recovering NTRU Secret Key from Inversion Oracles
Mol, P., & Yung, M. M. (2008) · Springer eBooks · doi:10.1007/978-3-540-78440-1_2 · Cited by 14
“However, they require the full output of the oracle (and not just a YES/NO answer) and work only in the presence of decryption failures.”
MethodInfluentialImproved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract)
Hanrot, G., & Stehlé, D. (2007) · Cited by 14
Lee, M. S. (2011) · IACR Cryptology ePrint Archive · Cited by 14
Provably weak instances of Ring-LWEPreprint
Elias, Y., Lauter, K., Özman, E., & Stange, K. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.03708 · Cited by 19
A Performance Evaluation of IPsec with Post-Quantum Cryptography
Bae, S., Chang, Y., Park, H., Kim, M., & Shin, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-29371-9_13 · Cited by 26
Privacy Preserving for Electronic Medical Record Sharing in Healthchain With Group Signature
Li, C., Jiang, B., Dong, M., Xin, X., & Ota, K. (2023) · IEEE Systems Journal · doi:10.1109/jsyst.2023.3302268 · Cited by 24
“Definition 2: ( NTRU Lattice ) [46]: For a message μ , the NTRU cryptosystem outputs a polynomial z = 2( ar + e ) + μ in R q with { 0 , 1 } coefficients, by random selecting two short vectors r, e ∈ R q ( R q = Z q [ x ] / ( x n + 1)) .”
Background
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.