Cryptology ePrint Archive: Report 2019/1171

Almost universal codes for MIMO wiretap channels

Laura Luzzi and Roope Vehkalahti and Cong Ling

Abstract: Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel.

We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance / minimum determinant of the lattice and its dual should be maximized simultaneously.

Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case.

Category / Keywords: foundations / information theory, lattices

Original Publication (with minor differences): IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 64, pp. 7218-7241, Nov. 2018.

Date: received 8 Oct 2019

Contact author: c ling at imperial ac uk

Available format(s): PDF | BibTeX Citation

Version: 20191010:124929 (All versions of this report)

Short URL: ia.cr/2019/1171


[ Cryptology ePrint archive ]