Algorithms for the Generalized NTRU Equations and their Storage Analysis
From MaRDI portal
Recommendations
- Computational complexities and storage requirements of some Riccati equation solvers
- scientific article; zbMATH DE number 3868525
- A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Algorithms for solving nonhomogeneous generalized Sylvester matrix equations
- scientific article; zbMATH DE number 3854350
- scientific article; zbMATH DE number 1489889
- scientific article; zbMATH DE number 4030144
- scientific article; zbMATH DE number 3852299
- Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Cites work
- A practical implementation of identity-based encryption over NTRU lattices
- Bonsai trees, or how to delegate a lattice basis
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice (H)IBE in the standard model
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- More efficient algorithms for the NTRU key generation using the field norm
- On Lovász' lattice reduction and the nearest lattice point problem
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Algorithms for the Generalized NTRU Equations and their Storage Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988919)