On the public citation graph
A practical attack against knapsack based hash functions
0 signed · 20 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/3-540-46416-6_3openalex-snapshot
The Knapsack Hash Function proposed at Crypto’89 can be broken
inferredcites →https://doi.org/10.1007/3-540-54458-5_51openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11554868_6openalex-snapshot
A Family of Fast Syndrome Based Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/11787006_13openalex-snapshot
Generalized Compact Knapsacks Are Collision Resistant
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_8openalex-snapshot
The State of Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-540-71039-4_4openalex-snapshot
SWIFFT: A Modest Proposal for FFT Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_12openalex-snapshot
New Generic Algorithms for Hard Knapsacks
inferred← citeshttps://doi.org/10.1007/978-3-642-22497-3_10openalex-snapshot
Faster and Smoother – VSH Revisited
inferred← citeshttps://doi.org/10.1007/bfb0000443openalex-snapshot
Collisions and inversions for Damgård's whole hash function
inferred← citeshttps://doi.org/10.1007/s001459900042openalex-snapshot
Lattice Reduction: A Toolbox for the Cryptanalyst
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102782openalex-snapshot
A comprehensive review on collision-resistant hash functions on lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03033openalex-snapshot
Fractal and Multi-Fractal Analysis for A Family of Subset Sum Functions: Combinatorial Structures of Embedding Dimension $1$
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5250openalex-snapshot
Cryptographic Hash Functions in Groups and Provable Properties
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.