Designs, Codes and Cryptography

, Volume 32, Issue 1, pp 369-379

First online:

Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction

  • Tanya E. SeidelAffiliated withDepartment of Mathematical Sciences, Florida Atlantic University
  • , Daniel SocekAffiliated withDepartment of Computer Science and Engineering, Florida Atlantic University
  • , Michal SramkaAffiliated withDepartment of Mathematical Sciences, Florida Atlantic University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

NTRU lattice reduction hill-descending