Nearest lattice problem, diophantine approximation April 12, L´ aszl´ o Babai. On Lov´

First Page		Document Content
Date: 2014-04-12 03:21:07 Lattice-based cryptography Lattice problem Lattice Sanjeev Arora		Nearest lattice problem, diophantine approximation April 12, L´ aszl´ o Babai. On Lov´ Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 70,97 KB Share Document on Facebook

	Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance Shi Bai1 , Tancrède Lepoint3 , Adeline Roux-Langlois4 , Amin Sakzad5 , Damien Stehlé2 , and Ron S DocID: 1xTbf - View Document
	Some Recent Uses of Stern-like Protocols in Lattice-Based Cryptography Khoa Nguyen, Nanyang Technological University Quantum-Safe Crypto Workshop, CQT, NUS October, 3rd, 2016 DocID: 1tO6O - View Document
	Lattice-Based Cryptography in Java Advisor(s): Christian Hanser and Sebastian Ramacher Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria Motivation DocID: 1s7AV - View Document
	¨ Bases) Interactions between Computer Algebra (Grobner and Cryptology ` DocID: 1qRIx - View Document
	Lattice Cryptography: A White Paper Daniele Micciancio∗ March 16, 2010 1 DocID: 1pUoS - View Document