An algebraic algorithm for breaking NTRU with multiple keys

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A hierarchy of polynomial time lattice basis reduction algorithms
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
NTRU prime: reducing attack surface at low cost
Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
Shorter lattice-based zero-knowledge proofs via one-time commitments
Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
Revisiting the expected cost of solving uSVP and applications to LWE
Revisiting lower dimension lattice attacks on NTRU
A decade of lattice cryptography
A Subfield Lattice Attack on Overstretched NTRU Assumptions
Choosing Parameters for NTRUEncrypt
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
New Algorithms for Learning in Presence of Errors
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Predicting Lattice Reduction
Revisiting Lattice Attacks on Overstretched NTRU Parameters
Lattice-Based Cryptography
On lattices, learning with errors, random linear codes, and cryptography
NTRU Fatigue: How Stretched is Overstretched?
Fiat-Shamir signatures based on module-NTRU
A polynomial time algorithm for breaking NTRU encryption with multiple keys
On the hardness of the NTRU problem

This page was built for publication: An algebraic algorithm for breaking NTRU with multiple keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651896)