Provably secure NTRUEncrypt over any cyclotomic field
From MaRDI portal
Publication:1726689
DOI10.1007/978-3-030-10970-7_18zbMath1447.94056OpenAlexW2909867986MaRDI QIDQ1726689
Publication date: 20 February 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-10970-7_18
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ring-LWE and polynomial-LWE problems
- Worst-case to average-case reductions for module lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Ring-LWE in Polynomial Rings
- Efficient Identity-Based Encryption over NTRU Lattices
- On the Efficiency of Provably Secure NTRU
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Candidate Multilinear Maps from Ideal Lattices
- A Toolkit for Ring-LWE Cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Provably Secure NTRU Instances over Prime Cyclotomic Rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- New Chosen-Ciphertext Attacks on NTRU
This page was built for publication: Provably secure NTRUEncrypt over any cyclotomic field
