Pages that link to "Item:Q6157484"
From MaRDI portal
The following pages link to On the hardness of the NTRU problem (Q6157484):
Displaying 12 items.
- Quantum partial search algorithm with smaller oracles for multiple target items (Q2107919) (← links)
- On the (M)iNTRU assumption in the integer case (Q2697921) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- On module unique-SVP and NTRU (Q6135456) (← links)
- Entropic hardness of Module-LWE from module-NTRU (Q6169458) (← links)
- Lattice-based cryptography: a survey (Q6183909) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- Ideal-SVP is hard for small-norm uniform prime ideals (Q6587946) (← links)
- NEV: faster and smaller NTRU encryption using vector decoding (Q6595920) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)