Tag Info

New answers tagged

3

No, this result (as it stands) is of no practical use against NTRU as typically used. To quote the paper: Note that there is a large value hidden in the o(1) term, so that our algorithm does not yield practical attacks for recommended NTRU parameters. In addition, while it is subexponential, it's just barely so; they estimate the time as $2^{ (\ln ...


0

There is a very easy way to get Perfect Forward Secrecy with the Post Quantum Security of NTRU (if you believe NTRU is secure). However it requires TWO exchanges of information. During Exchange 1 both parties generate and exchange ephemeral NTRU keys. During Exchange 2 both parties generate random numbers and encrypt their random numbers with the other ...



Top 50 recent answers are included