![Lattice points / Computational number theory / Abstract algebra / Lattice problem / Lattice reduction / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Learning with errors / Lattice / Projection / Mathematics / Cryptography / Algebra Lattice points / Computational number theory / Abstract algebra / Lattice problem / Lattice reduction / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Learning with errors / Lattice / Projection / Mathematics / Cryptography / Algebra](https://www.pdfsearch.io/img/0b3aaf2bbab847e31f54f68b4e4da3ae.jpg) Date: 2015-01-19 12:06:15Lattice points Computational number theory Abstract algebra Lattice problem Lattice reduction Lenstra–Lenstra–Lovász lattice basis reduction algorithm Learning with errors Lattice Projection Mathematics Cryptography Algebra | | On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem hasAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 526,32 KBShare Document on Facebook
|