C.-P. Schnorr, “A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms,” Theoretical Computer Science Journal, Vol. 53, 1987, pp. 201-224. doi:10.1016/0304-3975(87)90064-8

has been cited by the following article:

• TITLE: Cryptanalysis of the Double-Moduli Cryptosystem

  AUTHORS: Sonia Mihaela Bogos, Serge Vaudenay

  KEYWORDS: Complex Modulus; Primary Residue; Plaintext Pre-Conditioning; Plaintext Attack; Public-Key Scheme; Lattices; LLL Algorithm; Orthogonal Lattices

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.12, December 20, 2012

  ABSTRACT: In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]. We show how, based on the relation between the public and private key, we can construct an attack which allows any passive adversary to decrypt the encrypted messages. We explain, step by step, how an attacker can construct an equivalent private key and guess what the original plaintext was. Our attack is efficient and provides good experimental results.