Enumerating security analysis of NTRU cryptosystem

2025/05/15 by Gireesh Pandey, Indivar Gupta · 1 voice
Computer Science · #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Quantum Computing Algorithms and Architecture

paper · doi:10.1080/01611194.2025.2463932

openalex publication_date 2025/05/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/14

Abstract

NTRU is an important public key cryptosystem based on the quantum resistant hard mathematical problem of lattice theory. We elaborate on the security analysis of this cryptosystem against various attacks available in the literature. We emphasize the computational complexity of the meet-in-the-middle attack and develop an illustration which explicitly explains the step wise computation of the attack. Finally, the security implication of this attack is explained with respect to its use in a practical scenario.

Citations

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Discussions

• “We emphasize the computational complexity of the meet-in-the-middle attack and develop an illustration which explicitly explains the step wise computation of the attack.” doi.org/10.1080/0161... [bsky, 0 points, 0 comments]

Related

• On the Semantic Security of NTRU -- with a gentle introduction to cryptography
• Message recovery attack to NTRU using a lattice independent from the public key
• Cryptanalysis of Xinyu et al.'s NTRU-Lattice Based Key Exchange Protocol
• Cryptanalysis of ITRU
• NNRU, a noncommutative analogue of NTRU