Back to Results
First PageMeta Content
Algebra / Learning with errors / Lattice / Ideal lattice cryptography / Quantum algorithm / Algebraic number field / Order / Normal distribution / Homomorphic encryption / Abstract algebra / Cryptography / Mathematics


On Ideal Lattices and Learning with Errors Over Rings∗ Vadim Lyubashevsky† Chris Peikert‡
Add to Reading List

Document Date: 2012-04-24 16:40:38


Open Document

File Size: 572,29 KB

Share Result on Facebook

City

Paris / /

Company

Wolfson Family Charitable Trust / Gaussian / /

Country

Israel / /

Currency

Rs / /

Facility

College of Computing / Tel Aviv University / Georgia Institute of Technology / /

IndustryTerm

time quantum algorithms / search version / cryptographic applications / inner product / search-to-decision reduction / quantum machinery / polynomial-time quantum algorithms / public-key encryption applications / noisy product / decryption algorithm / short integer solution / search problem / encryption algorithm / algebraic and algorithmic tools / noisy products / quantum algorithms / /

Organization

School of Computer Science / Alfred P. Sloan Foundation / INRIA / Sloan Foundation / National Science Foundation / Israel Science Foundation / Binational Science Foundation / Georgia Institute of Technology / European Commission / Tel Aviv University / Ecole Normale Sup´erieure / European Research Council / College of Computing / /

Person

Vadim Lyubashevsky† Chris Peikert / Damien Stehl / Ron Steinfeld / Chris Peikert‡ Oded Regev / Keisuke Tanaka / Oded Regev§ April / Keita Xagawa / /

Position

author / worst-case approximate SVP / SVP / approximate SVP / /

ProgrammingLanguage

R / /

ProvinceOrState

Georgia / /

Technology

encryption / cryptography / public key / quantum algorithms / encryption algorithm / polynomial-time quantum algorithms / secure public-key encryption / identity-based encryption / secret key / time quantum algorithms / decryption algorithm / key-generation algorithm / /

SocialTag