"Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision ..."

Daniele Micciancio, Petros Mol (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22792-9_26

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/crypto/MicciancioM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/MicciancioM11
Daniele Micciancio, Petros Mol:
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. CRYPTO 2011: 465-484

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.