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

	Post-quantum key exchange for the TLS protocol from the ring learning with errors problem Joppe W. Bos1 , Craig Costello2 , Michael Naehrig2 , and Douglas Stebila3,∗ 1 2 3 DocID: 1t0QS - View Document
	Vulnerable Galois RLWE Families and Improved Attacks Hao Chen, Kristin E. Lauter, Katherine E. Stange 1. Introduction Lattice-based cryptography was introduced in the mid 1990s in two different forms, independently by Aj DocID: 1p0Fw - View Document
	Quantum Money from Hidden Subspaces DocID: 1mjFE - View Document
	Post-quantum key exchange for the TLS protocol from the ring learning with errors problem Douglas Stebila Queensland University of Technology joint work with Joppe Bos (NXP), DocID: 1lu0H - View Document
	Post-quantum key exchange for the TLS protocol from the ring learning with errors problem Joppe W. Bos1 , Craig Costello2 , Michael Naehrig2 , and Douglas Stebila3,∗ 1 2 3 DocID: 18fXj - View Document