Communication-Efficient Search for an Approximate Closest Lattice Point

We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point considered here is the one obtained using the nearest-plane (Babai) algorithm. Assuming a triangular special basis for the lattice, we develop communication-efficient protocols for computing the approximate lattice point and determine the communication cost for lattices of dimension n>1. Based on available parameterizations of reduced bases, we determine the error probability of the nearest plane algorithm for two dimensional lattices analytically, and present a computational error estimation algorithm in three dimensions. For dimensions 2 and 3, our results show that the error probability increases with the packing density of the lattice.

[1]  Oded Goldreich,et al.  Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.

[2]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Sean A. Ramprashad,et al.  Cellular and Network MIMO architectures: MU-MIMO spectral efficiency and costs of channel state information , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[5]  John H. Conway,et al.  The sensual (quadratic) form , 1997 .

[6]  Munther A. Dahleh,et al.  Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels , 2010, IEEE Transactions on Information Theory.

[7]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[8]  Sueli I. Rodrigues Costa,et al.  On the communication cost of determining an approximate nearest lattice point , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Vinay A. Vaishampayan,et al.  Communication cost of transforming a nearest plane partition to the Voronoi partition , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[11]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

[12]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

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

[15]  Graham Cormode,et al.  Communication-efficient distributed monitoring of thresholded counts , 2006, SIGMOD Conference.

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

[17]  Prakash Ishwar,et al.  Some Results on Distributed Source Coding for Interactive Function Computation , 2011, IEEE Transactions on Information Theory.

[18]  Chris Peikert,et al.  A Decade of Lattice Cryptography , 2016, Found. Trends Theor. Comput. Sci..

[19]  Neil J. A. Sloane,et al.  Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[20]  J. Hoffstein,et al.  An introduction to mathematical cryptography , 2008 .

[21]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[22]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[23]  Shafi Goldwasser,et al.  Complexity of lattice problems , 2002 .

[24]  Steven D. Galbraith,et al.  Mathematics of Public Key Cryptography , 2012 .