Keywords
Lattice problemKnapsack problemHash functionCollisionCollision resistanceComputer scienceAlgebraic numberFunction (biology)Algebraic number theoryCollision attackLattice (music)Discrete mathematicsMathematicsAlgorithmPerfect hash functionCryptographyCryptographic hash function
Affiliated Institutions
Related Publications
Improved cryptographic hash functions with worst-case/average-case connection
(MATH) We define a new family of collision resistant hash functions whose security is based on the worst case hardness of approximating the covering radius of a lattice within a...
Cryptanalysis of the Chor-Rivest cryptosystem
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. We show how to break t...
An ID-based cryptosystem based on the discrete logarithm problem
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...
A New Approach for Algebraically Homomorphic Encryption.
The existence of an efficient and provably secure algebraically homomorphic scheme (AHS), i.e., one that supports both addition and multiplication operations, is a long stated o...
Publication Info
- Year
- 2006
- Type
- book-chapter
- Pages
- 144-155
- Citations
- 252
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
252
OpenAlex
Cite This
Vadim Lyubashevsky,
Daniele Micciancio
(2006).
Generalized Compact Knapsacks Are Collision Resistant.
Lecture notes in computer science
, 144-155.
https://doi.org/10.1007/11787006_13
Identifiers
- DOI
- 10.1007/11787006_13