Pages that link to "Item:Q5738868"
From MaRDI portal
The following pages link to Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868):
Displaying 31 items.
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- Estimate all the {LWE, NTRU} schemes! (Q1796806) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- Choosing parameters for the subfield lattice attack against overstretched NTRU (Q2092481) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- Characterizing overstretched NTRU attacks (Q2191207) (← links)
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant (Q2195452) (← links)
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (Q2415416) (← links)
- On the (M)iNTRU assumption in the integer case (Q2697921) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU (Q3612548) (← links)
- Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm (Q5001674) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS (Q6045071) (← links)
- A thorough treatment of highly-efficient NTRU instantiations (Q6091128) (← links)
- Shorter hash-and-sign lattice-based signatures (Q6104336) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- FINAL: faster FHE instantiated with NTRU and LWE (Q6132410) (← links)
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping (Q6132971) (← links)
- On module unique-SVP and NTRU (Q6135456) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- Identity-based encryption from lattices using approximate trapdoors (Q6535489) (← links)
- Ideal-SVP is hard for small-norm uniform prime ideals (Q6587946) (← links)
- NEV: faster and smaller NTRU encryption using vector decoding (Q6595920) (← links)
- Message recovery attack on NTRU using a lattice independent from the public key (Q6646790) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- On the quantum security of high-dimensional RSA protocol (Q6657369) (← links)
