Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
type: Item
instance of: scholarly article
title: Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
zbMATH Open document ID: 1504.94174
DOI: 10.1007/978-3-030-56880-1_8
author: Tamalika Mukherjee
author: Noah Stephens-Davidowitz
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11H06
zbMATH DE Number: 7614568
zbMATH Keywords: lattice reduction algorithms
zbMATH Keywords: module lattices
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 8
OpenAlex ID: W2982522610
cites work: Q4228459
cites work: Slide reduction, revisited -- filling the gaps in SVP approximation
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Recovering Short Generators of Principal Ideals in Cyclotomic Rings
cites work: Short Stickelberger Class Relations and Application to Ideal-SVP
cites work: Ring-LWE in Polynomial Rings
cites work: On the shortness of vectors to be found by the ideal-SVP quantum algorithm
cites work: Q4602283
cites work: Short Bases of Lattices over Number Fields
cites work: Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
cites work: Q3549702
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q3840170
cites work: Lattice reductions over Euclidean rings with applications to cryptanalysis
cites work: Factoring polynomials with rational coefficients
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: An LLL algorithm for module lattices
cites work: Worst-case to average-case reductions for module lattices
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Practical, Predictable Lattice Basis Reduction
cites work: A generalization of the LLL-algorithm over Euclidean rings or orders
cites work: The LLL algorithm. Survey and applications
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: A decade of lattice cryptography
cites work: Approx-SVP in ideal lattices with pre-processing
cites work: Theory of Cryptography
cites work: Pseudorandomness of ring-LWE for any ring and modulus
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
cites work: Efficient Public Key Encryption Based on Ideal Lattices
description: scientific article; zbMATH DE number 7614568