Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices Shi Bai1 , Damien Stehl´e1 and Weiqiang Wen1 1

First Page		Document Content
Date: 2016-08-31 11:57:10 Algebra Mathematics Cryptography Linear algebra Lattice-based cryptography Post-quantum cryptography Lattice points Computational hardness assumptions Lattice Euclidean vector Basis Crystal structure		Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices Shi Bai1 , Damien Stehl´e1 and Weiqiang Wen1 1 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 471,84 KB Share Document on Facebook

	Abstract Interpretation over Non-Lattice Abstract Domains Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Department of Computing and Information Systems, The University of Melbour DocID: 1xUNu - View Document
	Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP DocID: 1xUmT - View Document
	CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee DocID: 1xUb2 - View Document
	Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe September 03, 2018 DocID: 1xU1Q - View Document
	arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition, DocID: 1xU0M - View Document