Order-LWE and the Hardness of Ring-LWE with Entropic Secrets Zvika Brakerski Renen Perlman Weizmann Institute of Science∗ Abstract

First Page		Document Content
Date: 2018-05-21 15:18:19 Cryptography Post-quantum cryptography Lattice-based cryptography Computational hardness assumptions Lie groups Ring learning with errors Learning with errors Lattice Homomorphic encryption Order Entropy Ring learning with errors key exchange		Order-LWE and the Hardness of Ring-LWE with Entropic Secrets Zvika Brakerski Renen Perlman Weizmann Institute of Science∗ Abstract Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 560,62 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