Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices
Lattice coding over a Gaussian wiretap channel is considered with respect to a lattice invariant called the secrecy gain, which was introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/94795 http://hdl.handle.net/10220/8571 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-94795 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-947952023-02-28T19:18:06Z Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices Lin, Fuchun Oggier, Frederique School of Physical and Mathematical Sciences IEEE International Symposium on Information Theory (2012 : Cambridge, US) DRNTU::Science::Mathematics Lattice coding over a Gaussian wiretap channel is considered with respect to a lattice invariant called the secrecy gain, which was introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In this paper, secrecy gains of several 2- and 3-modular lattices are computed. Most are shown to have a secrecy gain larger than the best unimodular lattices can achieve. Accepted version 2012-09-19T04:45:12Z 2019-12-06T19:02:25Z 2012-09-19T04:45:12Z 2019-12-06T19:02:25Z 2012 2012 Conference Paper Lin, F., & Oggier, F. (2012). Secrecy Gain of Gaussian Wiretap Codes from 2- and 3-Modular Lattices. 2012 IEEE International Symposium on Information Theory Proceedings, pp.1747-1751. https://hdl.handle.net/10356/94795 http://hdl.handle.net/10220/8571 10.1109/ISIT.2012.6283577 164467 en © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/ISIT.2012.6283577]. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Science::Mathematics |
spellingShingle |
DRNTU::Science::Mathematics Lin, Fuchun Oggier, Frederique Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
description |
Lattice coding over a Gaussian wiretap channel is considered with respect to a lattice invariant called the secrecy gain, which was introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In this paper, secrecy gains of several 2- and 3-modular lattices are computed. Most are shown to have a secrecy gain larger than the best unimodular lattices can achieve. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Lin, Fuchun Oggier, Frederique |
format |
Conference or Workshop Item |
author |
Lin, Fuchun Oggier, Frederique |
author_sort |
Lin, Fuchun |
title |
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
title_short |
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
title_full |
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
title_fullStr |
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
title_full_unstemmed |
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices |
title_sort |
secrecy gain of gaussian wiretap codes from 2- and 3-modular lattices |
publishDate |
2012 |
url |
https://hdl.handle.net/10356/94795 http://hdl.handle.net/10220/8571 |
_version_ |
1759858345979674624 |