Cryptographic Functions from Worst-Case Complexity Assumptions - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Daniele Micciancio. Cryptographic Functions from Worst-Case Complexity Assumptions. In Phong Q. Nguyen, Brigitte Vallée, editors, The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pages 427-452, Springer, 2010. [doi]

The following publications are possibly variants of this publication:

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptionsDaniele Micciancio. eccc, (095), 2004. [doi]

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptionsDaniele Micciancio. iacr, 2004:286, 2004. [doi]

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity AssumptionsDaniele Micciancio. focs 2002: 356-365 [doi]

runs on WebDSL