We find Ding's Algorithm can be easily used to give a broadcast attack against NTRU. h(1) ∗ r(1) + m = c(1) mod q h(2) ∗ r(2) + m = c(2) mod q ... where h(i) is the i-th recipient's public key and the attacker knows none of these r(i)'s. Before giving the attack, we need transform NTRU to its linear form.
In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times using different NTRU public keys.
Abstract: Very recently, Ding proposed an ingenious algorithm to solve LWE problem with bounded errors in polynomial time. We find that it can be easily used to ...
Jun 19, 2015 · In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times using ...
Abstract. In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times.
Missing: Algorithm. | Show results with:Algorithm.
Broadcast attacks against lattice-based cryptosystems. (ACNS 2009). [11] Y. Pan, and Y. Deng. A broadcast attack against. NTRU using Ding's Algorithm, available ...
Jan 21, 2015 · In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times using different ...
Dec 30, 2016 · In this paper, a new broadcast attack against NTRU is proposed which is based on the combination of multiple transmission attack and classic ...
Missing: Algorithm. | Show results with:Algorithm.
Yanbin Pan, Yingpu Deng: A Broadcast Attack against NTRU Using Ding's Algorithm.
An efficient broadcast attack against NTRU - Typeset.io
typeset.io › pdf › an-efficient-broadcast-...
Abstract. The NTRU cryptosystem is the most practical scheme known to date. In this paper, we first discuss the ergodic-linearization algorithm against GGH, ...