Back to Results
First PageMeta Content
Cryptography / Analytic geometry / Lattice / Lattice points / Quadratic forms / Ideal lattice cryptography / Spectral theory of ordinary differential equations / Algebra / Mathematics / Abstract algebra


Generating Shorter Bases for Hard Random Lattices Jo¨el Alwen∗ New York University Chris Peikert † Georgia Institute of Technology
Add to Reading List

Document Date: 2010-06-25 13:43:28

Open Document

File Size: 327,03 KB

Share Result on Facebook

Company

SRI International / Zm / GGH / /

Facility

University Chris Peikert / Georgia Institute of Technology May / /

IndustryTerm

improved generation algorithm / certain cryptographic applications / matrix product / cryptographic applications / probabilistic polynomial-time algorithm / above applications / quotient / valid solution / smallest positive integer solution / particular generation algorithm / quantum algorithms / /

Organization

New York University / National Science Foundation / Georgia Institute of Technology / /

Person

Chris Peikert / Az / /

Position

author / representative / /

Product

Hermite / M1 Abrams / /

Technology

cryptography / public key / quantum algorithms / public-key encryption / improved generation algorithm / identity-based encryption / 7 Algorithm / secret key / probabilistic polynomial-time algorithm / digital signature / particular generation algorithm / two algorithms / /

SocialTag