2- and 3-modular lattice wiretap codes in small dimensions

DOI10.1007/S00200-015-0267-2MaRDI QIDQ893349zbMATH OpenOpenAlexFDO

Authors Fuchun Lin, Frédérique Oggier, Patrick Solé

Publication date 19 November 2015

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.4440

zbMATH Keywords

theta seriesmodular latticesGaussian channelwiretap codeslattice codessecrecy gain

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following up the study of unimodular lattice wiretap codes [1], this paper investigates 2- and 3-modular lattices and compares them with unimodular lattices. Most even 2- and 3-modular lattices are found to have better performance, that is, a higher secrecy gain than the best unimodular lattices in dimension n, n is between 2 and 23. Odd 2-modular lattices are considered, too, and three lattices are found to outperform the best unimodular lattices.

Recommendations

• On the secrecy gain of extremal even l-modular lattices
• Lattice codes for the Gaussian wiretap channel
• On the secrecy gain of -modular lattices
• scientific article; zbMATH DE number 1456827
• Wiretap lattice codes from number fields with no small norm elements

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3641577 (Why is no real title available?)
• scientific article; zbMATH DE number 203646 (Why is no real title available?)
• 2-modular lattices from ternary codes.
• A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions
• A note on optimal unimodular lattices
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• Applications of LDPC Codes to the Wiretap Channel
• Applications of coding theory to the construction of modular lattices
• Counterexample to the Generalized Belfiore–Solé Secrecy Function Conjecture for <inline-formula> <tex-math notation="LaTeX">$l$ </tex-math> </inline-formula>-Modular Lattices
• Information theoretic security
• Invertible Extractors and Wiretap Protocols
• Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
• Modular lattices in Euclidean spaces
• On a Conjecture by Belfiore and Solé on Some Lattices
• Semantic security for the wiretap channel
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• Some Results Related to the Conjecture by Belfiore and Sol&#x00E9;
• The Gaussian wire-tap channel
• The Wire-Tap Channel
• The shadow theory of modular and unimodular lattices
• Wire-Tap Channel II
• Wiretap lattice codes from number fields with no small norm elements

Cited in

(6)

• Wiretap lattice codes from number fields with no small norm elements
• On the secrecy gain of -modular lattices
• Lattice codes for the Gaussian wiretap channel
• Mathematics of digital communications: from finite fields to group rings and noncommutative algebra
• On the secrecy gain of extremal even l-modular lattices
• Modular lattices from a variation of construction A over number fields

Describes a project that uses

Uses Software

• Mathematica
• Magma

This page was built for publication: 2- and 3-modular lattice wiretap codes in small dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893349)