Smoothing Codes and Lattices: Systematic Study and New Bounds
In this article we revisit smoothing bounds in parallel between lattices \(and\) codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many lattice-based cryptosystems. Unencumbered by direct appli...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
08.09.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!