Skip to main content
Article thumbnail
Location of Repository

Generalized compact knapsacks are collision resistant

By Vadim Lyubashevsky and Daniele Micciancio

Abstract

n.A step in the direction of creating efficient cryptographic functions based on worst-case hardness wa

Topics: hash functions, lattices, worst-case to average-case reductions, knapsacks
Publisher: Springer
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.2183
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ucsd.edu/~daniel... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.