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

	425 Documenta Math. Volumes of Symmetric Spaces via Lattice Points Henri Gillet and Daniel R. Grayson DocID: 1sxxW - View Document
	Documenta Mathematica Band 11, 2006 Igor Wigman Statistics of Lattice Points in Thin Annuli for Generic Lattices DocID: 1rUGj - View Document
	425 Documenta Math. Volumes of Symmetric Spaces via Lattice Points Henri Gillet and Daniel R. Grayson DocID: 1rpFm - View Document
	Engineering Dirac points with ultracold fermions in a tunable optical lattice Daniel Greif1,∗ , Leticia Tarruell1,2 , Thomas Uehlinger1 , Gregor Jotzu1 and Tilman Esslinger1 1. Institute for Quantum Electronics, ETH Zu DocID: 1qWSP - View Document
	8 Quantum Cluster Methods Erik Koch Computational Materials Science German Research School for Simulation Sciences DocID: 1qxfI - View Document