Skip to content
Research Article Open access CC BY 4.0

A New Secrecy Function for Modular Lattices

Y. Diop, Cheikh Thiecoumba Gueye, Patrick Sole

Journal of Advances in Mathematics and Computer Science · pp. 1–10 · Published 30 Aug 2016

10.9734/BJMCS/2016/28543

Abstract

A recent line of work to improve the secrecy capacity within wiretap gaussian channel has introduced a new lattice invariant called secrecy gain. Belfiore and Sol´e made a conjecture about the point at which the the secrecy gain is maximum. Verified by most unimodular lattices, this conjecture does not hold in general for l-modular lattices (l ≥ 2). Ernvall-Hytönen modified the secrecy function and proved that it satisfies the conjecture for 2-odd modular lattices. In this paper, the authors introduce a new secrecy function for 2-modular lattices. They show that, by using the lattice D4 instead of Dl = Z⊕√lZ , the conjecture holds for both 2-even and odd modular lattices in dimension n ≥ 4. Using that result, they further prove that the modified secrecy function of A.-M. Ernvall-Hytönen holds for both 2-even and odd modular lattices.

Gaussian wiretap channel lattice codes secrecy gain modular lattices theta series

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.