Enhancing an Attack to DSA Schemes

Message recovery attack to NTRU using a lattice independent from the public key

“…In this section we show how we can find the plaintext m(x) using the previous Proposition 2. 1. In this Proposition we provide only a sufficient condition.…”

“…The answer to this question could be a part for a future work. What is more, the idea of bounding from below the length of every vector in a lattice, first applied in [1,2,27], where (EC)DSA was attacked using Babai's algorithm. The study of our attack to NTRU-prime lattices could also be a part of a future work.…”

“…NTRU 1 cryptosystem was proposed in 1996 by three mathematicians [18]. It is based on certain hard problems involving lattices and can be used as an encryption system, NTRUencrypt, as well as a digital signature, like the RSA system.…”

Message recovery attack on NTRU using a lattice independent from the public key

“…The advantage here is that we do not need the inequality ( 5), which we have assumed to be true. Inequality ( 9) can be checked easily for every N, q, and y, whereas our assumption ( 5) is hard to be checked for large values of N. The concept of using lower bounds for a shortest vector within a lattice and subsequently executing an attack on a system has previously found application in (EC)DSA, as demonstrated in [1,2].…”