Solving LWE problem with bounded errors in polynomial time Jintai Ding1,2 Southern Chinese University of Technology, 1 University of Cincinnati, 2 [removed] - Learning with errors - Document - PDFSEARCH.IO

First Page	Meta Content
	Solving LWE problem with bounded errors in polynomial time Jintai Ding1,2 Southern Chinese University of Technology, 1 University of Cincinnati, 2 [removed] Add to Reading List Document Date: 2010-11-02 07:13:56 Open Document File Size: 113,39 KB Share Result on Facebook City Darmstadt / / Company Ge / / / Facility Southern Chinese University of Technology / University of Cincinnati / / IndustryTerm et al. algorithm / polynomial solving algorithms / maximum likelihood algorithm / similar naive algorithms / cryptographic algorithms / / Organization polynomial time Jintai Ding1 / 2 Southern Chinese University of Technology / University of Cincinnati / National Science Foundation / / Person Sanjeev Arora / Rong Ge / Ai / Mohamed Saied Emam Mohamed / Daniel Cabarcas / Johannes Buchmann / Oded Regev / Kalai / / Position author / / ProgrammingLanguage E / / PublishedMedium Journal of the ACM / / Technology cryptography / maximum likelihood algorithm / Blum et al. algorithm / similar naive algorithms / cryptographic algorithms / polynomial solving algorithms / / SocialTag Cryptography Computational complexity theory Information theory Models of computation Learning with errors Lattice problem Quantum computer PP Low Theoretical computer science

Solving LWE problem with bounded errors in polynomial time Jintai Ding1,2 Southern Chinese University of Technology, 1 University of Cincinnati, 2 [removed]Add to Reading List