A polynomial time algorithm for breaking NTRU encryption with multiple keys
From MaRDI portal
Publication:6109713
DOI10.1007/s10623-023-01233-5MaRDI QIDQ6109713
Publication date: 28 July 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homomorphic AES evaluation using the modified LTV scheme
- Factoring polynomials with rational coefficients
- NTRU prime: reducing attack surface at low cost
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Multi-key fully-homomorphic encryption in the plain model
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- A Decade of Lattice Cryptography
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Efficient Identity-Based Encryption over NTRU Lattices
- 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
- New Algorithms for Learning in Presence of Errors
- Candidate Multilinear Maps from Ideal Lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Circuit-Private Multi-key FHE
- Provably Secure NTRU Instances over Prime Cyclotomic Rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- NTRU Fatigue: How Stretched is Overstretched?
- On the hardness of the NTRU problem
This page was built for publication: A polynomial time algorithm for breaking NTRU encryption with multiple keys
