Back to Results
First PageMeta Content
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


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 has
Add to Reading List

Document Date: 2015-01-19 12:06:15


Open Document

File Size: 526,32 KB

Share Result on Facebook

City

Introduction Lattice / Lattice / /

Company

NTL / Ge / /

Facility

University of London Abstract / NTL library / /

IndustryTerm

software conventions / dimensional algorithm / subexponential algorithm / lattice reduction algorithms / inner product / local block pre-processing / reduction algorithms / sub-exponential algorithm / actual systems / usual dot product / present algorithms / dot product / lattice reduction algorithm / search tree / mathematics software / software packages / quantum algorithms / /

Organization

University of London Abstract / /

Person

Hierarchical Identity / /

Position

refined model for estimating their running times / SVP / General / /

Technology

encryption / cryptography / two dimensional algorithm / Public Key / lattice reduction algorithm / lattice reduction algorithms / quantum algorithms / sub-exponential algorithm / BKZ algorithm / Gauss algorithm / 3.2 BKZ The BKZ algorithm / 5 3 Lattice Reduction Algorithms / subexponential algorithm / /

SocialTag