2000 character limit reached
Well-Rounded Lattices via Polynomials (1904.03510v1)
Published 6 Apr 2019 in cs.IT and math.IT
Abstract: Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In this paper, we investigate when lattices coming from polynomials with integer coefficients are well-rounded.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.