Tel-Aviv University / University of California / /
IndustryTerm
polynomial time quantum algorithm / advent quantum algorithms / lattice reduction algorithms / cryptographic applications / polynomial time algorithm / slower and more precise algorithms / related quantum algorithms / quantum factoring algorithm / remarkable subexponential time algorithms / lattice reduction algorithm / studied algorithm / actual quantum algorithms / short solution / quantum algorithms / lattice algorithms / /
Organization
School of Computer Science / National Science Foundation / Israel Science Foundation / Binational Science Foundation / CSE Department / European Commission / European Research Council / Tel-Aviv University / Tel-Aviv / University of California / San Diego / /
Person
Daniele Micciancio∗ Oded Regev / / /
Position
SVP / approximate SVP / /
ProvinceOrState
California / /
Technology
encryption / known quantum algorithms / Cryptography / known lattice reduction algorithm / related quantum algorithms / public key / quantum algorithms / lattice reduction algorithms / polynomial time algorithm / lattice algorithms / advent quantum algorithms / interesting quantum algorithms / factoring algorithm / LLL algorithm / block cipher / polynomial time quantum algorithm / actual quantum algorithms / quantum factoring algorithm / digital signature / using quantum algorithms / known lattice reduction algorithms / structured keys A. In Algorithm / remarkable subexponential time algorithms / /
Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008