Comments on "Physical-layer cryptography through massive MIMO"

We present two attacks on two different versions of physical layer cryptography schemes based on massive multiple-input multiple-output (MIMO). Both cryptosystems employ a singular value decomposition (SVD) precoding technique. For the first one, we show that the eavesdropper (who knows its own channel and the channel between legitimate users) can decrypt the information data under the same condition as the legitimate receiver. We study the signal-to-noise advantage ratio for decoding by the legitimate user over the eavesdropper in a more generalized scheme when an arbitrary precoder at the transmitter is employed. On the negative side, we show that if the eavesdropper uses a number of receive antennas much larger than the number of legitimate user antennas, then there is no advantage, independent of the precoding scheme employed at the transmitter. On the positive side, for the case where the adversary is limited to have the same number of antennas as legitimate users, we give an $O\left(n^2\right)$ upper bound on the advantage and show that this bound can be approached using an inverse precoder. For the second cryptosystem, we show that the required security conditions prevent the legitimate user from decoding the plaintext uniquely.

[1]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[2]  Tony Q. S. Quek,et al.  Jamming-Aided Secure Communication in Massive MIMO Rician Channels , 2015, IEEE Transactions on Wireless Communications.

[3]  Vijay K. Bhargava,et al.  Secure Transmission in Multicell Massive MIMO Systems , 2014, IEEE Transactions on Wireless Communications.

[4]  Ron Steinfeld,et al.  On massive MIMO physical layer cryptosystem , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[5]  Phong Q. Nguyen,et al.  The LLL Algorithm - Survey and Applications , 2009, Information Security and Cryptography.

[6]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[7]  Giuseppe Caire,et al.  Asymptotic Performance of Linear Receivers in MIMO Fading Channels , 2008, IEEE Transactions on Information Theory.

[8]  Guillermo Morales-Luna,et al.  Analysis of Keyless Massive MIMO-based Cryptosystem Security , 2015, IACR Cryptol. ePrint Arch..

[9]  Fredrik Rusek,et al.  Physical layer security for massive MIMO: An overview on passive eavesdropping and active attacks , 2015, IEEE Communications Magazine.

[10]  S. Ole Warnaar,et al.  The importance of the Selberg integral , 2007, 0710.3981.

[11]  Yehuda Lindell,et al.  Introduction to Modern Cryptography , 2004 .

[12]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[13]  V. Prasolov Problems and theorems in linear algebra , 1994 .

[14]  A. Edelman Eigenvalues and condition numbers of random matrices , 1988 .

[15]  Vijay K. Bhargava,et al.  Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems , 2015, IEEE Transactions on Wireless Communications.

[16]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[17]  Frédérique E. Oggier,et al.  The secrecy capacity of the MIMO wiretap channel , 2008, ISIT.

[18]  Peter Harremoës,et al.  Rényi Divergence and Kullback-Leibler Divergence , 2012, IEEE Transactions on Information Theory.

[19]  A. Rukhin Matrix Variate Distributions , 1999, The Multivariate Normal Distribution.

[20]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[21]  Tony Q. S. Quek,et al.  Secure communication via jamming in massive MIMO Rician channels , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

[22]  László Babai,et al.  On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..

[23]  L. Hogben Handbook of Linear Algebra , 2006 .

[24]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.