Designs, Codes and Cryptography

, Volume 32, Issue 1, pp 369–379

Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction


  • Tanya E. Seidel
    • Department of Mathematical SciencesFlorida Atlantic University
  • Daniel Socek
    • Department of Computer Science and EngineeringFlorida Atlantic University
  • Michal Sramka
    • Department of Mathematical SciencesFlorida Atlantic University

DOI: 10.1023/B:DESI.0000029235.59808.77

Cite this article as:
Seidel, T.E., Socek, D. & Sramka, M. Designs, Codes and Cryptography (2004) 32: 369. doi:10.1023/B:DESI.0000029235.59808.77


Currently, the most efficient passive attack on the NTRU public-key cryptosystem, proposed by Coppersmith and Shamir [1], is based on finding a short enough vector in an integral lattice. An NTRU lattice possesses a cyclic automorphism group whose symmetry may be exploited. We have designed methods for reducing bases of NTRU integral lattices based on this symmetry. In addition to these methods, we use hill-descending techniques to combine new and proposed lattice-reduction algorithms. This approach includes deterministic and non-deterministic components which may be efficiently parallelized.

NTRUlattice reductionhill-descending

Copyright information

© Kluwer Academic Publishers 2004