Please use this identifier to cite or link to this item:
Title: Secrecy gain of Gaussian wiretap codes from unimodular lattices
Authors: Lin, Fuchun
Oggier, Frederique
Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Cryptography
Issue Date: 2011
Source: Lin, F., & Oggier, F. (2011). Secrecy Gain of Gaussian Wiretap Codes from Unimodular Lattices. Paper presented at the Information Theory Workshop (ITW), 2011 IEEE, 718-722.
Abstract: We consider lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to the transmissions between a transmitter and a legitimate receiver. In [1], a new lattice invariant called the secrecy gain was introduced as a code design criterion for wiretap lattice codes, shown to characterize the confusion that a chosen lattice code can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In this paper, a formula for the secrecy gain of unimodular lattices is derived. Secrecy gains of extremal odd unimodular lattices as well as unimodular lattices in dimension 16 are computed and compared. Finally, best wiretap lattice codes coming from unimodular lattices in dimension n, 8 ≤ n ≤ 16 are classified.
DOI: 10.1109/ITW.2011.6089529
Rights: © 2011 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: ]
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Conference Papers

Files in This Item:
File Description SizeFormat 
finalrevised.pdf270.29 kBAdobe PDFThumbnail

Citations 20

checked on Sep 5, 2020

Page view(s) 50

checked on Oct 24, 2020

Download(s) 50

checked on Oct 24, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.