pith. sign in

arxiv: 1708.09239 · v3 · pith:RBKPDAW4new · submitted 2017-08-30 · 💻 cs.IT · math.IT· math.NT

On the secrecy gain of ell-modular lattices

classification 💻 cs.IT math.ITmath.NT
keywords modularconjecturelatticesmathbbmethodmodifiedsecrecyamount
0
0 comments X
read the original 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\}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.