Giant does not mean strong: cryptanalysis of BQTRU
From MaRDI portal
Cites work
- A decade of lattice cryptography
- A hierarchy of polynomial time lattice basis reduction algorithms
- A non-commutative cryptosystem based on quaternion algebras
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- Advances in Cryptology - CRYPTO 2003
- An algebraic algorithm for breaking NTRU with multiple keys
- BKZ 2.0: Better lattice security estimates
- DiTRU: a resurrection of NTRU over dihedral group
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Factoring polynomials with rational coefficients
- Fast lattice point enumeration with minimal overhead
- Gaussian elimination is not optimal
- Group rings and rings of matrices.
- Gröbner bases for public key cryptography
- High-speed key encapsulation from NTRU
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1859039 (Why is no real title available?)
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- LWE with side information: attacks and concrete security estimation
- New directions in nearest neighbor searching with applications to lattice sieving
- New NTRU Records with Improved Lattice Bases
- NTRU in Quaternion Algebras of Bounded Discriminant
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- The general sieve kernel and new records in lattice reduction
This page was built for publication: Giant does not mean strong: cryptanalysis of BQTRU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969306)
