Symplectic Lattice Reduction and NTRU
From MaRDI portal
Publication:3593099
Recommendations
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction
- scientific article; zbMATH DE number 2156419
- More efficient algorithms for the NTRU key generation using the field norm
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
Cites work
- scientific article; zbMATH DE number 1722680 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 2081055 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A note on optimal unimodular lattices
- Advances in Cryptology - CRYPTO 2003
- Factoring polynomials with rational coefficients
- Floating-Point LLL Revisited
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Modular lattices in Euclidean spaces
- On Lovász' lattice reduction and the nearest lattice point problem
- On the period matrix of a Riemann surface of large genus (with an appendix by J. H. Conway and N. J. A. Sloane)
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Structured Factorizations in Scalar Product Spaces
Cited in
(16)- More efficient algorithms for the NTRU key generation using the field norm
- On module unique-SVP and NTRU
- Improving convergence and practicality of slide-type reductions
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction
- Reductions of integrable lattices
- Predicting Lattice Reduction
- How to pick a random integer matrix? (and other questions)
- Application of automorphic forms to lattice problems
- Cryptographic functions from worst-case complexity assumptions
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Fifty Three Matrix Factorizations: A Systematic Approach
- Post-quantum cryptography: lattice signatures
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On the smallest ratio problem of lattice bases
- Fast reduction of algebraic lattices over cyclotomic fields
This page was built for publication: Symplectic Lattice Reduction and NTRU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593099)
