pith. machine review for the scientific record. sign in

arxiv: 1103.4086 · v3 · pith:QFDTQSVHnew · submitted 2011-03-21 · 💻 cs.IT · math.IT

Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis

classification 💻 cs.IT math.IT
keywords latticechannelcodeswiretapgaussiansecrecyanalysisawgn
0
0 comments X
read the original abstract

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy based on lattice coset encoding. We analyze Eve's probability of decoding, from which we define the secrecy gain as a design criterion for wiretap lattice codes, expressed in terms of the lattice theta series, which characterizes Eve's confusion as a function of the channel parameters. The secrecy gain is studied for even unimodular lattices, and an asymptotic analysis shows that it grows exponentially in the dimension of the lattice. Examples of wiretap lattice codes are given. Interestingly, minimizing Eve's probability of error involves the same optimization of the theta series as does the flatness factor, another newly defined code design that characterizes lattice codes that achieve strong secrecy.

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.