2000 character limit reached
On the secrecy gain of $\ell$-modular lattices
Published 30 Aug 2017 in cs.IT, math.IT, and math.NT | (1708.09239v3)
Abstract: We show that for every $\ell>1$, there is a counterexample to the $\ell$-modular secrecy function conjecture by Oggier, Sol\'e and Belfiore. These counterexamples all satisfy the modified conjecture by Ernvall-Hyt\"onen and Sethuraman. Furthermore, we provide a method to prove or disprove the modified conjecture for any given $\ell$-modular lattice rationally equivalent to a suitable amount of copies of $\mathbb{Z}\oplus \sqrt{\ell}\,\mathbb{Z}$ with $\ell \in {3,5,7,11,23}$. We also provide a variant of the method for strongly $\ell$-modular lattices when $\ell\in {6,14,15}$.
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.