An improved compression technique for signatures based on learning with errors Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand.

First Page		Document Content
Date: 2014-01-22 16:26:55 Cryptography Post-quantum cryptography Lattice-based cryptography Computational hardness assumptions Ring learning with errors Learning with errors Digital signature Hash function Multivariate random variable Normal distribution RSA Entropy		An improved compression technique for signatures based on learning with errors Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand. Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 444,59 KB Share Document on Facebook

	Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with: DocID: 1r2Hf - View Document
	Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 DocID: 1qjra - View Document
	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 DocID: 1q2Qr - View Document
	Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger DocID: 1pMu4 - View Document
	Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda DocID: 1mJoe - View Document