Pages that link to "Item:Q3003372"
From MaRDI portal
The following pages link to Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372):
Displaying 19 items.
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- A thorough treatment of highly-efficient NTRU instantiations (Q6091128) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Shorter hash-and-sign lattice-based signatures (Q6104336) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping (Q6132971) (← links)
- Identity-based interactive aggregate signatures from lattices (Q6134230) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- Efficient lattice-based inner-product functional encryption (Q6169033) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Lattice-based cryptography: a survey (Q6183909) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
- Fast Fourier Orthogonalization over NTRU Lattices (Q6487353) (← links)
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
- NEV: faster and smaller NTRU encryption using vector decoding (Q6595920) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- A generalization of NTRUEncrypt (Q6608565) (← links)
- Zaytun: lattice based PKE and KEM with shorter ciphertext size (Q6618601) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
