4.5 Article

Smoothing Codes and Lattices: Systematic Study and New Bounds

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Proceedings Paper Computer Science, Information Systems

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing

Zvika Brakerski et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT III (2019)

Article Computer Science, Information Systems

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

Cong Ling et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2014)

Article Computer Science, Theory & Methods

MORE ON AVERAGE CASE VS APPROXIMATION COMPLEXITY

Michael Alekhnovich

COMPUTATIONAL COMPLEXITY (2011)

Article Computer Science, Theory & Methods

Worst-case to average-case reductions based on Gaussian measures

Daniele Micciancio et al.

SIAM JOURNAL ON COMPUTING (2007)

Article Computer Science, Information Systems

Bounds on distance distributions in codes of known size

AE Ashikhmin et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2005)

Article Mathematics

New upper bounds on sphere packings I

H Cohn et al.

ANNALS OF MATHEMATICS (2003)