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

DOI10.1007/S00200-015-0267-2zbMATH Open1343.94098arXiv1304.4440OpenAlexW1538720896MaRDI QIDQ893349FDOQ893349

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

Publication date: 19 November 2015

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

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.

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

Recommendations

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

zbMATH Keywords

theta seriesmodular latticesGaussian channelwiretap codeslattice codessecrecy gain

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

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

Cited In (3)

• On the Secrecy Gain of Extremal Even l-modular Lattices
• Modular lattices from a variation of construction A over number fields
• On the Secrecy Gain of $\ell$-Modular Lattices

Uses Software

• Magma
• Mathematica

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)