Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security

We present an overview of recent advances in the Area of information security using algebraic number fields. This overview indicates the importance of modular lattices in information security and in recently proposed methods for obtaining modular lattices using algebraic number fields. Obtaining Construction a unimodular lattices using cyclotomic number fields of prime orders have been addressed in the literature. Recently, a new lattice invariant called secrecy gain has been defined and it has been shown that it characterizes the confusion at the eavesdropper when using lattices in the Gaussian wiretap channels. There is a symmetry point, called weak secrecy gain, in the secrecy function of modular lattices. It is conjectured that the weak secrecy gain is the secrecy gain. It is known that d-modular lattices with high level d are more likely to have a large length for the shortest nonzero vector, which results in a higher weak secrecy gain. In search of such lattices, we prove that there is no modular lattices built using Construction A over cyclotomic fields of prime power order p{n}, with n > 1. We also present a new framework based on Construction A lattices and cyclotomic number fields that gives a family of p-modular lattices with p\equiv 1 (\mathrm {m}\mathrm {o}\mathrm {d}~4)

Construction of full-diversity 1-level LDPC lattices for block-fading channels

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. When we consider Construction D' of lattices with one binary LDPC code as its underlying code, 1-level LDPC lattices are obtained. Block fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. In this type of channel, a lattice point is divided into multiple blocks such that fading is constant within a block but changes, independently, across blocks. The design of lattices for BF channels offers a challenging problem, which differs greatly from its counterparts like AWGN channels. In this paper we construct full diversity 1-level LDPC lattices for block fading channels. We propose a new iterative decoding method for these family of lattices which has complexity that grows linearly in the dimension of lattice