Related references
Note: Only part of the references are listed.Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
Zvika Brakerski et al.
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT III (2019)
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
Cong Ling et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2014)
MORE ON AVERAGE CASE VS APPROXIMATION COMPLEXITY
Michael Alekhnovich
COMPUTATIONAL COMPLEXITY (2011)
Worst-case to average-case reductions based on Gaussian measures
Daniele Micciancio et al.
SIAM JOURNAL ON COMPUTING (2007)
Bounds on distance distributions in codes of known size
AE Ashikhmin et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
New upper bounds on sphere packings I
H Cohn et al.
ANNALS OF MATHEMATICS (2003)
Share Paper
