![Computational complexity theory / Lattice problem / Computational number theory / Lattice points / Theoretical computer science / Algorithm / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Time complexity / Lattice-based cryptography / Mathematics / Applied mathematics / Cryptography Computational complexity theory / Lattice problem / Computational number theory / Lattice points / Theoretical computer science / Algorithm / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Time complexity / Lattice-based cryptography / Mathematics / Applied mathematics / Cryptography](https://www.pdfsearch.io/img/1a50b055efdec18fe804ad1f5f81c670.jpg) Date: 2014-08-07 13:48:08Computational complexity theory Lattice problem Computational number theory Lattice points Theoretical computer science Algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Time complexity Lattice-based cryptography Mathematics Applied mathematics Cryptography | | Fast Lattice Point Enumeration with Minimal Overhead∗ Daniele Micciancio UCSD [removed] Michael WalterAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 651,27 KBShare Document on Facebook
|