%0 Journal Article %1 journals/iacr/MicciancioM11 %A Micciancio, Daniele %A Mol, Petros %D 2011 %J IACR Cryptology ePrint Archive %K %P 521 %T Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. %U http://dblp.uni-trier.de/db/journals/iacr/iacr2011.html#MicciancioM11 %V 2011

@article{journals/iacr/MicciancioM11, added-at = {2023-12-13T04:54:41.000+0100}, author = {Micciancio, Daniele and Mol, Petros}, biburl = {https://www.bibsonomy.org/bibtex/256174a57845efb4f37a827f95dcbacc3/admin}, ee = {http://eprint.iacr.org/2011/521}, interhash = {9bf3c0d34f9e49ec0c6f478de015213d}, intrahash = {56174a57845efb4f37a827f95dcbacc3}, journal = {IACR Cryptology ePrint Archive}, keywords = {}, pages = 521, timestamp = {2023-12-13T04:54:41.000+0100}, title = {Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.}, url = {http://dblp.uni-trier.de/db/journals/iacr/iacr2011.html#MicciancioM11}, volume = 2011, year = 2011 }